./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:23:41,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:23:41,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:23:41,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:23:41,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:23:41,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:23:41,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:23:41,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:23:41,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:23:41,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:23:41,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:23:41,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:23:41,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:23:41,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:23:41,869 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:23:41,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:23:41,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:23:41,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:23:41,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:23:41,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:23:41,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:23:41,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:23:41,874 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:23:41,874 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:23:41,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:23:41,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:23:41,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:23:41,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:23:41,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:23:41,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:23:41,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:23:41,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:23:41,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:23:41,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:23:41,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:23:41,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:23:41,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:23:41,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:23:41,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:23:41,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:23:41,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:23:41,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:23:41,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:23:41,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:23:41,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:23:41,878 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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2024-11-19 06:23:42,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:23:42,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:23:42,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:23:42,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:23:42,106 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:23:42,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-11-19 06:23:43,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:23:43,499 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:23:43,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-11-19 06:23:43,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a04f8d4/08790d87a7ec4030b89ed8043ab97f57/FLAG75b6ae777 [2024-11-19 06:23:43,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a04f8d4/08790d87a7ec4030b89ed8043ab97f57 [2024-11-19 06:23:43,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:23:43,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:23:43,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:23:43,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:23:43,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:23:43,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:23:43" (1/1) ... [2024-11-19 06:23:43,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226a993b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:43, skipping insertion in model container [2024-11-19 06:23:43,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:23:43" (1/1) ... [2024-11-19 06:23:43,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:23:43,885 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,904 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,906 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,908 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,913 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,961 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,962 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,967 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,967 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:43,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:23:43,991 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:23:44,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:23:44,126 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:23:44,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44 WrapperNode [2024-11-19 06:23:44,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:23:44,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:23:44,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:23:44,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:23:44,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,207 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1302 [2024-11-19 06:23:44,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:23:44,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:23:44,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:23:44,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:23:44,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,286 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-19 06:23:44,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:23:44,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:23:44,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:23:44,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:23:44,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (1/1) ... [2024-11-19 06:23:44,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:23:44,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:23:44,377 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-19 06:23:44,380 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-19 06:23:44,418 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:23:44,419 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:23:44,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:23:44,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:23:44,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 06:23:44,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:23:44,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:23:44,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:23:44,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:23:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:23:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:23:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:23:44,571 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:23:44,573 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:23:45,561 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2024-11-19 06:23:45,561 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:23:45,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:23:45,585 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-19 06:23:45,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:23:45 BoogieIcfgContainer [2024-11-19 06:23:45,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:23:45,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:23:45,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:23:45,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:23:45,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:23:43" (1/3) ... [2024-11-19 06:23:45,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de17020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:23:45, skipping insertion in model container [2024-11-19 06:23:45,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:44" (2/3) ... [2024-11-19 06:23:45,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de17020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:23:45, skipping insertion in model container [2024-11-19 06:23:45,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:23:45" (3/3) ... [2024-11-19 06:23:45,593 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2024-11-19 06:23:45,606 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:23:45,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:23:45,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:23:45,657 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;@2f41856c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:23:45,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:23:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 385 states, 369 states have (on average 1.6233062330623307) internal successors, (599), 378 states have internal predecessors, (599), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 06:23:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:23:45,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:45,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:45,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:45,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1585083213, now seen corresponding path program 1 times [2024-11-19 06:23:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:45,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265463362] [2024-11-19 06:23:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:45,806 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-19 06:23:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:45,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265463362] [2024-11-19 06:23:45,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265463362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:45,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:45,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:23:45,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373424692] [2024-11-19 06:23:45,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:45,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:23:45,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:23:45,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:23:45,837 INFO L87 Difference]: Start difference. First operand has 385 states, 369 states have (on average 1.6233062330623307) internal successors, (599), 378 states have internal predecessors, (599), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:45,882 INFO L93 Difference]: Finished difference Result 383 states and 556 transitions. [2024-11-19 06:23:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:23:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:23:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:45,896 INFO L225 Difference]: With dead ends: 383 [2024-11-19 06:23:45,898 INFO L226 Difference]: Without dead ends: 381 [2024-11-19 06:23:45,899 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-19 06:23:45,903 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:45,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:23:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-19 06:23:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-19 06:23:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 367 states have (on average 1.4604904632152589) internal successors, (536), 374 states have internal predecessors, (536), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 06:23:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 554 transitions. [2024-11-19 06:23:45,956 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 554 transitions. Word has length 7 [2024-11-19 06:23:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:45,957 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 554 transitions. [2024-11-19 06:23:45,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 554 transitions. [2024-11-19 06:23:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:23:45,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:45,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:45,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:23:45,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:45,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash -940236438, now seen corresponding path program 1 times [2024-11-19 06:23:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518022275] [2024-11-19 06:23:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:46,112 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-19 06:23:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:46,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518022275] [2024-11-19 06:23:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518022275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:46,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:46,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:23:46,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054164448] [2024-11-19 06:23:46,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:46,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:23:46,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:46,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:23:46,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:46,117 INFO L87 Difference]: Start difference. First operand 381 states and 554 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:46,292 INFO L93 Difference]: Finished difference Result 745 states and 1092 transitions. [2024-11-19 06:23:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:23:46,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:23:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:46,297 INFO L225 Difference]: With dead ends: 745 [2024-11-19 06:23:46,297 INFO L226 Difference]: Without dead ends: 745 [2024-11-19 06:23:46,298 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-19 06:23:46,298 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 518 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:46,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1596 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:23:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-19 06:23:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 383. [2024-11-19 06:23:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 369 states have (on average 1.4579945799457994) internal successors, (538), 376 states have internal predecessors, (538), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 06:23:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 556 transitions. [2024-11-19 06:23:46,318 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 556 transitions. Word has length 9 [2024-11-19 06:23:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:46,318 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 556 transitions. [2024-11-19 06:23:46,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 556 transitions. [2024-11-19 06:23:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 06:23:46,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:46,320 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] [2024-11-19 06:23:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:23:46,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:46,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1595384599, now seen corresponding path program 1 times [2024-11-19 06:23:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354941854] [2024-11-19 06:23:46,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:46,595 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-19 06:23:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:46,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354941854] [2024-11-19 06:23:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354941854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:46,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:46,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:23:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921281778] [2024-11-19 06:23:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:46,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:23:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:23:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:46,599 INFO L87 Difference]: Start difference. First operand 383 states and 556 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:46,667 INFO L93 Difference]: Finished difference Result 386 states and 552 transitions. [2024-11-19 06:23:46,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:23:46,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-19 06:23:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:46,669 INFO L225 Difference]: With dead ends: 386 [2024-11-19 06:23:46,669 INFO L226 Difference]: Without dead ends: 386 [2024-11-19 06:23:46,672 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-19 06:23:46,673 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 106 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:46,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1485 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:23:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-19 06:23:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2024-11-19 06:23:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 369 states have (on average 1.4390243902439024) internal successors, (531), 376 states have internal predecessors, (531), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 06:23:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 549 transitions. [2024-11-19 06:23:46,686 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 549 transitions. Word has length 85 [2024-11-19 06:23:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:46,686 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 549 transitions. [2024-11-19 06:23:46,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 549 transitions. [2024-11-19 06:23:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 06:23:46,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:46,690 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] [2024-11-19 06:23:46,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:23:46,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:46,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2124048923, now seen corresponding path program 1 times [2024-11-19 06:23:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:46,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620777673] [2024-11-19 06:23:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:46,850 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-19 06:23:46,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:46,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620777673] [2024-11-19 06:23:46,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620777673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:46,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:46,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:23:46,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466966594] [2024-11-19 06:23:46,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:46,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:23:46,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:46,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:23:46,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:46,852 INFO L87 Difference]: Start difference. First operand 383 states and 549 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:46,899 INFO L93 Difference]: Finished difference Result 335 states and 469 transitions. [2024-11-19 06:23:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:23:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-19 06:23:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:46,900 INFO L225 Difference]: With dead ends: 335 [2024-11-19 06:23:46,900 INFO L226 Difference]: Without dead ends: 335 [2024-11-19 06:23:46,901 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-19 06:23:46,901 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 9 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:46,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1334 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:23:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-19 06:23:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-11-19 06:23:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 321 states have (on average 1.4049844236760125) internal successors, (451), 328 states have internal predecessors, (451), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 06:23:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 469 transitions. [2024-11-19 06:23:46,907 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 469 transitions. Word has length 85 [2024-11-19 06:23:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:46,907 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 469 transitions. [2024-11-19 06:23:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 469 transitions. [2024-11-19 06:23:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 06:23:46,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:46,909 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] [2024-11-19 06:23:46,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:23:46,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:46,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1922224989, now seen corresponding path program 1 times [2024-11-19 06:23:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:46,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596170502] [2024-11-19 06:23:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:47,055 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-19 06:23:47,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:47,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596170502] [2024-11-19 06:23:47,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596170502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:47,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:47,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:23:47,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313741343] [2024-11-19 06:23:47,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:47,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:23:47,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:47,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:23:47,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:23:47,058 INFO L87 Difference]: Start difference. First operand 335 states and 469 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:47,101 INFO L93 Difference]: Finished difference Result 566 states and 804 transitions. [2024-11-19 06:23:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:23:47,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-19 06:23:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:47,103 INFO L225 Difference]: With dead ends: 566 [2024-11-19 06:23:47,103 INFO L226 Difference]: Without dead ends: 566 [2024-11-19 06:23:47,104 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-19 06:23:47,104 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 269 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:47,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1119 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:23:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-19 06:23:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 562. [2024-11-19 06:23:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 543 states have (on average 1.423572744014733) internal successors, (773), 555 states have internal predecessors, (773), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:23:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 801 transitions. [2024-11-19 06:23:47,118 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 801 transitions. Word has length 85 [2024-11-19 06:23:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:47,119 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 801 transitions. [2024-11-19 06:23:47,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:23:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 801 transitions. [2024-11-19 06:23:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 06:23:47,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:47,123 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] [2024-11-19 06:23:47,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:23:47,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2000053124, now seen corresponding path program 1 times [2024-11-19 06:23:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997372482] [2024-11-19 06:23:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:47,438 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-19 06:23:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997372482] [2024-11-19 06:23:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997372482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:47,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:23:47,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107413125] [2024-11-19 06:23:47,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:47,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:23:47,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:47,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:23:47,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:47,441 INFO L87 Difference]: Start difference. First operand 562 states and 801 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:47,522 INFO L93 Difference]: Finished difference Result 809 states and 1165 transitions. [2024-11-19 06:23:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:23:47,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-19 06:23:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:47,525 INFO L225 Difference]: With dead ends: 809 [2024-11-19 06:23:47,525 INFO L226 Difference]: Without dead ends: 809 [2024-11-19 06:23:47,526 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-19 06:23:47,529 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 427 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:47,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1425 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:23:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-19 06:23:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 564. [2024-11-19 06:23:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 545 states have (on average 1.4220183486238531) internal successors, (775), 557 states have internal predecessors, (775), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:23:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 803 transitions. [2024-11-19 06:23:47,542 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 803 transitions. Word has length 100 [2024-11-19 06:23:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:47,543 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 803 transitions. [2024-11-19 06:23:47,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 803 transitions. [2024-11-19 06:23:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 06:23:47,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:47,547 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] [2024-11-19 06:23:47,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:23:47,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:47,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash 379565716, now seen corresponding path program 1 times [2024-11-19 06:23:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:47,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015871262] [2024-11-19 06:23:47,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:47,794 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-19 06:23:47,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015871262] [2024-11-19 06:23:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015871262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:47,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:47,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:23:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275801159] [2024-11-19 06:23:47,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:47,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:23:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:23:47,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:23:47,798 INFO L87 Difference]: Start difference. First operand 564 states and 803 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:47,855 INFO L93 Difference]: Finished difference Result 480 states and 649 transitions. [2024-11-19 06:23:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:23:47,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-19 06:23:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:47,859 INFO L225 Difference]: With dead ends: 480 [2024-11-19 06:23:47,859 INFO L226 Difference]: Without dead ends: 480 [2024-11-19 06:23:47,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:23:47,860 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 41 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:47,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1072 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:23:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-19 06:23:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2024-11-19 06:23:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 461 states have (on average 1.3470715835140998) internal successors, (621), 473 states have internal predecessors, (621), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:23:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 649 transitions. [2024-11-19 06:23:47,871 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 649 transitions. Word has length 157 [2024-11-19 06:23:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:47,873 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 649 transitions. [2024-11-19 06:23:47,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 649 transitions. [2024-11-19 06:23:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 06:23:47,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:47,875 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] [2024-11-19 06:23:47,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:23:47,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash -164690494, now seen corresponding path program 1 times [2024-11-19 06:23:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436170198] [2024-11-19 06:23:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:48,064 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-19 06:23:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436170198] [2024-11-19 06:23:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436170198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:48,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:48,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:23:48,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491560088] [2024-11-19 06:23:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:48,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:23:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:48,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:23:48,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:48,066 INFO L87 Difference]: Start difference. First operand 480 states and 649 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:48,106 INFO L93 Difference]: Finished difference Result 468 states and 629 transitions. [2024-11-19 06:23:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:23:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-19 06:23:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:48,109 INFO L225 Difference]: With dead ends: 468 [2024-11-19 06:23:48,110 INFO L226 Difference]: Without dead ends: 468 [2024-11-19 06:23:48,110 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-19 06:23:48,111 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 9 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:48,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1073 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:23:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-19 06:23:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2024-11-19 06:23:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.3385300668151447) internal successors, (601), 461 states have internal predecessors, (601), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:23:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 629 transitions. [2024-11-19 06:23:48,119 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 629 transitions. Word has length 157 [2024-11-19 06:23:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:48,120 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 629 transitions. [2024-11-19 06:23:48,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 629 transitions. [2024-11-19 06:23:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 06:23:48,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:48,123 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] [2024-11-19 06:23:48,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:23:48,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:48,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 579858890, now seen corresponding path program 1 times [2024-11-19 06:23:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:48,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233418989] [2024-11-19 06:23:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:48,326 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-19 06:23:48,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:48,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233418989] [2024-11-19 06:23:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233418989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:48,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:23:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691127] [2024-11-19 06:23:48,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:48,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:23:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:23:48,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:23:48,329 INFO L87 Difference]: Start difference. First operand 468 states and 629 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-19 06:23:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:48,526 INFO L93 Difference]: Finished difference Result 551 states and 736 transitions. [2024-11-19 06:23:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:23:48,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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 157 [2024-11-19 06:23:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:48,529 INFO L225 Difference]: With dead ends: 551 [2024-11-19 06:23:48,529 INFO L226 Difference]: Without dead ends: 551 [2024-11-19 06:23:48,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:23:48,530 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 942 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:48,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 910 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:23:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-19 06:23:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 370. [2024-11-19 06:23:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 356 states have (on average 1.3258426966292134) internal successors, (472), 363 states have internal predecessors, (472), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 06:23:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 490 transitions. [2024-11-19 06:23:48,536 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 490 transitions. Word has length 157 [2024-11-19 06:23:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:48,536 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 490 transitions. [2024-11-19 06:23:48,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-19 06:23:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 490 transitions. [2024-11-19 06:23:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-19 06:23:48,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:48,537 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] [2024-11-19 06:23:48,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:23:48,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:48,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1039178274, now seen corresponding path program 1 times [2024-11-19 06:23:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325108932] [2024-11-19 06:23:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:49,058 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-19 06:23:49,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:49,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325108932] [2024-11-19 06:23:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325108932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:23:49,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706905768] [2024-11-19 06:23:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:49,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:23:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:23:49,061 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-19 06:23:49,062 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-19 06:23:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:49,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:23:49,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:49,410 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-19 06:23:49,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:23:49,600 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-19 06:23:49,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:49,756 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-19 06:23:49,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706905768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:49,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:23:49,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2024-11-19 06:23:49,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869879935] [2024-11-19 06:23:49,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:49,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:23:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:49,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:23:49,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:23:49,759 INFO L87 Difference]: Start difference. First operand 370 states and 490 transitions. Second operand has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:23:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:49,970 INFO L93 Difference]: Finished difference Result 1088 states and 1453 transitions. [2024-11-19 06:23:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:23:49,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 167 [2024-11-19 06:23:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:49,974 INFO L225 Difference]: With dead ends: 1088 [2024-11-19 06:23:49,974 INFO L226 Difference]: Without dead ends: 1088 [2024-11-19 06:23:49,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 326 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:23:49,975 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 1522 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:49,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3131 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:23:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-11-19 06:23:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 705. [2024-11-19 06:23:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 687 states have (on average 1.3231441048034935) internal successors, (909), 694 states have internal predecessors, (909), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 06:23:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 933 transitions. [2024-11-19 06:23:49,986 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 933 transitions. Word has length 167 [2024-11-19 06:23:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:49,986 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 933 transitions. [2024-11-19 06:23:49,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:23:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 933 transitions. [2024-11-19 06:23:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-11-19 06:23:49,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:49,989 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, 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] [2024-11-19 06:23:50,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:23:50,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 06:23:50,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:50,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:50,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1402764315, now seen corresponding path program 1 times [2024-11-19 06:23:50,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:50,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382833373] [2024-11-19 06:23:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:50,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:23:52,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382833373] [2024-11-19 06:23:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382833373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:23:52,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857362860] [2024-11-19 06:23:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:52,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:23:52,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:23:52,845 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-19 06:23:52,849 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-19 06:23:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:53,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:23:53,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:53,390 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-19 06:23:53,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:23:53,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:23:53,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:23:53,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:23:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:23:53,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:23:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857362860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:54,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:23:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2024-11-19 06:23:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018864250] [2024-11-19 06:23:54,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:54,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:23:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:54,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:23:54,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:23:54,310 INFO L87 Difference]: Start difference. First operand 705 states and 933 transitions. Second operand has 24 states, 24 states have (on average 42.166666666666664) internal successors, (1012), 24 states have internal predecessors, (1012), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:23:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:55,105 INFO L93 Difference]: Finished difference Result 2279 states and 3055 transitions. [2024-11-19 06:23:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:23:55,106 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 42.166666666666664) internal successors, (1012), 24 states have internal predecessors, (1012), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 395 [2024-11-19 06:23:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:55,117 INFO L225 Difference]: With dead ends: 2279 [2024-11-19 06:23:55,117 INFO L226 Difference]: Without dead ends: 2279 [2024-11-19 06:23:55,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 779 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 06:23:55,119 INFO L432 NwaCegarLoop]: 1391 mSDtfsCounter, 3478 mSDsluCounter, 12083 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3513 SdHoareTripleChecker+Valid, 13474 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:55,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3513 Valid, 13474 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:23:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2024-11-19 06:23:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1533. [2024-11-19 06:23:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1509 states have (on average 1.3220675944333995) internal successors, (1995), 1516 states have internal predecessors, (1995), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 06:23:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2031 transitions. [2024-11-19 06:23:55,145 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2031 transitions. Word has length 395 [2024-11-19 06:23:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:55,145 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2031 transitions. [2024-11-19 06:23:55,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 42.166666666666664) internal successors, (1012), 24 states have internal predecessors, (1012), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:23:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2031 transitions. [2024-11-19 06:23:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 06:23:55,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:55,157 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, 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] [2024-11-19 06:23:55,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:23:55,358 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,SelfDestructingSolverStorable10 [2024-11-19 06:23:55,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1715691891, now seen corresponding path program 2 times [2024-11-19 06:23:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473309793] [2024-11-19 06:23:55,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:23:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:55,591 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:23:55,591 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:23:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 06:23:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473309793] [2024-11-19 06:23:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473309793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:55,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:23:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736598701] [2024-11-19 06:23:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:55,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:23:55,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:55,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:23:55,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:23:55,761 INFO L87 Difference]: Start difference. First operand 1533 states and 2031 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:56,019 INFO L93 Difference]: Finished difference Result 1538 states and 2036 transitions. [2024-11-19 06:23:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:23:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 06:23:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:56,025 INFO L225 Difference]: With dead ends: 1538 [2024-11-19 06:23:56,025 INFO L226 Difference]: Without dead ends: 1538 [2024-11-19 06:23:56,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:23:56,026 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 34 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:56,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1531 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:23:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-19 06:23:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1537. [2024-11-19 06:23:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1513 states have (on average 1.3212161269001983) internal successors, (1999), 1520 states have internal predecessors, (1999), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 06:23:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2035 transitions. [2024-11-19 06:23:56,044 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2035 transitions. Word has length 851 [2024-11-19 06:23:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:56,045 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2035 transitions. [2024-11-19 06:23:56,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2035 transitions. [2024-11-19 06:23:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-19 06:23:56,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:56,056 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, 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] [2024-11-19 06:23:56,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:23:56,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:56,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash 920481961, now seen corresponding path program 1 times [2024-11-19 06:23:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:56,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211442932] [2024-11-19 06:23:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 06:23:58,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:23:58,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211442932] [2024-11-19 06:23:58,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211442932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:58,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:58,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:23:58,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142483969] [2024-11-19 06:23:58,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:58,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:23:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:23:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:23:58,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:23:58,451 INFO L87 Difference]: Start difference. First operand 1537 states and 2035 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:58,735 INFO L93 Difference]: Finished difference Result 1542 states and 2041 transitions. [2024-11-19 06:23:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:23:58,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 852 [2024-11-19 06:23:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:58,740 INFO L225 Difference]: With dead ends: 1542 [2024-11-19 06:23:58,740 INFO L226 Difference]: Without dead ends: 1542 [2024-11-19 06:23:58,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:23:58,741 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 9 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:58,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1793 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:23:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-19 06:23:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1541. [2024-11-19 06:23:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1517 states have (on average 1.3210283454185894) internal successors, (2004), 1524 states have internal predecessors, (2004), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 06:23:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2040 transitions. [2024-11-19 06:23:58,761 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2040 transitions. Word has length 852 [2024-11-19 06:23:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:58,762 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2040 transitions. [2024-11-19 06:23:58,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-19 06:23:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2040 transitions. [2024-11-19 06:23:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-19 06:23:58,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:58,768 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, 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] [2024-11-19 06:23:58,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:23:58,768 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:58,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1037338307, now seen corresponding path program 1 times [2024-11-19 06:23:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:23:58,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057848283] [2024-11-19 06:23:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:23:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:24:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 06:24:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:24:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057848283] [2024-11-19 06:24:00,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057848283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:24:00,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:24:00,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:24:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020788890] [2024-11-19 06:24:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:24:00,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:24:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:24:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:24:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:24:00,496 INFO L87 Difference]: Start difference. First operand 1541 states and 2040 transitions. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:24:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:24:00,755 INFO L93 Difference]: Finished difference Result 1546 states and 2046 transitions. [2024-11-19 06:24:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:24:00,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 852 [2024-11-19 06:24:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:24:00,764 INFO L225 Difference]: With dead ends: 1546 [2024-11-19 06:24:00,764 INFO L226 Difference]: Without dead ends: 1546 [2024-11-19 06:24:00,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:24:00,764 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 10 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:24:00,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2097 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:24:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-19 06:24:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1541. [2024-11-19 06:24:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1517 states have (on average 1.3210283454185894) internal successors, (2004), 1524 states have internal predecessors, (2004), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 06:24:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2040 transitions. [2024-11-19 06:24:00,782 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2040 transitions. Word has length 852 [2024-11-19 06:24:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:24:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2040 transitions. [2024-11-19 06:24:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:24:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2040 transitions. [2024-11-19 06:24:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2024-11-19 06:24:00,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:24:00,788 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, 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-19 06:24:00,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:24:00,788 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:24:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:24:00,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1475891743, now seen corresponding path program 1 times [2024-11-19 06:24:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:24:00,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085254545] [2024-11-19 06:24:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:24:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:24:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:24:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 06:24:02,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:24:02,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085254545] [2024-11-19 06:24:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085254545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:24:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:24:02,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:24:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709172122] [2024-11-19 06:24:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:24:02,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:24:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:24:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:24:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:24:02,720 INFO L87 Difference]: Start difference. First operand 1541 states and 2040 transitions. Second operand has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:24:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:24:03,064 INFO L93 Difference]: Finished difference Result 1552 states and 2054 transitions. [2024-11-19 06:24:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:24:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 853 [2024-11-19 06:24:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:24:03,069 INFO L225 Difference]: With dead ends: 1552 [2024-11-19 06:24:03,070 INFO L226 Difference]: Without dead ends: 1552 [2024-11-19 06:24:03,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:24:03,071 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 28 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:24:03,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2507 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:24:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-11-19 06:24:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1549. [2024-11-19 06:24:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1525 states have (on average 1.320655737704918) internal successors, (2014), 1532 states have internal predecessors, (2014), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 06:24:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2050 transitions. [2024-11-19 06:24:03,090 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2050 transitions. Word has length 853 [2024-11-19 06:24:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:24:03,091 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2050 transitions. [2024-11-19 06:24:03,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:24:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2050 transitions. [2024-11-19 06:24:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2024-11-19 06:24:03,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:24:03,096 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, 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-19 06:24:03,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:24:03,096 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:24:03,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:24:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 976979588, now seen corresponding path program 1 times [2024-11-19 06:24:03,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:24:03,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223653787] [2024-11-19 06:24:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:24:03,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:24:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:24:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 06:24:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:24:04,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223653787] [2024-11-19 06:24:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223653787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:24:04,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:24:04,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:24:04,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969406514] [2024-11-19 06:24:04,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:24:04,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:24:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:24:04,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:24:04,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:24:04,614 INFO L87 Difference]: Start difference. First operand 1549 states and 2050 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 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-19 06:24:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:24:04,771 INFO L93 Difference]: Finished difference Result 1552 states and 2053 transitions. [2024-11-19 06:24:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:24:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 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 854 [2024-11-19 06:24:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:24:04,778 INFO L225 Difference]: With dead ends: 1552 [2024-11-19 06:24:04,778 INFO L226 Difference]: Without dead ends: 1552 [2024-11-19 06:24:04,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:24:04,778 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 4 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:24:04,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1541 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:24:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-11-19 06:24:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2024-11-19 06:24:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1528 states have (on average 1.3200261780104712) internal successors, (2017), 1535 states have internal predecessors, (2017), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 06:24:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2053 transitions. [2024-11-19 06:24:04,797 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2053 transitions. Word has length 854 [2024-11-19 06:24:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:24:04,798 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2053 transitions. [2024-11-19 06:24:04,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 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-19 06:24:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2053 transitions. [2024-11-19 06:24:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2024-11-19 06:24:04,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:24:04,802 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, 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-19 06:24:04,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:24:04,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:24:04,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:24:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -517663136, now seen corresponding path program 1 times [2024-11-19 06:24:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:24:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514577909] [2024-11-19 06:24:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:24:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms