./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_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_OAT_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 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:07:44,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:07:44,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:07:44,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:07:44,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:07:45,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:07:45,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:07:45,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:07:45,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:07:45,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:07:45,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:07:45,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:07:45,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:07:45,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:07:45,013 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:07:45,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:07:45,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:07:45,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:07:45,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:07:45,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:07:45,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:07:45,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:07:45,016 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:07:45,016 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:07:45,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:07:45,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:07:45,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:07:45,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:07:45,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:07:45,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:07:45,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:07:45,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:07:45,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:07:45,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:07:45,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:07:45,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:07:45,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:07:45,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:07:45,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:07:45,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:07:45,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:07:45,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:07:45,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:07:45,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:07:45,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:07:45,022 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 -> 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 [2024-11-17 00:07:45,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:07:45,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:07:45,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:07:45,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:07:45,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:07:45,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2024-11-17 00:07:46,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:07:46,886 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:07:46,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2024-11-17 00:07:46,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82c2ff9c/8d6a40e1df2a43b6a022fff74c2513a3/FLAGf9d14b0a9 [2024-11-17 00:07:46,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82c2ff9c/8d6a40e1df2a43b6a022fff74c2513a3 [2024-11-17 00:07:46,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:07:46,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:07:46,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:07:46,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:07:46,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:07:46,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:07:46" (1/1) ... [2024-11-17 00:07:46,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a5279f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:46, skipping insertion in model container [2024-11-17 00:07:46,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:07:46" (1/1) ... [2024-11-17 00:07:46,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:07:47,523 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:07:47,545 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:07:47,549 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:07:47,551 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:07:47,558 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:07:47,574 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:07:47,578 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:07:47,580 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:07:47,580 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:07:47,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:07:47,593 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:07:47,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:07:47,757 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:07:47,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47 WrapperNode [2024-11-17 00:07:47,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:07:47,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:07:47,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:07:47,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:07:47,771 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:07:47" (1/1) ... [2024-11-17 00:07:47,839 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:07:47" (1/1) ... [2024-11-17 00:07:47,933 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3252 [2024-11-17 00:07:47,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:07:47,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:07:47,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:07:47,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:07:47,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:47,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:47,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:48,021 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-17 00:07:48,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:48,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:48,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:48,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:48,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:48,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:48,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:07:48,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:07:48,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:07:48,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:07:48,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (1/1) ... [2024-11-17 00:07:48,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:07:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:07:48,127 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:07:48,131 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:07:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:07:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:07:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:07:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:07:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:07:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:07:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:07:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:07:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:07:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:07:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:07:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:07:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:07:48,174 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:07:48,174 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:07:48,174 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:07:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:07:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:07:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:07:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:07:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:07:48,337 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:07:48,339 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:07:50,405 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:07:50,605 INFO L? ?]: Removed 799 outVars from TransFormulas that were not future-live. [2024-11-17 00:07:50,606 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:07:50,666 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:07:50,666 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 00:07:50,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:07:50 BoogieIcfgContainer [2024-11-17 00:07:50,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:07:50,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:07:50,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:07:50,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:07:50,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:07:46" (1/3) ... [2024-11-17 00:07:50,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3605351b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:07:50, skipping insertion in model container [2024-11-17 00:07:50,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:07:47" (2/3) ... [2024-11-17 00:07:50,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3605351b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:07:50, skipping insertion in model container [2024-11-17 00:07:50,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:07:50" (3/3) ... [2024-11-17 00:07:50,672 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-1.i [2024-11-17 00:07:50,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:07:50,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:07:50,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:07:50,750 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;@2cbb991c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:07:50,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:07:50,757 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:07:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:07:50,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:07:50,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:07:50,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:07:50,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:07:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 961734643, now seen corresponding path program 1 times [2024-11-17 00:07:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:07:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954565829] [2024-11-17 00:07:50,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:07:50,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:07:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:50,894 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:07:50,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:07:50,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954565829] [2024-11-17 00:07:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954565829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:07:50,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:07:50,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:07:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147170898] [2024-11-17 00:07:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:07:50,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:07:50,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:07:50,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:07:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:07:50,933 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:07:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:07:51,098 INFO L93 Difference]: Finished difference Result 1379 states and 2542 transitions. [2024-11-17 00:07:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:07:51,101 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:07:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:07:51,124 INFO L225 Difference]: With dead ends: 1379 [2024-11-17 00:07:51,124 INFO L226 Difference]: Without dead ends: 1376 [2024-11-17 00:07:51,127 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:07:51,132 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:07:51,133 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:07:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-17 00:07:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-17 00:07:51,443 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:07:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2539 transitions. [2024-11-17 00:07:51,455 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2539 transitions. Word has length 8 [2024-11-17 00:07:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:07:51,455 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2539 transitions. [2024-11-17 00:07:51,456 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:07:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2539 transitions. [2024-11-17 00:07:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:07:51,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:07:51,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:07:51,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:07:51,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:07:51,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:07:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash 806273931, now seen corresponding path program 1 times [2024-11-17 00:07:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:07:51,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917218697] [2024-11-17 00:07:51,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:07:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:07:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:51,620 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:07:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:07:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917218697] [2024-11-17 00:07:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917218697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:07:51,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:07:51,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:07:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576577650] [2024-11-17 00:07:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:07:51,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:07:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:07:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:07:51,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:07:51,623 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:07:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:07:52,437 INFO L93 Difference]: Finished difference Result 2734 states and 5061 transitions. [2024-11-17 00:07:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:07:52,438 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:07:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:07:52,451 INFO L225 Difference]: With dead ends: 2734 [2024-11-17 00:07:52,452 INFO L226 Difference]: Without dead ends: 2734 [2024-11-17 00:07:52,452 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:07:52,453 INFO L432 NwaCegarLoop]: 2546 mSDtfsCounter, 1512 mSDsluCounter, 4517 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:07:52,453 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.7s Time] [2024-11-17 00:07:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2024-11-17 00:07:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 1378. [2024-11-17 00:07:52,811 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:07:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2541 transitions. [2024-11-17 00:07:52,816 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2541 transitions. Word has length 10 [2024-11-17 00:07:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:07:52,817 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 2541 transitions. [2024-11-17 00:07:52,817 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:07:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2541 transitions. [2024-11-17 00:07:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:07:52,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:07:52,820 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:07:52,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:07:52,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:07:52,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:07:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1829955088, now seen corresponding path program 1 times [2024-11-17 00:07:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:07:52,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972315309] [2024-11-17 00:07:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:07:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:07:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:53,129 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:07:53,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:07:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972315309] [2024-11-17 00:07:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972315309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:07:53,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:07:53,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:07:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307647501] [2024-11-17 00:07:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:07:53,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:07:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:07:53,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:07:53,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:07:53,132 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:07:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:07:53,271 INFO L93 Difference]: Finished difference Result 1336 states and 2464 transitions. [2024-11-17 00:07:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:07:53,272 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:07:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:07:53,279 INFO L225 Difference]: With dead ends: 1336 [2024-11-17 00:07:53,279 INFO L226 Difference]: Without dead ends: 1336 [2024-11-17 00:07:53,279 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:07:53,280 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:07:53,280 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.1s Time] [2024-11-17 00:07:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-17 00:07:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2024-11-17 00:07:53,374 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:07:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2464 transitions. [2024-11-17 00:07:53,380 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2464 transitions. Word has length 87 [2024-11-17 00:07:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:07:53,380 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 2464 transitions. [2024-11-17 00:07:53,380 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:07:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2464 transitions. [2024-11-17 00:07:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:07:53,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:07:53,383 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:07:53,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:07:53,383 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:07:53,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:07:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -836942663, now seen corresponding path program 1 times [2024-11-17 00:07:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:07:53,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397260791] [2024-11-17 00:07:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:07:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:07:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:53,529 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:07:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:07:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397260791] [2024-11-17 00:07:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397260791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:07:53,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:07:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:07:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349188847] [2024-11-17 00:07:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:07:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:07:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:07:53,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:07:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:07:53,533 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:07:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:07:53,647 INFO L93 Difference]: Finished difference Result 1336 states and 2461 transitions. [2024-11-17 00:07:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:07:53,647 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:07:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:07:53,653 INFO L225 Difference]: With dead ends: 1336 [2024-11-17 00:07:53,653 INFO L226 Difference]: Without dead ends: 1336 [2024-11-17 00:07:53,653 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:07:53,654 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:07:53,654 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:07:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-17 00:07:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2024-11-17 00:07:53,741 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:07:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2461 transitions. [2024-11-17 00:07:53,746 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2461 transitions. Word has length 87 [2024-11-17 00:07:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:07:53,747 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 2461 transitions. [2024-11-17 00:07:53,747 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:07:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2461 transitions. [2024-11-17 00:07:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:07:53,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:07:53,750 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:07:53,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:07:53,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:07:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:07:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1853823414, now seen corresponding path program 1 times [2024-11-17 00:07:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:07:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688980918] [2024-11-17 00:07:53,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:07:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:07:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:53,889 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:07:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:07:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688980918] [2024-11-17 00:07:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688980918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:07:53,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:07:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:07:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076684036] [2024-11-17 00:07:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:07:53,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:07:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:07:53,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:07:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:07:53,891 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:07:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:07:54,031 INFO L93 Difference]: Finished difference Result 2566 states and 4786 transitions. [2024-11-17 00:07:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:07:54,031 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:07:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:07:54,042 INFO L225 Difference]: With dead ends: 2566 [2024-11-17 00:07:54,043 INFO L226 Difference]: Without dead ends: 2566 [2024-11-17 00:07:54,043 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:07:54,044 INFO L432 NwaCegarLoop]: 2614 mSDtfsCounter, 1265 mSDsluCounter, 2410 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:07:54,044 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.1s Time] [2024-11-17 00:07:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2024-11-17 00:07:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2561. [2024-11-17 00:07:54,221 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:07:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4782 transitions. [2024-11-17 00:07:54,230 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4782 transitions. Word has length 87 [2024-11-17 00:07:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:07:54,231 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 4782 transitions. [2024-11-17 00:07:54,231 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:07:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4782 transitions. [2024-11-17 00:07:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 00:07:54,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:07:54,233 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:07:54,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:07:54,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:07:54,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:07:54,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1561251622, now seen corresponding path program 1 times [2024-11-17 00:07:54,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:07:54,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175841809] [2024-11-17 00:07:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:07:54,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:07:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:07:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:07:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:54,529 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:07:54,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:07:54,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175841809] [2024-11-17 00:07:54,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175841809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:07:54,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:07:54,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:07:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37112048] [2024-11-17 00:07:54,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:07:54,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:07:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:07:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:07:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:07:54,533 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:07:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:07:58,617 INFO L93 Difference]: Finished difference Result 4794 states and 9118 transitions. [2024-11-17 00:07:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:07:58,618 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:07:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:07:58,637 INFO L225 Difference]: With dead ends: 4794 [2024-11-17 00:07:58,637 INFO L226 Difference]: Without dead ends: 4794 [2024-11-17 00:07:58,638 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:07:58,638 INFO L432 NwaCegarLoop]: 2645 mSDtfsCounter, 1435 mSDsluCounter, 4693 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:07:58,639 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.9s Time] [2024-11-17 00:07:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2024-11-17 00:07:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 2563. [2024-11-17 00:07:58,960 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:07:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4784 transitions. [2024-11-17 00:07:58,967 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4784 transitions. Word has length 102 [2024-11-17 00:07:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:07:58,968 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 4784 transitions. [2024-11-17 00:07:58,968 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:07:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4784 transitions. [2024-11-17 00:07:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 00:07:58,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:07:58,970 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:07:58,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:07:58,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:07:58,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:07:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash -276968713, now seen corresponding path program 1 times [2024-11-17 00:07:58,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:07:58,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099115071] [2024-11-17 00:07:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:07:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:07:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:59,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:07:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:59,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:07:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:07:59,213 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:07:59,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:07:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099115071] [2024-11-17 00:07:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099115071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:07:59,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:07:59,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:07:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204110034] [2024-11-17 00:07:59,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:07:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:07:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:07:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:07:59,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:07:59,215 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:08:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:01,326 INFO L93 Difference]: Finished difference Result 2482 states and 4636 transitions. [2024-11-17 00:08:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:08:01,326 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:08:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:01,339 INFO L225 Difference]: With dead ends: 2482 [2024-11-17 00:08:01,339 INFO L226 Difference]: Without dead ends: 2482 [2024-11-17 00:08:01,339 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:08:01,342 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 40 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:01,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 7217 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 00:08:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2024-11-17 00:08:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2479. [2024-11-17 00:08:01,611 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:08:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 4630 transitions. [2024-11-17 00:08:01,618 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 4630 transitions. Word has length 159 [2024-11-17 00:08:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:01,619 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 4630 transitions. [2024-11-17 00:08:01,619 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:08:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 4630 transitions. [2024-11-17 00:08:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 00:08:01,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:01,622 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:08:01,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:08:01,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:01,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash -548789519, now seen corresponding path program 1 times [2024-11-17 00:08:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:08:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244898398] [2024-11-17 00:08:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:08:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:08:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:01,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:08:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:01,839 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:08:01,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:08:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244898398] [2024-11-17 00:08:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244898398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:08:01,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:08:01,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:08:01,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551063264] [2024-11-17 00:08:01,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:08:01,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:08:01,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:08:01,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:08:01,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:08:01,848 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:08:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:06,276 INFO L93 Difference]: Finished difference Result 2568 states and 4747 transitions. [2024-11-17 00:08:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:08:06,277 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:08:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:06,288 INFO L225 Difference]: With dead ends: 2568 [2024-11-17 00:08:06,288 INFO L226 Difference]: Without dead ends: 2568 [2024-11-17 00:08:06,289 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:08:06,289 INFO L432 NwaCegarLoop]: 2511 mSDtfsCounter, 4975 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 2432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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, 4.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:06,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5477 Valid, 6425 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2432 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-17 00:08:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2024-11-17 00:08:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1384. [2024-11-17 00:08:06,467 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:08:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2500 transitions. [2024-11-17 00:08:06,470 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2500 transitions. Word has length 159 [2024-11-17 00:08:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:06,471 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2500 transitions. [2024-11-17 00:08:06,471 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:08:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2500 transitions. [2024-11-17 00:08:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-17 00:08:06,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:06,472 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:08:06,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:08:06,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:06,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1478286562, now seen corresponding path program 1 times [2024-11-17 00:08:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:08:06,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931146669] [2024-11-17 00:08:06,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:08:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:08:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:08:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:07,081 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:08:07,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:08:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931146669] [2024-11-17 00:08:07,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931146669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:08:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994858135] [2024-11-17 00:08:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:07,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:08:07,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:08:07,083 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:08:07,084 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:08:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:07,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:08:07,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:07,401 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:08:07,677 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 23 treesize of output 3 [2024-11-17 00:08:07,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:08:07,701 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:08:07,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:08:07,872 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:08:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994858135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:08:07,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:08:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-17 00:08:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650870046] [2024-11-17 00:08:07,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:08:07,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:08:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:08:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:08:07,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:08:07,875 INFO L87 Difference]: Start difference. First operand 1384 states and 2500 transitions. Second operand has 12 states, 12 states have (on average 27.75) internal successors, (333), 11 states have internal predecessors, (333), 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:08:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:14,902 INFO L93 Difference]: Finished difference Result 4129 states and 7488 transitions. [2024-11-17 00:08:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:08:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.75) internal successors, (333), 11 states have internal predecessors, (333), 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:08:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:14,919 INFO L225 Difference]: With dead ends: 4129 [2024-11-17 00:08:14,920 INFO L226 Difference]: Without dead ends: 4129 [2024-11-17 00:08:14,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 337 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:08:14,922 INFO L432 NwaCegarLoop]: 1867 mSDtfsCounter, 4140 mSDsluCounter, 10152 mSDsCounter, 0 mSdLazyCounter, 7150 mSolverCounterSat, 2516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5148 SdHoareTripleChecker+Valid, 12019 SdHoareTripleChecker+Invalid, 9666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2516 IncrementalHoareTripleChecker+Valid, 7150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:14,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5148 Valid, 12019 Invalid, 9666 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2516 Valid, 7150 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-17 00:08:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2024-11-17 00:08:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 1736. [2024-11-17 00:08:15,158 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:08:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2962 transitions. [2024-11-17 00:08:15,161 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2962 transitions. Word has length 170 [2024-11-17 00:08:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:15,162 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2962 transitions. [2024-11-17 00:08:15,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.75) internal successors, (333), 11 states have internal predecessors, (333), 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:08:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2962 transitions. [2024-11-17 00:08:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-17 00:08:15,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:15,165 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:08:15,184 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:08:15,366 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:08:15,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:15,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1894761621, now seen corresponding path program 1 times [2024-11-17 00:08:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:08:15,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612246243] [2024-11-17 00:08:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:15,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:08:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:18,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:08:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:08:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:18,267 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:08:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:08:18,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612246243] [2024-11-17 00:08:18,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612246243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:08:18,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128748330] [2024-11-17 00:08:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:18,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:08:18,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:08:18,271 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:08:18,272 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:08:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:18,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 1909 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 00:08:18,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:18,816 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:08:18,986 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 23 treesize of output 3 [2024-11-17 00:08:19,082 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 36 treesize of output 13 [2024-11-17 00:08:19,181 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 36 treesize of output 13 [2024-11-17 00:08:19,266 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 36 treesize of output 13 [2024-11-17 00:08:19,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:08:19,276 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:08:19,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:08:19,697 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:08:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128748330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:08:19,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:08:19,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2024-11-17 00:08:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030622483] [2024-11-17 00:08:19,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:08:19,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 00:08:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:08:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 00:08:19,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:08:19,700 INFO L87 Difference]: Start difference. First operand 1736 states and 2962 transitions. Second operand has 21 states, 21 states have (on average 38.142857142857146) internal successors, (801), 20 states have internal predecessors, (801), 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:08:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:36,073 INFO L93 Difference]: Finished difference Result 9481 states and 17286 transitions. [2024-11-17 00:08:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 00:08:36,074 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 38.142857142857146) internal successors, (801), 20 states have internal predecessors, (801), 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:08:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:36,097 INFO L225 Difference]: With dead ends: 9481 [2024-11-17 00:08:36,098 INFO L226 Difference]: Without dead ends: 9481 [2024-11-17 00:08:36,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 799 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-11-17 00:08:36,099 INFO L432 NwaCegarLoop]: 1867 mSDtfsCounter, 19673 mSDsluCounter, 17480 mSDsCounter, 0 mSdLazyCounter, 10527 mSolverCounterSat, 7550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22693 SdHoareTripleChecker+Valid, 19347 SdHoareTripleChecker+Invalid, 18077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7550 IncrementalHoareTripleChecker+Valid, 10527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:36,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22693 Valid, 19347 Invalid, 18077 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7550 Valid, 10527 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2024-11-17 00:08:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9481 states. [2024-11-17 00:08:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9481 to 2612. [2024-11-17 00:08:36,747 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:08:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 4114 transitions. [2024-11-17 00:08:36,752 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 4114 transitions. Word has length 401 [2024-11-17 00:08:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:36,752 INFO L471 AbstractCegarLoop]: Abstraction has 2612 states and 4114 transitions. [2024-11-17 00:08:36,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 38.142857142857146) internal successors, (801), 20 states have internal predecessors, (801), 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:08:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 4114 transitions. [2024-11-17 00:08:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2024-11-17 00:08:36,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:36,765 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:08:36,783 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:08:36,969 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:08:36,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:36,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash -651099125, now seen corresponding path program 2 times [2024-11-17 00:08:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:08:36,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329673432] [2024-11-17 00:08:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:08:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:46,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:08:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:46,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:08:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:46,979 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:08:46,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:08:46,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329673432] [2024-11-17 00:08:46,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329673432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:08:46,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320386669] [2024-11-17 00:08:46,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:08:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:08:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:08:46,982 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:08:46,983 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:08:47,518 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:08:47,518 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:08:47,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:08:47,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:47,561 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:08:48,219 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:08:48,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:08:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320386669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:08:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:08:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-11-17 00:08:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609014469] [2024-11-17 00:08:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:08:48,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:08:48,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:08:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:08:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-11-17 00:08:48,222 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:08:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:52,346 INFO L93 Difference]: Finished difference Result 3742 states and 6283 transitions. [2024-11-17 00:08:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:08:52,346 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:08:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:52,356 INFO L225 Difference]: With dead ends: 3742 [2024-11-17 00:08:52,356 INFO L226 Difference]: Without dead ends: 3742 [2024-11-17 00:08:52,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-11-17 00:08:52,357 INFO L432 NwaCegarLoop]: 2470 mSDtfsCounter, 1363 mSDsluCounter, 9432 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 11902 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:52,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 11902 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-17 00:08:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2024-11-17 00:08:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2648. [2024-11-17 00:08:52,552 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:08:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 4154 transitions. [2024-11-17 00:08:52,557 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 4154 transitions. Word has length 863 [2024-11-17 00:08:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:52,558 INFO L471 AbstractCegarLoop]: Abstraction has 2648 states and 4154 transitions. [2024-11-17 00:08:52,558 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:08:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 4154 transitions. [2024-11-17 00:08:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2024-11-17 00:08:52,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:52,573 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:08:52,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:08:52,774 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:08:52,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:52,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1012876339, now seen corresponding path program 1 times [2024-11-17 00:08:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:08:52,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447524649] [2024-11-17 00:08:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:08:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:09:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:09:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:02,788 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:09:02,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:09:02,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447524649] [2024-11-17 00:09:02,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447524649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:09:02,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260927673] [2024-11-17 00:09:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:02,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:09:02,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:09:02,791 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:09:02,792 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:09:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:03,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 4178 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 00:09:03,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:03,927 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:09:04,072 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 23 treesize of output 3 [2024-11-17 00:09:04,159 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 36 treesize of output 13 [2024-11-17 00:09:04,236 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 36 treesize of output 13 [2024-11-17 00:09:04,324 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 36 treesize of output 13 [2024-11-17 00:09:04,408 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 36 treesize of output 13 [2024-11-17 00:09:04,478 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 36 treesize of output 13 [2024-11-17 00:09:04,564 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 36 treesize of output 13 [2024-11-17 00:09:04,642 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 36 treesize of output 13 [2024-11-17 00:09:04,737 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 36 treesize of output 13 [2024-11-17 00:09:04,817 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 36 treesize of output 13 [2024-11-17 00:09:04,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:09:04,827 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:09:04,827 INFO L311 TraceCheckSpWp]: Computing backward predicates...