./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:17:03,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:17:03,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-08 22:17:03,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:17:03,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:17:03,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:17:03,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:17:03,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:17:03,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:17:03,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:17:03,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:17:03,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:17:03,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:17:03,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:17:03,390 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:17:03,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:17:03,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:17:03,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:17:03,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:17:03,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:17:03,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:17:03,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:17:03,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:17:03,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:17:03,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:17:03,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:17:03,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:17:03,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:17:03,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:17:03,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:17:03,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:17:03,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:17:03,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:17:03,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:17:03,393 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-08 22:17:03,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:17:03,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:17:03,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:17:03,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:17:03,643 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:17:03,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2025-03-08 22:17:04,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70c07727d/5848773f57c8466d8d0f4aac3e6c8491/FLAG34b626fc5 [2025-03-08 22:17:05,034 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:17:05,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2025-03-08 22:17:05,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70c07727d/5848773f57c8466d8d0f4aac3e6c8491/FLAG34b626fc5 [2025-03-08 22:17:05,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70c07727d/5848773f57c8466d8d0f4aac3e6c8491 [2025-03-08 22:17:05,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:17:05,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:17:05,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:17:05,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:17:05,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:17:05,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73abb723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05, skipping insertion in model container [2025-03-08 22:17:05,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:17:05,592 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,621 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,626 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,631 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,638 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,671 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,672 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:17:05,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:17:05,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:17:05,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:17:05,788 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:17:05,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05 WrapperNode [2025-03-08 22:17:05,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:17:05,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:17:05,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:17:05,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:17:05,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,852 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1241 [2025-03-08 22:17:05,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:17:05,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:17:05,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:17:05,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:17:05,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,903 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-08 22:17:05,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:17:05,954 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:17:05,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:17:05,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:17:05,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (1/1) ... [2025-03-08 22:17:05,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:17:05,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:05,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:17:05,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:17:05,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 22:17:05,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 22:17:05,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 22:17:06,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 22:17:06,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 22:17:06,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:17:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:17:06,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:17:06,166 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:17:06,168 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:17:07,113 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-08 22:17:07,178 INFO L? ?]: Removed 296 outVars from TransFormulas that were not future-live. [2025-03-08 22:17:07,178 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:17:07,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:17:07,226 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 22:17:07,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:07 BoogieIcfgContainer [2025-03-08 22:17:07,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:17:07,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:17:07,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:17:07,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:17:07,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:17:05" (1/3) ... [2025-03-08 22:17:07,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5009d684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:17:07, skipping insertion in model container [2025-03-08 22:17:07,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:05" (2/3) ... [2025-03-08 22:17:07,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5009d684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:17:07, skipping insertion in model container [2025-03-08 22:17:07,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:07" (3/3) ... [2025-03-08 22:17:07,234 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-1.i [2025-03-08 22:17:07,244 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:17:07,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test2-1.i that has 4 procedures, 371 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-08 22:17:07,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:17:07,292 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;@7ad6c6b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:17:07,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 22:17:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 356 states have (on average 1.6207865168539326) internal successors, (577), 358 states have internal predecessors, (577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:17:07,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:07,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:17:07,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:07,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:07,306 INFO L85 PathProgramCache]: Analyzing trace with hash 20500437, now seen corresponding path program 1 times [2025-03-08 22:17:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:07,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133069539] [2025-03-08 22:17:07,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:07,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:17:07,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:17:07,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:07,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:17:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133069539] [2025-03-08 22:17:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133069539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:07,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:17:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007757251] [2025-03-08 22:17:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:07,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:17:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:07,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:17:07,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:17:07,536 INFO L87 Difference]: Start difference. First operand has 363 states, 356 states have (on average 1.6207865168539326) internal successors, (577), 358 states have internal predecessors, (577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:07,840 INFO L93 Difference]: Finished difference Result 524 states and 765 transitions. [2025-03-08 22:17:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:17:07,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:17:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:07,850 INFO L225 Difference]: With dead ends: 524 [2025-03-08 22:17:07,852 INFO L226 Difference]: Without dead ends: 520 [2025-03-08 22:17:07,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:17:07,856 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 237 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:07,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1409 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:17:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-08 22:17:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 517. [2025-03-08 22:17:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.4696673189823874) internal successors, (751), 512 states have internal predecessors, (751), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 757 transitions. [2025-03-08 22:17:07,921 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 757 transitions. Word has length 4 [2025-03-08 22:17:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:07,922 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 757 transitions. [2025-03-08 22:17:07,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 757 transitions. [2025-03-08 22:17:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 22:17:07,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:07,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:07,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:17:07,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:07,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1027857270, now seen corresponding path program 1 times [2025-03-08 22:17:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390478058] [2025-03-08 22:17:07,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:07,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:17:07,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:17:07,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:07,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:17:08,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:08,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390478058] [2025-03-08 22:17:08,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390478058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:08,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:08,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:17:08,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780400498] [2025-03-08 22:17:08,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:08,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:17:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:08,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:17:08,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:17:08,193 INFO L87 Difference]: Start difference. First operand 517 states and 757 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:08,347 INFO L93 Difference]: Finished difference Result 523 states and 749 transitions. [2025-03-08 22:17:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:17:08,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-03-08 22:17:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:08,351 INFO L225 Difference]: With dead ends: 523 [2025-03-08 22:17:08,351 INFO L226 Difference]: Without dead ends: 523 [2025-03-08 22:17:08,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:17:08,352 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 105 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:08,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1281 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:17:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-08 22:17:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 517. [2025-03-08 22:17:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.442270058708415) internal successors, (737), 512 states have internal predecessors, (737), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 743 transitions. [2025-03-08 22:17:08,373 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 743 transitions. Word has length 65 [2025-03-08 22:17:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:08,373 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 743 transitions. [2025-03-08 22:17:08,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 743 transitions. [2025-03-08 22:17:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 22:17:08,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:08,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:08,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:17:08,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:08,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash 880109711, now seen corresponding path program 1 times [2025-03-08 22:17:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852868135] [2025-03-08 22:17:08,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:08,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:17:08,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:17:08,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:08,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:17:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852868135] [2025-03-08 22:17:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852868135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:08,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:08,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:17:08,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659677771] [2025-03-08 22:17:08,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:08,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:17:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:08,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:17:08,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:17:08,845 INFO L87 Difference]: Start difference. First operand 517 states and 743 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:09,072 INFO L93 Difference]: Finished difference Result 713 states and 1025 transitions. [2025-03-08 22:17:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:17:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-03-08 22:17:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:09,075 INFO L225 Difference]: With dead ends: 713 [2025-03-08 22:17:09,076 INFO L226 Difference]: Without dead ends: 710 [2025-03-08 22:17:09,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:17:09,077 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 500 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:09,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1950 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:17:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-03-08 22:17:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 362. [2025-03-08 22:17:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 356 states have (on average 1.4382022471910112) internal successors, (512), 357 states have internal predecessors, (512), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 518 transitions. [2025-03-08 22:17:09,093 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 518 transitions. Word has length 65 [2025-03-08 22:17:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:09,094 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 518 transitions. [2025-03-08 22:17:09,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 518 transitions. [2025-03-08 22:17:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 22:17:09,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:09,096 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] [2025-03-08 22:17:09,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:17:09,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:09,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash -980671067, now seen corresponding path program 1 times [2025-03-08 22:17:09,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:09,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312550123] [2025-03-08 22:17:09,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:09,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:09,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 22:17:09,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 22:17:09,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:09,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:17:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312550123] [2025-03-08 22:17:09,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312550123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:09,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:09,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:17:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121620530] [2025-03-08 22:17:09,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:09,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:17:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:09,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:17:09,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:17:09,282 INFO L87 Difference]: Start difference. First operand 362 states and 518 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:09,396 INFO L93 Difference]: Finished difference Result 365 states and 514 transitions. [2025-03-08 22:17:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:17:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-03-08 22:17:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:09,398 INFO L225 Difference]: With dead ends: 365 [2025-03-08 22:17:09,398 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 22:17:09,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:17:09,398 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 105 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:09,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1260 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:17:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 22:17:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2025-03-08 22:17:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 356 states have (on average 1.4185393258426966) internal successors, (505), 357 states have internal predecessors, (505), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 511 transitions. [2025-03-08 22:17:09,408 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 511 transitions. Word has length 84 [2025-03-08 22:17:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:09,409 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 511 transitions. [2025-03-08 22:17:09,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 511 transitions. [2025-03-08 22:17:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 22:17:09,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:09,410 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] [2025-03-08 22:17:09,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:17:09,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:09,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 906242143, now seen corresponding path program 1 times [2025-03-08 22:17:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172679687] [2025-03-08 22:17:09,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:09,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 22:17:09,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 22:17:09,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:09,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:17:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:09,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172679687] [2025-03-08 22:17:09,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172679687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:09,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:09,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:17:09,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670735807] [2025-03-08 22:17:09,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:09,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:17:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:09,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:17:09,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:17:09,568 INFO L87 Difference]: Start difference. First operand 362 states and 511 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:09,700 INFO L93 Difference]: Finished difference Result 628 states and 895 transitions. [2025-03-08 22:17:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:17:09,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-03-08 22:17:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:09,704 INFO L225 Difference]: With dead ends: 628 [2025-03-08 22:17:09,704 INFO L226 Difference]: Without dead ends: 628 [2025-03-08 22:17:09,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:17:09,704 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 331 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:09,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1090 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:17:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-08 22:17:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 622. [2025-03-08 22:17:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 616 states have (on average 1.4366883116883118) internal successors, (885), 617 states have internal predecessors, (885), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 891 transitions. [2025-03-08 22:17:09,722 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 891 transitions. Word has length 84 [2025-03-08 22:17:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:09,722 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 891 transitions. [2025-03-08 22:17:09,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:17:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 891 transitions. [2025-03-08 22:17:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 22:17:09,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:09,724 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] [2025-03-08 22:17:09,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:17:09,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:09,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1403427332, now seen corresponding path program 1 times [2025-03-08 22:17:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:09,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71045589] [2025-03-08 22:17:09,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:09,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 22:17:09,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 22:17:09,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:09,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:17:10,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71045589] [2025-03-08 22:17:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71045589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175495054] [2025-03-08 22:17:10,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:10,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:10,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:10,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:10,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:17:10,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 22:17:10,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 22:17:10,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:10,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:10,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:17:10,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:10,417 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-03-08 22:17:10,440 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 16 treesize of output 17 [2025-03-08 22:17:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:17:11,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175495054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-08 22:17:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553895333] [2025-03-08 22:17:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:11,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:17:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:11,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:17:11,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:17:11,212 INFO L87 Difference]: Start difference. First operand 622 states and 891 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-03-08 22:17:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:12,996 INFO L93 Difference]: Finished difference Result 895 states and 1267 transitions. [2025-03-08 22:17:12,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:17:12,997 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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 99 [2025-03-08 22:17:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:13,000 INFO L225 Difference]: With dead ends: 895 [2025-03-08 22:17:13,000 INFO L226 Difference]: Without dead ends: 895 [2025-03-08 22:17:13,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:17:13,000 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 763 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:13,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 2779 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 22:17:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-08 22:17:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 647. [2025-03-08 22:17:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 641 states have (on average 1.4274570982839314) internal successors, (915), 642 states have internal predecessors, (915), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 921 transitions. [2025-03-08 22:17:13,017 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 921 transitions. Word has length 99 [2025-03-08 22:17:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:13,017 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 921 transitions. [2025-03-08 22:17:13,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-03-08 22:17:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 921 transitions. [2025-03-08 22:17:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 22:17:13,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:13,018 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-03-08 22:17:13,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:17:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 22:17:13,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:13,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2007076447, now seen corresponding path program 1 times [2025-03-08 22:17:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:13,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124344820] [2025-03-08 22:17:13,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:13,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 22:17:13,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:17:13,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:13,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:17:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124344820] [2025-03-08 22:17:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124344820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536837142] [2025-03-08 22:17:13,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:13,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:13,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:13,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:13,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:17:13,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 22:17:13,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:17:13,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:13,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:13,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:17:13,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:13,879 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-03-08 22:17:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:17:13,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536837142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:13,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-08 22:17:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719438280] [2025-03-08 22:17:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:13,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:17:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:13,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:17:13,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:17:13,903 INFO L87 Difference]: Start difference. First operand 647 states and 921 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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-03-08 22:17:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:14,056 INFO L93 Difference]: Finished difference Result 810 states and 1153 transitions. [2025-03-08 22:17:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:17:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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-03-08 22:17:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:14,060 INFO L225 Difference]: With dead ends: 810 [2025-03-08 22:17:14,060 INFO L226 Difference]: Without dead ends: 810 [2025-03-08 22:17:14,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:17:14,061 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 859 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:14,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1358 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:17:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-08 22:17:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 649. [2025-03-08 22:17:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 643 states have (on average 1.4261275272161742) internal successors, (917), 644 states have internal predecessors, (917), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 923 transitions. [2025-03-08 22:17:14,075 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 923 transitions. Word has length 100 [2025-03-08 22:17:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:14,075 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 923 transitions. [2025-03-08 22:17:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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-03-08 22:17:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 923 transitions. [2025-03-08 22:17:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 22:17:14,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:14,077 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] [2025-03-08 22:17:14,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:17:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 22:17:14,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:14,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1797042616, now seen corresponding path program 1 times [2025-03-08 22:17:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258033199] [2025-03-08 22:17:14,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:14,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 22:17:14,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 22:17:14,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:14,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:17:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258033199] [2025-03-08 22:17:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258033199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:17:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424037744] [2025-03-08 22:17:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:14,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:17:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:14,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:17:14,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:17:14,465 INFO L87 Difference]: Start difference. First operand 649 states and 923 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-03-08 22:17:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:14,799 INFO L93 Difference]: Finished difference Result 733 states and 1030 transitions. [2025-03-08 22:17:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:17:14,799 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), 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 155 [2025-03-08 22:17:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:14,802 INFO L225 Difference]: With dead ends: 733 [2025-03-08 22:17:14,802 INFO L226 Difference]: Without dead ends: 733 [2025-03-08 22:17:14,802 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-03-08 22:17:14,803 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1149 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:14,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 1372 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:17:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-08 22:17:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 516. [2025-03-08 22:17:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 510 states have (on average 1.4137254901960785) internal successors, (721), 511 states have internal predecessors, (721), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 727 transitions. [2025-03-08 22:17:14,812 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 727 transitions. Word has length 155 [2025-03-08 22:17:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:14,813 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 727 transitions. [2025-03-08 22:17:14,813 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), 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-03-08 22:17:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 727 transitions. [2025-03-08 22:17:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 22:17:14,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:14,814 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] [2025-03-08 22:17:14,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:17:14,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:14,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1419585878, now seen corresponding path program 1 times [2025-03-08 22:17:14,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:14,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408378047] [2025-03-08 22:17:14,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:14,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 22:17:14,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 22:17:14,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:17:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408378047] [2025-03-08 22:17:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408378047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060999883] [2025-03-08 22:17:15,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:15,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:15,150 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:15,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:17:15,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 22:17:15,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 22:17:15,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:15,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:15,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:17:15,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:17:15,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060999883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 22:17:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962507941] [2025-03-08 22:17:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:15,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:17:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:15,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:17:15,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:17:15,480 INFO L87 Difference]: Start difference. First operand 516 states and 727 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-03-08 22:17:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:15,681 INFO L93 Difference]: Finished difference Result 559 states and 784 transitions. [2025-03-08 22:17:15,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:17:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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 165 [2025-03-08 22:17:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:15,683 INFO L225 Difference]: With dead ends: 559 [2025-03-08 22:17:15,683 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 22:17:15,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:17:15,684 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 17 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:15,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1211 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:17:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 22:17:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 543. [2025-03-08 22:17:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 537 states have (on average 1.404096834264432) internal successors, (754), 538 states have internal predecessors, (754), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 760 transitions. [2025-03-08 22:17:15,693 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 760 transitions. Word has length 165 [2025-03-08 22:17:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:15,693 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 760 transitions. [2025-03-08 22:17:15,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-03-08 22:17:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 760 transitions. [2025-03-08 22:17:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 22:17:15,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:15,696 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-03-08 22:17:15,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:17:15,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:15,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash -994455534, now seen corresponding path program 1 times [2025-03-08 22:17:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918755936] [2025-03-08 22:17:15,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:15,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 22:17:15,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 22:17:15,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:15,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:17:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918755936] [2025-03-08 22:17:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918755936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:16,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:16,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:17:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119534986] [2025-03-08 22:17:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:16,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:17:16,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:16,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:17:16,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:17:16,222 INFO L87 Difference]: Start difference. First operand 543 states and 760 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-03-08 22:17:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:16,657 INFO L93 Difference]: Finished difference Result 555 states and 774 transitions. [2025-03-08 22:17:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:17:16,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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 166 [2025-03-08 22:17:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:16,659 INFO L225 Difference]: With dead ends: 555 [2025-03-08 22:17:16,659 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 22:17:16,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:17:16,660 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 8 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:16,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1818 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:17:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 22:17:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 551. [2025-03-08 22:17:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 545 states have (on average 1.4018348623853212) internal successors, (764), 546 states have internal predecessors, (764), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 770 transitions. [2025-03-08 22:17:16,671 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 770 transitions. Word has length 166 [2025-03-08 22:17:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:16,671 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 770 transitions. [2025-03-08 22:17:16,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-03-08 22:17:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 770 transitions. [2025-03-08 22:17:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 22:17:16,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:16,673 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, 1] [2025-03-08 22:17:16,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:17:16,673 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:16,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 730821230, now seen corresponding path program 1 times [2025-03-08 22:17:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060079157] [2025-03-08 22:17:16,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:16,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 22:17:16,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 22:17:16,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:16,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:17:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060079157] [2025-03-08 22:17:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060079157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:16,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:16,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:17:16,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070049656] [2025-03-08 22:17:16,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:16,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:17:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:16,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:17:16,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:17:16,964 INFO L87 Difference]: Start difference. First operand 551 states and 770 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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-03-08 22:17:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:17,477 INFO L93 Difference]: Finished difference Result 573 states and 800 transitions. [2025-03-08 22:17:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:17:17,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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 167 [2025-03-08 22:17:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:17,480 INFO L225 Difference]: With dead ends: 573 [2025-03-08 22:17:17,480 INFO L226 Difference]: Without dead ends: 573 [2025-03-08 22:17:17,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:17:17,480 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 12 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:17,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2153 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:17:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-08 22:17:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 567. [2025-03-08 22:17:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 561 states have (on average 1.4010695187165776) internal successors, (786), 562 states have internal predecessors, (786), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 792 transitions. [2025-03-08 22:17:17,491 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 792 transitions. Word has length 167 [2025-03-08 22:17:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:17,492 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 792 transitions. [2025-03-08 22:17:17,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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-03-08 22:17:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 792 transitions. [2025-03-08 22:17:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 22:17:17,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:17,494 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, 1] [2025-03-08 22:17:17,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:17:17,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:17,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2029731987, now seen corresponding path program 1 times [2025-03-08 22:17:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:17,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511428062] [2025-03-08 22:17:17,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:17,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 22:17:17,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 22:17:17,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:17,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:17:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511428062] [2025-03-08 22:17:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511428062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598512305] [2025-03-08 22:17:17,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:17,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:17,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:17,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:17,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:17:17,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 22:17:18,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 22:17:18,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:18,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:18,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 22:17:18,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:18,089 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-03-08 22:17:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:17:18,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598512305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-08 22:17:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607069133] [2025-03-08 22:17:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:18,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:17:18,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:18,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:17:18,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:17:18,505 INFO L87 Difference]: Start difference. First operand 567 states and 792 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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-03-08 22:17:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:19,541 INFO L93 Difference]: Finished difference Result 822 states and 1145 transitions. [2025-03-08 22:17:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:17:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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 167 [2025-03-08 22:17:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:19,545 INFO L225 Difference]: With dead ends: 822 [2025-03-08 22:17:19,545 INFO L226 Difference]: Without dead ends: 822 [2025-03-08 22:17:19,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:17:19,546 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 544 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:19,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2270 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:17:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-08 22:17:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 594. [2025-03-08 22:17:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 589 states have internal predecessors, (818), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 824 transitions. [2025-03-08 22:17:19,559 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 824 transitions. Word has length 167 [2025-03-08 22:17:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:19,559 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 824 transitions. [2025-03-08 22:17:19,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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-03-08 22:17:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 824 transitions. [2025-03-08 22:17:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 22:17:19,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:19,562 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, 1, 1] [2025-03-08 22:17:19,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:17:19,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:19,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 222825797, now seen corresponding path program 1 times [2025-03-08 22:17:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679882640] [2025-03-08 22:17:19,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:19,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 22:17:19,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 22:17:19,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:19,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:17:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679882640] [2025-03-08 22:17:20,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679882640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141674687] [2025-03-08 22:17:20,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:20,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:20,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:20,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:20,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:17:20,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 22:17:20,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 22:17:20,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:20,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:20,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:17:20,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:17:20,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141674687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-08 22:17:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866601631] [2025-03-08 22:17:20,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:20,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:17:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:20,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:17:20,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:17:20,477 INFO L87 Difference]: Start difference. First operand 594 states and 824 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-03-08 22:17:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:20,879 INFO L93 Difference]: Finished difference Result 634 states and 876 transitions. [2025-03-08 22:17:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:17:20,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 168 [2025-03-08 22:17:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:20,884 INFO L225 Difference]: With dead ends: 634 [2025-03-08 22:17:20,884 INFO L226 Difference]: Without dead ends: 634 [2025-03-08 22:17:20,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:17:20,885 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 34 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:20,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1923 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:17:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-08 22:17:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 620. [2025-03-08 22:17:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 614 states have (on average 1.3843648208469055) internal successors, (850), 615 states have internal predecessors, (850), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 856 transitions. [2025-03-08 22:17:20,895 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 856 transitions. Word has length 168 [2025-03-08 22:17:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:20,895 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 856 transitions. [2025-03-08 22:17:20,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-03-08 22:17:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 856 transitions. [2025-03-08 22:17:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 22:17:20,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:20,897 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, 1, 1, 1] [2025-03-08 22:17:20,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:17:21,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 22:17:21,101 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:21,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash -851166416, now seen corresponding path program 1 times [2025-03-08 22:17:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:21,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786842770] [2025-03-08 22:17:21,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:21,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:21,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 22:17:21,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 22:17:21,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:21,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:17:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786842770] [2025-03-08 22:17:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786842770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:17:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143594858] [2025-03-08 22:17:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:21,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:17:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:21,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:17:21,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:17:21,352 INFO L87 Difference]: Start difference. First operand 620 states and 856 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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-03-08 22:17:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:21,757 INFO L93 Difference]: Finished difference Result 626 states and 863 transitions. [2025-03-08 22:17:21,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:17:21,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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 169 [2025-03-08 22:17:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:21,759 INFO L225 Difference]: With dead ends: 626 [2025-03-08 22:17:21,760 INFO L226 Difference]: Without dead ends: 626 [2025-03-08 22:17:21,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:17:21,760 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 8 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:21,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1818 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:17:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-08 22:17:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2025-03-08 22:17:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 618 states have (on average 1.383495145631068) internal successors, (855), 619 states have internal predecessors, (855), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 861 transitions. [2025-03-08 22:17:21,770 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 861 transitions. Word has length 169 [2025-03-08 22:17:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:21,770 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 861 transitions. [2025-03-08 22:17:21,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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-03-08 22:17:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 861 transitions. [2025-03-08 22:17:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 22:17:21,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:21,772 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, 1, 1, 1, 1] [2025-03-08 22:17:21,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:17:21,772 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1277802903, now seen corresponding path program 1 times [2025-03-08 22:17:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443490013] [2025-03-08 22:17:21,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:21,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 22:17:21,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 22:17:21,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:21,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:17:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443490013] [2025-03-08 22:17:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443490013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:22,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:22,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:17:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780603744] [2025-03-08 22:17:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:22,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:17:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:22,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:17:22,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:17:22,002 INFO L87 Difference]: Start difference. First operand 624 states and 861 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-03-08 22:17:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:22,501 INFO L93 Difference]: Finished difference Result 635 states and 876 transitions. [2025-03-08 22:17:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:17:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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 170 [2025-03-08 22:17:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:22,504 INFO L225 Difference]: With dead ends: 635 [2025-03-08 22:17:22,504 INFO L226 Difference]: Without dead ends: 635 [2025-03-08 22:17:22,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:17:22,504 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 12 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:22,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2153 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:17:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-08 22:17:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2025-03-08 22:17:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 626 states have (on average 1.3833865814696487) internal successors, (866), 627 states have internal predecessors, (866), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:17:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 872 transitions. [2025-03-08 22:17:22,516 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 872 transitions. Word has length 170 [2025-03-08 22:17:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:22,517 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 872 transitions. [2025-03-08 22:17:22,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-03-08 22:17:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 872 transitions. [2025-03-08 22:17:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 22:17:22,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:22,519 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, 1, 1, 1, 1] [2025-03-08 22:17:22,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:17:22,520 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:22,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1951838807, now seen corresponding path program 1 times [2025-03-08 22:17:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:22,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071375371] [2025-03-08 22:17:22,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:22,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 22:17:22,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 22:17:22,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:22,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:17:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071375371] [2025-03-08 22:17:22,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071375371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427876068] [2025-03-08 22:17:22,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:22,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:22,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:22,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:22,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:17:23,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 22:17:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 22:17:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:23,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:17:23,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:17:23,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427876068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:23,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 22:17:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173073462] [2025-03-08 22:17:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:23,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:17:23,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:23,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:17:23,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:17:23,131 INFO L87 Difference]: Start difference. First operand 632 states and 872 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:17:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:23,212 INFO L93 Difference]: Finished difference Result 635 states and 876 transitions. [2025-03-08 22:17:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:17:23,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 170 [2025-03-08 22:17:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:23,215 INFO L225 Difference]: With dead ends: 635 [2025-03-08 22:17:23,216 INFO L226 Difference]: Without dead ends: 635 [2025-03-08 22:17:23,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:17:23,216 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 0 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:23,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1388 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:17:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-08 22:17:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2025-03-08 22:17:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 628 states have (on average 1.3837579617834395) internal successors, (869), 630 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2025-03-08 22:17:23,226 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 170 [2025-03-08 22:17:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:23,226 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2025-03-08 22:17:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:17:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2025-03-08 22:17:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 22:17:23,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:23,229 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2025-03-08 22:17:23,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 22:17:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 22:17:23,430 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1840142821, now seen corresponding path program 1 times [2025-03-08 22:17:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:23,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103272014] [2025-03-08 22:17:23,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:23,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 22:17:23,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 22:17:23,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:23,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:17:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:23,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103272014] [2025-03-08 22:17:23,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103272014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:23,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325381105] [2025-03-08 22:17:23,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:23,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:23,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:23,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:23,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:17:23,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 22:17:24,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 22:17:24,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:24,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:24,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:17:24,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:17:28,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:28,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325381105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:28,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:28,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-08 22:17:28,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491351925] [2025-03-08 22:17:28,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:28,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:17:28,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:28,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:17:28,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:28,933 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-03-08 22:17:33,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:17:34,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:17:36,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:17:41,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:17:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:41,469 INFO L93 Difference]: Finished difference Result 642 states and 885 transitions. [2025-03-08 22:17:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:17:41,470 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), 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 172 [2025-03-08 22:17:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:41,472 INFO L225 Difference]: With dead ends: 642 [2025-03-08 22:17:41,472 INFO L226 Difference]: Without dead ends: 642 [2025-03-08 22:17:41,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:41,473 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 12 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:41,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2159 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 923 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2025-03-08 22:17:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-08 22:17:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 635. [2025-03-08 22:17:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 628 states have (on average 1.3837579617834395) internal successors, (869), 630 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2025-03-08 22:17:41,482 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 172 [2025-03-08 22:17:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:41,482 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2025-03-08 22:17:41,482 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), 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-03-08 22:17:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2025-03-08 22:17:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 22:17:41,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:41,484 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2025-03-08 22:17:41,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 22:17:41,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:41,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:41,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash -9774765, now seen corresponding path program 1 times [2025-03-08 22:17:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:41,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739129091] [2025-03-08 22:17:41,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:41,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 22:17:41,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 22:17:41,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:41,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:17:42,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:42,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739129091] [2025-03-08 22:17:42,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739129091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:42,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:42,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:17:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409185182] [2025-03-08 22:17:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:42,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:17:42,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:42,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:17:42,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:17:42,024 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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-03-08 22:17:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:42,621 INFO L93 Difference]: Finished difference Result 648 states and 892 transitions. [2025-03-08 22:17:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:17:42,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 173 [2025-03-08 22:17:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:42,624 INFO L225 Difference]: With dead ends: 648 [2025-03-08 22:17:42,624 INFO L226 Difference]: Without dead ends: 648 [2025-03-08 22:17:42,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:17:42,624 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 20 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:42,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2944 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:17:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-08 22:17:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 642. [2025-03-08 22:17:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 635 states have (on average 1.3826771653543306) internal successors, (878), 637 states have internal predecessors, (878), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 885 transitions. [2025-03-08 22:17:42,633 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 885 transitions. Word has length 173 [2025-03-08 22:17:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:42,633 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 885 transitions. [2025-03-08 22:17:42,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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-03-08 22:17:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 885 transitions. [2025-03-08 22:17:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 22:17:42,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:42,635 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2025-03-08 22:17:42,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:17:42,635 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:42,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1324870437, now seen corresponding path program 1 times [2025-03-08 22:17:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:42,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458268563] [2025-03-08 22:17:42,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:42,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 22:17:42,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 22:17:42,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:42,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:17:42,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458268563] [2025-03-08 22:17:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458268563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145853863] [2025-03-08 22:17:42,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:42,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:42,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:42,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:42,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:17:43,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 22:17:43,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 22:17:43,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:43,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:43,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:17:43,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:17:43,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145853863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:43,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:43,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-03-08 22:17:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737127684] [2025-03-08 22:17:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:17:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:43,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:17:43,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:17:43,396 INFO L87 Difference]: Start difference. First operand 642 states and 885 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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-03-08 22:17:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:43,967 INFO L93 Difference]: Finished difference Result 659 states and 906 transitions. [2025-03-08 22:17:43,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:17:43,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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 173 [2025-03-08 22:17:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:43,969 INFO L225 Difference]: With dead ends: 659 [2025-03-08 22:17:43,969 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 22:17:43,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:17:43,973 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 40 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:43,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2278 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:17:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 22:17:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 647. [2025-03-08 22:17:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 640 states have (on average 1.38125) internal successors, (884), 642 states have internal predecessors, (884), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 891 transitions. [2025-03-08 22:17:43,988 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 891 transitions. Word has length 173 [2025-03-08 22:17:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:43,988 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 891 transitions. [2025-03-08 22:17:43,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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-03-08 22:17:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 891 transitions. [2025-03-08 22:17:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 22:17:43,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:43,990 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:44,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:17:44,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:44,191 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1492338956, now seen corresponding path program 1 times [2025-03-08 22:17:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830277469] [2025-03-08 22:17:44,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:44,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 22:17:44,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 22:17:44,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:44,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:17:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830277469] [2025-03-08 22:17:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830277469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:17:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89253079] [2025-03-08 22:17:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:44,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:17:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:44,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:17:44,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:44,561 INFO L87 Difference]: Start difference. First operand 647 states and 891 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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-03-08 22:17:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:45,228 INFO L93 Difference]: Finished difference Result 656 states and 903 transitions. [2025-03-08 22:17:45,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:17:45,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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 174 [2025-03-08 22:17:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:45,230 INFO L225 Difference]: With dead ends: 656 [2025-03-08 22:17:45,230 INFO L226 Difference]: Without dead ends: 656 [2025-03-08 22:17:45,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:17:45,231 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 26 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:45,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2896 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:17:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-08 22:17:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 650. [2025-03-08 22:17:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 643 states have (on average 1.3794712286158632) internal successors, (887), 645 states have internal predecessors, (887), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 894 transitions. [2025-03-08 22:17:45,241 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 894 transitions. Word has length 174 [2025-03-08 22:17:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:45,242 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 894 transitions. [2025-03-08 22:17:45,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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-03-08 22:17:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 894 transitions. [2025-03-08 22:17:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 22:17:45,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:45,244 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:45,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:17:45,245 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:45,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1226956642, now seen corresponding path program 1 times [2025-03-08 22:17:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996210987] [2025-03-08 22:17:45,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:45,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 22:17:45,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 22:17:45,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:45,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:17:45,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:45,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996210987] [2025-03-08 22:17:45,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996210987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:45,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812826402] [2025-03-08 22:17:45,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:45,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:45,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:45,560 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:45,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:17:45,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 22:17:46,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 22:17:46,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:46,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:46,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:17:46,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 22:17:46,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:46,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812826402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:46,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:46,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-08 22:17:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344938198] [2025-03-08 22:17:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:46,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:17:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:46,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:17:46,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:46,254 INFO L87 Difference]: Start difference. First operand 650 states and 894 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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-03-08 22:17:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:46,767 INFO L93 Difference]: Finished difference Result 664 states and 912 transitions. [2025-03-08 22:17:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:17:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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 174 [2025-03-08 22:17:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:46,770 INFO L225 Difference]: With dead ends: 664 [2025-03-08 22:17:46,770 INFO L226 Difference]: Without dead ends: 664 [2025-03-08 22:17:46,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:46,771 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 12 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:46,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2159 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:17:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-08 22:17:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 650. [2025-03-08 22:17:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 643 states have (on average 1.3794712286158632) internal successors, (887), 645 states have internal predecessors, (887), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 894 transitions. [2025-03-08 22:17:46,780 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 894 transitions. Word has length 174 [2025-03-08 22:17:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:46,780 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 894 transitions. [2025-03-08 22:17:46,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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-03-08 22:17:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 894 transitions. [2025-03-08 22:17:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 22:17:46,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:46,782 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:46,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:17:46,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:46,986 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash 116337206, now seen corresponding path program 1 times [2025-03-08 22:17:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:46,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322141667] [2025-03-08 22:17:46,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:47,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 22:17:47,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 22:17:47,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:47,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 22:17:47,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322141667] [2025-03-08 22:17:47,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322141667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:47,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:47,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:17:47,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581767396] [2025-03-08 22:17:47,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:47,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:17:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:47,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:17:47,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:17:47,341 INFO L87 Difference]: Start difference. First operand 650 states and 894 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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-03-08 22:17:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:47,947 INFO L93 Difference]: Finished difference Result 676 states and 926 transitions. [2025-03-08 22:17:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:17:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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 175 [2025-03-08 22:17:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:47,949 INFO L225 Difference]: With dead ends: 676 [2025-03-08 22:17:47,949 INFO L226 Difference]: Without dead ends: 676 [2025-03-08 22:17:47,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:17:47,952 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 20 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:47,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2944 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:17:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-08 22:17:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 664. [2025-03-08 22:17:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 657 states have (on average 1.3774733637747336) internal successors, (905), 659 states have internal predecessors, (905), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 912 transitions. [2025-03-08 22:17:47,962 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 912 transitions. Word has length 175 [2025-03-08 22:17:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:47,962 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 912 transitions. [2025-03-08 22:17:47,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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-03-08 22:17:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 912 transitions. [2025-03-08 22:17:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 22:17:47,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:47,964 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:47,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:17:47,964 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:47,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash 511903797, now seen corresponding path program 1 times [2025-03-08 22:17:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:47,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246320628] [2025-03-08 22:17:47,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:47,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:47,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 22:17:48,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 22:17:48,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:48,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:17:48,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:48,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246320628] [2025-03-08 22:17:48,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246320628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:48,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871439006] [2025-03-08 22:17:48,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:48,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:48,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:48,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:48,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:17:48,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 22:17:48,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 22:17:48,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:48,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:48,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:17:48,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 22:17:48,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:48,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871439006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:48,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-08 22:17:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381097254] [2025-03-08 22:17:48,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:48,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:17:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:48,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:17:48,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:48,880 INFO L87 Difference]: Start difference. First operand 664 states and 912 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-03-08 22:17:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:49,302 INFO L93 Difference]: Finished difference Result 688 states and 948 transitions. [2025-03-08 22:17:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:17:49,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 175 [2025-03-08 22:17:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:49,304 INFO L225 Difference]: With dead ends: 688 [2025-03-08 22:17:49,304 INFO L226 Difference]: Without dead ends: 688 [2025-03-08 22:17:49,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:49,305 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 17 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:49,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2182 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:17:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-08 22:17:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 678. [2025-03-08 22:17:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 671 states have (on average 1.3785394932935917) internal successors, (925), 673 states have internal predecessors, (925), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 932 transitions. [2025-03-08 22:17:49,313 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 932 transitions. Word has length 175 [2025-03-08 22:17:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:49,313 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 932 transitions. [2025-03-08 22:17:49,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-03-08 22:17:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 932 transitions. [2025-03-08 22:17:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 22:17:49,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:49,314 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:49,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:17:49,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 22:17:49,515 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:49,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash -726297414, now seen corresponding path program 1 times [2025-03-08 22:17:49,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:49,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437828265] [2025-03-08 22:17:49,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:49,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 22:17:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 22:17:49,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:49,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 22:17:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437828265] [2025-03-08 22:17:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437828265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:49,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:49,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:17:49,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994862906] [2025-03-08 22:17:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:49,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:17:49,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:49,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:17:49,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:49,968 INFO L87 Difference]: Start difference. First operand 678 states and 932 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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-03-08 22:17:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:50,519 INFO L93 Difference]: Finished difference Result 696 states and 956 transitions. [2025-03-08 22:17:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:17:50,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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 176 [2025-03-08 22:17:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:50,521 INFO L225 Difference]: With dead ends: 696 [2025-03-08 22:17:50,521 INFO L226 Difference]: Without dead ends: 696 [2025-03-08 22:17:50,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:17:50,522 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 26 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:50,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2583 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:17:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-08 22:17:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 684. [2025-03-08 22:17:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 677 states have (on average 1.3751846381093058) internal successors, (931), 679 states have internal predecessors, (931), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 938 transitions. [2025-03-08 22:17:50,531 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 938 transitions. Word has length 176 [2025-03-08 22:17:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:50,531 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 938 transitions. [2025-03-08 22:17:50,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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-03-08 22:17:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 938 transitions. [2025-03-08 22:17:50,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 22:17:50,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:50,533 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:50,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:17:50,533 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:50,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1472256641, now seen corresponding path program 1 times [2025-03-08 22:17:50,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:50,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008800099] [2025-03-08 22:17:50,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:50,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:50,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 22:17:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 22:17:50,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:50,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:17:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008800099] [2025-03-08 22:17:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008800099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475222429] [2025-03-08 22:17:50,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:50,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:50,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:50,802 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:50,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:17:51,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 22:17:51,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 22:17:51,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:51,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:51,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:17:51,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:17:51,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475222429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-03-08 22:17:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499777648] [2025-03-08 22:17:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:51,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:17:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:51,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:17:51,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:17:51,476 INFO L87 Difference]: Start difference. First operand 684 states and 938 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-03-08 22:17:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:52,671 INFO L93 Difference]: Finished difference Result 696 states and 954 transitions. [2025-03-08 22:17:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:17:52,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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 176 [2025-03-08 22:17:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:52,674 INFO L225 Difference]: With dead ends: 696 [2025-03-08 22:17:52,674 INFO L226 Difference]: Without dead ends: 696 [2025-03-08 22:17:52,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:17:52,675 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 17 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:52,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3243 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 22:17:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-08 22:17:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 691. [2025-03-08 22:17:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 684 states have (on average 1.3742690058479532) internal successors, (940), 686 states have internal predecessors, (940), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 947 transitions. [2025-03-08 22:17:52,684 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 947 transitions. Word has length 176 [2025-03-08 22:17:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:52,684 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 947 transitions. [2025-03-08 22:17:52,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-03-08 22:17:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 947 transitions. [2025-03-08 22:17:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 22:17:52,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:52,686 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:52,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 22:17:52,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 22:17:52,887 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1954739935, now seen corresponding path program 1 times [2025-03-08 22:17:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:52,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233940424] [2025-03-08 22:17:52,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:52,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 22:17:53,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 22:17:53,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:53,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:17:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233940424] [2025-03-08 22:17:53,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233940424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482735836] [2025-03-08 22:17:53,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:53,224 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:53,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:17:53,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 22:17:53,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 22:17:53,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:53,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:53,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:17:53,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:17:53,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:17:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482735836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:17:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-08 22:17:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153856022] [2025-03-08 22:17:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:17:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:53,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:17:53,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:17:53,733 INFO L87 Difference]: Start difference. First operand 691 states and 947 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-03-08 22:17:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:54,135 INFO L93 Difference]: Finished difference Result 707 states and 969 transitions. [2025-03-08 22:17:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:17:54,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 176 [2025-03-08 22:17:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:54,137 INFO L225 Difference]: With dead ends: 707 [2025-03-08 22:17:54,137 INFO L226 Difference]: Without dead ends: 707 [2025-03-08 22:17:54,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:17:54,138 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 39 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:54,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2231 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:17:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-08 22:17:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 698. [2025-03-08 22:17:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 691 states have (on average 1.3748191027496381) internal successors, (950), 693 states have internal predecessors, (950), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 957 transitions. [2025-03-08 22:17:54,144 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 957 transitions. Word has length 176 [2025-03-08 22:17:54,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:54,144 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 957 transitions. [2025-03-08 22:17:54,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-03-08 22:17:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 957 transitions. [2025-03-08 22:17:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 22:17:54,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:54,145 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:54,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 22:17:54,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 22:17:54,346 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:54,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:54,346 INFO L85 PathProgramCache]: Analyzing trace with hash -792307173, now seen corresponding path program 1 times [2025-03-08 22:17:54,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:54,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183642936] [2025-03-08 22:17:54,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:54,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 22:17:54,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 22:17:54,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:54,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:17:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:54,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183642936] [2025-03-08 22:17:54,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183642936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:54,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064032277] [2025-03-08 22:17:54,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:54,636 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:54,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 22:17:55,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 22:17:55,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 22:17:55,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:55,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:55,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:17:55,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:55,158 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-03-08 22:17:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:17:55,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:17:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:17:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064032277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:17:55,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:17:55,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 12 [2025-03-08 22:17:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251007095] [2025-03-08 22:17:55,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:17:55,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:17:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:55,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:17:55,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:17:55,332 INFO L87 Difference]: Start difference. First operand 698 states and 957 transitions. Second operand has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:55,677 INFO L93 Difference]: Finished difference Result 963 states and 1325 transitions. [2025-03-08 22:17:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:17:55,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) Word has length 176 [2025-03-08 22:17:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:55,680 INFO L225 Difference]: With dead ends: 963 [2025-03-08 22:17:55,680 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 22:17:55,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:17:55,680 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 868 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:55,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 2396 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:17:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 22:17:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 726. [2025-03-08 22:17:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 716 states have (on average 1.3784916201117319) internal successors, (987), 719 states have internal predecessors, (987), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 22:17:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 996 transitions. [2025-03-08 22:17:55,690 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 996 transitions. Word has length 176 [2025-03-08 22:17:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:55,690 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 996 transitions. [2025-03-08 22:17:55,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:17:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 996 transitions. [2025-03-08 22:17:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 22:17:55,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:55,693 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:55,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 22:17:55,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 22:17:55,894 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:55,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash -794500969, now seen corresponding path program 2 times [2025-03-08 22:17:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972490299] [2025-03-08 22:17:55,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:17:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:55,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-08 22:17:55,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 180 statements. [2025-03-08 22:17:55,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:17:55,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 22:17:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:56,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972490299] [2025-03-08 22:17:56,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972490299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:56,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:56,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:17:56,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434967799] [2025-03-08 22:17:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:56,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:17:56,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:56,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:17:56,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:17:56,041 INFO L87 Difference]: Start difference. First operand 726 states and 996 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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-03-08 22:17:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:56,444 INFO L93 Difference]: Finished difference Result 729 states and 999 transitions. [2025-03-08 22:17:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:17:56,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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 180 [2025-03-08 22:17:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:56,447 INFO L225 Difference]: With dead ends: 729 [2025-03-08 22:17:56,447 INFO L226 Difference]: Without dead ends: 729 [2025-03-08 22:17:56,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:17:56,448 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 8 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:56,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1838 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:17:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-08 22:17:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2025-03-08 22:17:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 719 states have (on average 1.376912378303199) internal successors, (990), 722 states have internal predecessors, (990), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 22:17:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 999 transitions. [2025-03-08 22:17:56,456 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 999 transitions. Word has length 180 [2025-03-08 22:17:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:56,456 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 999 transitions. [2025-03-08 22:17:56,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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-03-08 22:17:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 999 transitions. [2025-03-08 22:17:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 22:17:56,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:56,458 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:56,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:17:56,458 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:56,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1187594950, now seen corresponding path program 1 times [2025-03-08 22:17:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:56,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161913599] [2025-03-08 22:17:56,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:56,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 22:17:56,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 22:17:56,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:56,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:17:56,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161913599] [2025-03-08 22:17:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161913599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:17:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432522571] [2025-03-08 22:17:56,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:17:56,916 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:17:56,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:17:57,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 22:17:57,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 22:17:57,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:57,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:57,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:17:57,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:17:57,400 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-03-08 22:17:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:17:57,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:17:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:17:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432522571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:17:58,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:17:58,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 9] total 26 [2025-03-08 22:17:58,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080365624] [2025-03-08 22:17:58,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:17:58,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:17:58,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:58,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:17:58,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:17:58,129 INFO L87 Difference]: Start difference. First operand 729 states and 999 transitions. Second operand has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 22:17:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:59,231 INFO L93 Difference]: Finished difference Result 909 states and 1242 transitions. [2025-03-08 22:17:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 22:17:59,232 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 181 [2025-03-08 22:17:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:59,234 INFO L225 Difference]: With dead ends: 909 [2025-03-08 22:17:59,234 INFO L226 Difference]: Without dead ends: 905 [2025-03-08 22:17:59,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 22:17:59,235 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1074 mSDsluCounter, 6216 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 6696 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:59,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 6696 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 22:17:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-08 22:17:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 652. [2025-03-08 22:17:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 642 states have (on average 1.3644859813084111) internal successors, (876), 645 states have internal predecessors, (876), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 22:17:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 885 transitions. [2025-03-08 22:17:59,248 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 885 transitions. Word has length 181 [2025-03-08 22:17:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:59,248 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 885 transitions. [2025-03-08 22:17:59,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 22:17:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 885 transitions. [2025-03-08 22:17:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 22:17:59,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:59,249 INFO L218 NwaCegarLoop]: trace histogram [13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:59,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 22:17:59,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:59,450 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:59,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1511739094, now seen corresponding path program 2 times [2025-03-08 22:17:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800802100] [2025-03-08 22:17:59,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:17:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:59,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-08 22:17:59,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 81 of 188 statements. [2025-03-08 22:17:59,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:17:59,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:17:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 22:17:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:17:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800802100] [2025-03-08 22:17:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800802100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:17:59,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:17:59,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 22:17:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338556318] [2025-03-08 22:17:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:17:59,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:17:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:17:59,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:17:59,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:17:59,730 INFO L87 Difference]: Start difference. First operand 652 states and 885 transitions. Second operand has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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-03-08 22:18:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:18:01,408 INFO L93 Difference]: Finished difference Result 709 states and 969 transitions. [2025-03-08 22:18:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:18:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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 188 [2025-03-08 22:18:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:18:01,410 INFO L225 Difference]: With dead ends: 709 [2025-03-08 22:18:01,410 INFO L226 Difference]: Without dead ends: 709 [2025-03-08 22:18:01,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:18:01,411 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 89 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:18:01,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 3588 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 22:18:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-08 22:18:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 656. [2025-03-08 22:18:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 646 states have (on average 1.3637770897832817) internal successors, (881), 649 states have internal predecessors, (881), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 22:18:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 890 transitions. [2025-03-08 22:18:01,417 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 890 transitions. Word has length 188 [2025-03-08 22:18:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:18:01,418 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 890 transitions. [2025-03-08 22:18:01,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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-03-08 22:18:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 890 transitions. [2025-03-08 22:18:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 22:18:01,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:18:01,419 INFO L218 NwaCegarLoop]: trace histogram [13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:18:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:18:01,419 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:18:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:18:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -89443288, now seen corresponding path program 1 times [2025-03-08 22:18:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:18:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130086739] [2025-03-08 22:18:01,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:18:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:18:01,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 22:18:01,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 22:18:01,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:18:01,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:18:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 22:18:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:18:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130086739] [2025-03-08 22:18:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130086739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:18:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175120418] [2025-03-08 22:18:01,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:18:01,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:18:01,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:18:01,923 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:18:01,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 22:18:02,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 22:18:02,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 22:18:02,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:18:02,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:18:02,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-03-08 22:18:02,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:18:02,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:18:03,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:18:03,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:18:03,157 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-08 22:18:03,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-08 22:18:03,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-08 22:18:03,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:18:03,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:18:03,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 22:18:03,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11