./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_SAX_test9-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 e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:10:53,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:10:53,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:10:53,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:10:53,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:10:53,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:10:53,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:10:53,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:10:53,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:10:53,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:10:53,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:10:53,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:10:53,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:10:53,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:10:53,363 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:10:53,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:10:53,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:10:53,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:10:53,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:10:53,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:10:53,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:10:53,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:10:53,365 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:10:53,365 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:10:53,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:10:53,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:10:53,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:10:53,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:10:53,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:10:53,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:10:53,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:10:53,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:10:53,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:10:53,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:10:53,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:10:53,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:10:53,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:10:53,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:10:53,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:10:53,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:10:53,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:10:53,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:10:53,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:10:53,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:10:53,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:10:53,369 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 [2024-11-17 00:10:53,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:10:53,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:10:53,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:10:53,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:10:53,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:10:53,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2024-11-17 00:10:54,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:10:55,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:10:55,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2024-11-17 00:10:55,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48729386a/59ee44ee90674641b8d380f8c7a32ab1/FLAG617b46924 [2024-11-17 00:10:55,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48729386a/59ee44ee90674641b8d380f8c7a32ab1 [2024-11-17 00:10:55,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:10:55,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:10:55,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:10:55,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:10:55,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:10:55,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:10:55" (1/1) ... [2024-11-17 00:10:55,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214f3933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:55, skipping insertion in model container [2024-11-17 00:10:55,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:10:55" (1/1) ... [2024-11-17 00:10:55,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:10:55,833 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,851 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,853 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,855 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,859 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,876 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,876 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,877 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,878 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:55,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:10:55,889 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:10:55,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:10:56,014 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:10:56,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56 WrapperNode [2024-11-17 00:10:56,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:10:56,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:10:56,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:10:56,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:10:56,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,138 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3252 [2024-11-17 00:10:56,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:10:56,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:10:56,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:10:56,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:10:56,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,243 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 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]. [2024-11-17 00:10:56,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,285 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:10:56,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:10:56,330 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:10:56,330 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:10:56,331 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (1/1) ... [2024-11-17 00:10:56,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:10:56,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:10:56,445 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) [2024-11-17 00:10:56,452 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 [2024-11-17 00:10:56,511 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:10:56,512 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:10:56,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:10:56,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:10:56,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:10:56,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:10:56,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:10:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:10:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:10:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:10:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:10:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:10:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:10:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:10:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:10:56,515 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:10:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:10:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:10:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:10:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:10:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:10:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:10:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:10:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:10:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:10:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:10:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:10:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:10:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:10:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:10:56,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:10:56,675 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:10:56,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:10:58,630 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 00:10:58,843 INFO L? ?]: Removed 799 outVars from TransFormulas that were not future-live. [2024-11-17 00:10:58,843 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:10:58,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:10:58,902 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 00:10:58,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:10:58 BoogieIcfgContainer [2024-11-17 00:10:58,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:10:58,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:10:58,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:10:58,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:10:58,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:10:55" (1/3) ... [2024-11-17 00:10:58,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3898e93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:10:58, skipping insertion in model container [2024-11-17 00:10:58,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:56" (2/3) ... [2024-11-17 00:10:58,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3898e93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:10:58, skipping insertion in model container [2024-11-17 00:10:58,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:10:58" (3/3) ... [2024-11-17 00:10:58,911 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-1.i [2024-11-17 00:10:58,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:10:58,924 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:10:58,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:10:58,986 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;@10998c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:10:58,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:10:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 1381 states, 870 states have (on average 1.8333333333333333) internal successors, (1595), 1374 states have internal predecessors, (1595), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-17 00:10:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:10:58,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:58,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:58,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:59,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash 961734643, now seen corresponding path program 1 times [2024-11-17 00:10:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:10:59,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549628373] [2024-11-17 00:10:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:10:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:10:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549628373] [2024-11-17 00:10:59,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549628373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:59,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:10:59,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336651630] [2024-11-17 00:10:59,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:59,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:10:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:10:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:10:59,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:10:59,242 INFO L87 Difference]: Start difference. First operand has 1381 states, 870 states have (on average 1.8333333333333333) internal successors, (1595), 1374 states have internal predecessors, (1595), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2024-11-17 00:10:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:59,431 INFO L93 Difference]: Finished difference Result 1379 states and 2542 transitions. [2024-11-17 00:10:59,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:10:59,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-17 00:10:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:59,455 INFO L225 Difference]: With dead ends: 1379 [2024-11-17 00:10:59,456 INFO L226 Difference]: Without dead ends: 1376 [2024-11-17 00:10:59,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:10:59,460 INFO L432 NwaCegarLoop]: 2501 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:59,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2501 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:10:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-17 00:10:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-17 00:10:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 867 states have (on average 1.7658592848904267) internal successors, (1531), 1369 states have internal predecessors, (1531), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-17 00:10:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2539 transitions. [2024-11-17 00:10:59,857 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2539 transitions. Word has length 8 [2024-11-17 00:10:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:59,857 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2539 transitions. [2024-11-17 00:10:59,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2024-11-17 00:10:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2539 transitions. [2024-11-17 00:10:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:10:59,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:59,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:59,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:10:59,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:59,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash 806273931, now seen corresponding path program 1 times [2024-11-17 00:10:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:10:59,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641164483] [2024-11-17 00:10:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:10:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:59,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:10:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641164483] [2024-11-17 00:10:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641164483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:59,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:59,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:10:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939744339] [2024-11-17 00:10:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:59,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:10:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:10:59,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:10:59,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:10:59,995 INFO L87 Difference]: Start difference. First operand 1376 states and 2539 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-11-17 00:11:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:00,723 INFO L93 Difference]: Finished difference Result 2734 states and 5061 transitions. [2024-11-17 00:11:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:11:00,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-17 00:11:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:00,738 INFO L225 Difference]: With dead ends: 2734 [2024-11-17 00:11:00,738 INFO L226 Difference]: Without dead ends: 2734 [2024-11-17 00:11:00,739 INFO L431 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 [2024-11-17 00:11:00,740 INFO L432 NwaCegarLoop]: 2546 mSDtfsCounter, 1512 mSDsluCounter, 4517 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 7063 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:00,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2015 Valid, 7063 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:11:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2024-11-17 00:11:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 1378. [2024-11-17 00:11:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 869 states have (on average 1.76409666283084) internal successors, (1533), 1371 states have internal predecessors, (1533), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-17 00:11:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2541 transitions. [2024-11-17 00:11:00,957 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2541 transitions. Word has length 10 [2024-11-17 00:11:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:00,958 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 2541 transitions. [2024-11-17 00:11:00,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-11-17 00:11:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2541 transitions. [2024-11-17 00:11:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:11:00,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:00,961 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:11:00,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:11:00,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:00,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1829955088, now seen corresponding path program 1 times [2024-11-17 00:11:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:00,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787980580] [2024-11-17 00:11:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:11:01,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:11:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787980580] [2024-11-17 00:11:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787980580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:11:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:11:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:11:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815190083] [2024-11-17 00:11:01,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:11:01,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:11:01,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:11:01,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:11:01,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:11:01,262 INFO L87 Difference]: Start difference. First operand 1378 states and 2541 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-17 00:11:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:01,447 INFO L93 Difference]: Finished difference Result 1336 states and 2464 transitions. [2024-11-17 00:11:01,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:11:01,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2024-11-17 00:11:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:01,452 INFO L225 Difference]: With dead ends: 1336 [2024-11-17 00:11:01,453 INFO L226 Difference]: Without dead ends: 1336 [2024-11-17 00:11:01,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:11:01,454 INFO L432 NwaCegarLoop]: 2403 mSDtfsCounter, 33 mSDsluCounter, 4789 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 7192 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:01,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 7192 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:11:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-17 00:11:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2024-11-17 00:11:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 827 states have (on average 1.7605804111245467) internal successors, (1456), 1329 states have internal predecessors, (1456), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-17 00:11:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2464 transitions. [2024-11-17 00:11:01,541 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2464 transitions. Word has length 87 [2024-11-17 00:11:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:01,541 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 2464 transitions. [2024-11-17 00:11:01,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-17 00:11:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2464 transitions. [2024-11-17 00:11:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:11:01,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:01,544 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:11:01,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:11:01,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:01,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash -836942663, now seen corresponding path program 1 times [2024-11-17 00:11:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:01,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26197360] [2024-11-17 00:11:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:11:01,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:11:01,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26197360] [2024-11-17 00:11:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26197360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:11:01,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:11:01,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:11:01,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489404963] [2024-11-17 00:11:01,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:11:01,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:11:01,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:11:01,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:11:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:11:01,664 INFO L87 Difference]: Start difference. First operand 1336 states and 2464 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2024-11-17 00:11:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:01,802 INFO L93 Difference]: Finished difference Result 1336 states and 2461 transitions. [2024-11-17 00:11:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:11:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 87 [2024-11-17 00:11:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:01,808 INFO L225 Difference]: With dead ends: 1336 [2024-11-17 00:11:01,808 INFO L226 Difference]: Without dead ends: 1336 [2024-11-17 00:11:01,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:11:01,809 INFO L432 NwaCegarLoop]: 2418 mSDtfsCounter, 2 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4814 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:01,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4814 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:11:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-17 00:11:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2024-11-17 00:11:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 827 states have (on average 1.7569528415961306) internal successors, (1453), 1329 states have internal predecessors, (1453), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-17 00:11:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2461 transitions. [2024-11-17 00:11:01,975 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2461 transitions. Word has length 87 [2024-11-17 00:11:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:01,975 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 2461 transitions. [2024-11-17 00:11:01,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2024-11-17 00:11:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2461 transitions. [2024-11-17 00:11:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:11:01,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:01,977 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:11:01,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:11:01,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:01,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1853823414, now seen corresponding path program 1 times [2024-11-17 00:11:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652722447] [2024-11-17 00:11:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:11:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:11:02,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652722447] [2024-11-17 00:11:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652722447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:11:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:11:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:11:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324579571] [2024-11-17 00:11:02,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:11:02,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:11:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:11:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:11:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:11:02,162 INFO L87 Difference]: Start difference. First operand 1336 states and 2461 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2024-11-17 00:11:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:02,409 INFO L93 Difference]: Finished difference Result 2566 states and 4786 transitions. [2024-11-17 00:11:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:11:02,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 87 [2024-11-17 00:11:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:02,421 INFO L225 Difference]: With dead ends: 2566 [2024-11-17 00:11:02,421 INFO L226 Difference]: Without dead ends: 2566 [2024-11-17 00:11:02,422 INFO L431 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 [2024-11-17 00:11:02,422 INFO L432 NwaCegarLoop]: 2614 mSDtfsCounter, 1265 mSDsluCounter, 2410 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 5024 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:02,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 5024 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:11:02,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2024-11-17 00:11:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2561. [2024-11-17 00:11:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 1552 states have (on average 1.7873711340206186) internal successors, (2774), 2554 states have internal predecessors, (2774), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-17 00:11:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4782 transitions. [2024-11-17 00:11:02,618 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4782 transitions. Word has length 87 [2024-11-17 00:11:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:02,619 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 4782 transitions. [2024-11-17 00:11:02,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2024-11-17 00:11:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4782 transitions. [2024-11-17 00:11:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 00:11:02,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:02,620 INFO L215 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] [2024-11-17 00:11:02,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:11:02,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1075910182, now seen corresponding path program 1 times [2024-11-17 00:11:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186869483] [2024-11-17 00:11:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:11:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:11:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:11:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:11:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186869483] [2024-11-17 00:11:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186869483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:11:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:11:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:11:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74677876] [2024-11-17 00:11:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:11:02,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:11:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:11:02,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:11:02,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:11:02,967 INFO L87 Difference]: Start difference. First operand 2561 states and 4782 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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) [2024-11-17 00:11:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:06,432 INFO L93 Difference]: Finished difference Result 4794 states and 9118 transitions. [2024-11-17 00:11:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:11:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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 102 [2024-11-17 00:11:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:06,450 INFO L225 Difference]: With dead ends: 4794 [2024-11-17 00:11:06,450 INFO L226 Difference]: Without dead ends: 4794 [2024-11-17 00:11:06,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:11:06,451 INFO L432 NwaCegarLoop]: 2645 mSDtfsCounter, 1435 mSDsluCounter, 4693 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 7338 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:06,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 7338 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-17 00:11:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2024-11-17 00:11:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 2563. [2024-11-17 00:11:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 1554 states have (on average 1.7863577863577864) internal successors, (2776), 2556 states have internal predecessors, (2776), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-17 00:11:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4784 transitions. [2024-11-17 00:11:06,761 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4784 transitions. Word has length 102 [2024-11-17 00:11:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:06,761 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 4784 transitions. [2024-11-17 00:11:06,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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) [2024-11-17 00:11:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4784 transitions. [2024-11-17 00:11:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 00:11:06,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:06,763 INFO L215 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] [2024-11-17 00:11:06,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:11:06,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:06,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash 283521527, now seen corresponding path program 1 times [2024-11-17 00:11:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502137592] [2024-11-17 00:11:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:11:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:06,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:11:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:11:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:11:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502137592] [2024-11-17 00:11:06,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502137592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:11:06,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:11:06,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:11:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014879899] [2024-11-17 00:11:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:11:06,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:11:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:11:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:11:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:11:06,979 INFO L87 Difference]: Start difference. First operand 2563 states and 4784 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:11:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:08,825 INFO L93 Difference]: Finished difference Result 2482 states and 4636 transitions. [2024-11-17 00:11:08,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:11:08,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 159 [2024-11-17 00:11:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:08,834 INFO L225 Difference]: With dead ends: 2482 [2024-11-17 00:11:08,834 INFO L226 Difference]: Without dead ends: 2482 [2024-11-17 00:11:08,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:11:08,835 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 40 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 7217 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:08,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 7217 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 00:11:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2024-11-17 00:11:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2479. [2024-11-17 00:11:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 1470 states have (on average 1.7836734693877552) internal successors, (2622), 2472 states have internal predecessors, (2622), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-17 00:11:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 4630 transitions. [2024-11-17 00:11:09,204 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 4630 transitions. Word has length 159 [2024-11-17 00:11:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:09,205 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 4630 transitions. [2024-11-17 00:11:09,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:11:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 4630 transitions. [2024-11-17 00:11:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 00:11:09,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:09,206 INFO L215 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] [2024-11-17 00:11:09,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:11:09,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash 11700721, now seen corresponding path program 1 times [2024-11-17 00:11:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:09,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383998063] [2024-11-17 00:11:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:09,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:09,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:11:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:11:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:11:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:11:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383998063] [2024-11-17 00:11:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383998063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:11:09,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:11:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:11:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639691001] [2024-11-17 00:11:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:11:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:11:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:11:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:11:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:11:09,549 INFO L87 Difference]: Start difference. First operand 2479 states and 4630 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:11:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:12,830 INFO L93 Difference]: Finished difference Result 2568 states and 4747 transitions. [2024-11-17 00:11:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:11:12,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 159 [2024-11-17 00:11:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:12,839 INFO L225 Difference]: With dead ends: 2568 [2024-11-17 00:11:12,839 INFO L226 Difference]: Without dead ends: 2568 [2024-11-17 00:11:12,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:11:12,840 INFO L432 NwaCegarLoop]: 2511 mSDtfsCounter, 4975 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 2432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5477 SdHoareTripleChecker+Valid, 6425 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2432 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:12,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5477 Valid, 6425 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2432 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-17 00:11:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2024-11-17 00:11:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1384. [2024-11-17 00:11:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 875 states have (on average 1.705142857142857) internal successors, (1492), 1377 states have internal predecessors, (1492), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-17 00:11:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2500 transitions. [2024-11-17 00:11:13,000 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2500 transitions. Word has length 159 [2024-11-17 00:11:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:13,000 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2500 transitions. [2024-11-17 00:11:13,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:11:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2500 transitions. [2024-11-17 00:11:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-17 00:11:13,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:13,002 INFO L215 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] [2024-11-17 00:11:13,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:11:13,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:13,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1895539682, now seen corresponding path program 1 times [2024-11-17 00:11:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:13,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160409332] [2024-11-17 00:11:13,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:13,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:11:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:13,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:11:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:11:13,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:11:13,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160409332] [2024-11-17 00:11:13,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160409332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:11:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851190715] [2024-11-17 00:11:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:13,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:11:13,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:11:13,640 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) [2024-11-17 00:11:13,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:11:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:13,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:11:13,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:11:13,944 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 [2024-11-17 00:11:14,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:11:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:11:14,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:11:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:11:14,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851190715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:11:14,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:11:14,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 13 [2024-11-17 00:11:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980143807] [2024-11-17 00:11:14,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:11:14,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:11:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:11:14,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:11:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:11:14,326 INFO L87 Difference]: Start difference. First operand 1384 states and 2500 transitions. Second operand has 13 states, 13 states have (on average 25.692307692307693) internal successors, (334), 12 states have internal predecessors, (334), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:11:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:21,204 INFO L93 Difference]: Finished difference Result 4129 states and 7488 transitions. [2024-11-17 00:11:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:11:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.692307692307693) internal successors, (334), 12 states have internal predecessors, (334), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 170 [2024-11-17 00:11:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:21,225 INFO L225 Difference]: With dead ends: 4129 [2024-11-17 00:11:21,228 INFO L226 Difference]: Without dead ends: 4129 [2024-11-17 00:11:21,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 336 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:11:21,229 INFO L432 NwaCegarLoop]: 1995 mSDtfsCounter, 6850 mSDsluCounter, 12511 mSDsCounter, 0 mSdLazyCounter, 7275 mSolverCounterSat, 3524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7858 SdHoareTripleChecker+Valid, 14506 SdHoareTripleChecker+Invalid, 10799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3524 IncrementalHoareTripleChecker+Valid, 7275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:21,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7858 Valid, 14506 Invalid, 10799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3524 Valid, 7275 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-17 00:11:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2024-11-17 00:11:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 1736. [2024-11-17 00:11:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1223 states have (on average 1.5928045789043337) internal successors, (1948), 1725 states have internal predecessors, (1948), 508 states have call successors, (508), 4 states have call predecessors, (508), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2024-11-17 00:11:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2962 transitions. [2024-11-17 00:11:21,832 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2962 transitions. Word has length 170 [2024-11-17 00:11:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2962 transitions. [2024-11-17 00:11:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.692307692307693) internal successors, (334), 12 states have internal predecessors, (334), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:11:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2962 transitions. [2024-11-17 00:11:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-17 00:11:21,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:21,841 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:11:21,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:11:22,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:11:22,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:22,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1967710827, now seen corresponding path program 1 times [2024-11-17 00:11:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:22,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961654593] [2024-11-17 00:11:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:25,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:11:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:25,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:11:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:11:25,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:11:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961654593] [2024-11-17 00:11:25,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961654593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:11:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999202215] [2024-11-17 00:11:25,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:25,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:11:25,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:11:25,576 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) [2024-11-17 00:11:25,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:11:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:11:26,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 1909 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:11:26,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:11:26,098 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 [2024-11-17 00:11:26,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:11:26,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:11:26,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:11:26,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:11:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:11:26,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:11:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:11:27,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999202215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:11:27,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:11:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2024-11-17 00:11:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392512463] [2024-11-17 00:11:27,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:11:27,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 00:11:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:11:27,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 00:11:27,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:11:27,214 INFO L87 Difference]: Start difference. First operand 1736 states and 2962 transitions. Second operand has 24 states, 24 states have (on average 42.791666666666664) internal successors, (1027), 23 states have internal predecessors, (1027), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:11:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:50,935 INFO L93 Difference]: Finished difference Result 9481 states and 17286 transitions. [2024-11-17 00:11:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 00:11:50,938 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 42.791666666666664) internal successors, (1027), 23 states have internal predecessors, (1027), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 401 [2024-11-17 00:11:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:50,967 INFO L225 Difference]: With dead ends: 9481 [2024-11-17 00:11:50,968 INFO L226 Difference]: Without dead ends: 9481 [2024-11-17 00:11:50,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 794 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 00:11:50,969 INFO L432 NwaCegarLoop]: 6782 mSDtfsCounter, 18831 mSDsluCounter, 44076 mSDsCounter, 0 mSdLazyCounter, 23650 mSolverCounterSat, 6559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21851 SdHoareTripleChecker+Valid, 50858 SdHoareTripleChecker+Invalid, 30209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6559 IncrementalHoareTripleChecker+Valid, 23650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:50,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21851 Valid, 50858 Invalid, 30209 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6559 Valid, 23650 Invalid, 0 Unknown, 0 Unchecked, 22.6s Time] [2024-11-17 00:11:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9481 states. [2024-11-17 00:11:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9481 to 2612. [2024-11-17 00:11:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2093 states have (on average 1.475394171046345) internal successors, (3088), 2595 states have internal predecessors, (3088), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-17 00:11:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 4114 transitions. [2024-11-17 00:11:51,562 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 4114 transitions. Word has length 401 [2024-11-17 00:11:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:51,562 INFO L471 AbstractCegarLoop]: Abstraction has 2612 states and 4114 transitions. [2024-11-17 00:11:51,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 42.791666666666664) internal successors, (1027), 23 states have internal predecessors, (1027), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:11:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 4114 transitions. [2024-11-17 00:11:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2024-11-17 00:11:51,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:51,574 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:11:51,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:11:51,775 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,SelfDestructingSolverStorable9 [2024-11-17 00:11:51,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash -525243637, now seen corresponding path program 2 times [2024-11-17 00:11:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:11:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752426246] [2024-11-17 00:11:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:11:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:11:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:12:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:12:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:12:00,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:00,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752426246] [2024-11-17 00:12:00,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752426246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:12:00,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207764479] [2024-11-17 00:12:00,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:12:00,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:12:00,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:12:00,848 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) [2024-11-17 00:12:00,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:12:01,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:12:01,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:12:01,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:12:01,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:12:01,479 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 [2024-11-17 00:12:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3471 trivial. 0 not checked. [2024-11-17 00:12:01,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:12:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207764479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:01,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:12:01,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 27 [2024-11-17 00:12:01,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50804036] [2024-11-17 00:12:01,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:01,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:12:01,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:01,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:12:01,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:12:01,993 INFO L87 Difference]: Start difference. First operand 2612 states and 4114 transitions. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:12:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:06,710 INFO L93 Difference]: Finished difference Result 3742 states and 6283 transitions. [2024-11-17 00:12:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:12:06,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 863 [2024-11-17 00:12:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:06,719 INFO L225 Difference]: With dead ends: 3742 [2024-11-17 00:12:06,719 INFO L226 Difference]: Without dead ends: 3742 [2024-11-17 00:12:06,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 863 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 00:12:06,720 INFO L432 NwaCegarLoop]: 2469 mSDtfsCounter, 1361 mSDsluCounter, 10801 mSDsCounter, 0 mSdLazyCounter, 4144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 13270 SdHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:06,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 13270 Invalid, 4145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4144 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-17 00:12:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2024-11-17 00:12:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2648. [2024-11-17 00:12:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2129 states have (on average 1.4692343823391263) internal successors, (3128), 2631 states have internal predecessors, (3128), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-17 00:12:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 4154 transitions. [2024-11-17 00:12:06,931 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 4154 transitions. Word has length 863 [2024-11-17 00:12:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:06,932 INFO L471 AbstractCegarLoop]: Abstraction has 2648 states and 4154 transitions. [2024-11-17 00:12:06,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:12:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 4154 transitions. [2024-11-17 00:12:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2024-11-17 00:12:06,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:06,946 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:06,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:12:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:12:07,147 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1406323507, now seen corresponding path program 1 times [2024-11-17 00:12:07,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:07,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394480810] [2024-11-17 00:12:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:12:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:12:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:12:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394480810] [2024-11-17 00:12:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394480810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:12:15,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277280662] [2024-11-17 00:12:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:15,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:12:15,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:12:15,423 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) [2024-11-17 00:12:15,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:12:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:16,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 4178 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 00:12:16,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:12:16,559 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 [2024-11-17 00:12:16,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:16,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:16,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:16,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:17,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:17,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:17,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:17,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:17,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:17,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:12:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:12:17,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:12:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:12:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277280662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:12:18,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:12:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 43 [2024-11-17 00:12:18,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401802443] [2024-11-17 00:12:18,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:12:18,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-17 00:12:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-17 00:12:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=1209, Unknown=0, NotChecked=0, Total=1806 [2024-11-17 00:12:18,737 INFO L87 Difference]: Start difference. First operand 2648 states and 4154 transitions. Second operand has 43 states, 43 states have (on average 56.13953488372093) internal successors, (2414), 42 states have internal predecessors, (2414), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)