./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 724878768076b8192fcddec982755d081255c76c80e1e283d808e6a7ebb222b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:24:14,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:24:14,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:24:14,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:24:14,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:24:14,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:24:14,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:24:14,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:24:14,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:24:14,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:24:14,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:24:14,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:24:14,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:24:14,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:24:14,991 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:24:14,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:24:14,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:24:14,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:24:14,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:24:14,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:24:14,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:24:14,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:24:14,996 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:24:14,996 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:24:14,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:24:14,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:24:14,997 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:24:14,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:24:14,998 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:24:14,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:24:14,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:24:14,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:24:14,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:24:15,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:24:15,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:24:15,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:24:15,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:24:15,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:24:15,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:24:15,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:24:15,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:24:15,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:24:15,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:24:15,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:24:15,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:24:15,003 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-clean/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-clean/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 -> 724878768076b8192fcddec982755d081255c76c80e1e283d808e6a7ebb222b9 [2024-10-11 17:24:15,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:24:15,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:24:15,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:24:15,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:24:15,291 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:24:15,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2024-10-11 17:24:16,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:24:17,005 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:24:17,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2024-10-11 17:24:17,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/90208e056/e3b24a8d595e4e499be30fd8ff5ab804/FLAGa2d3d2302 [2024-10-11 17:24:17,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/90208e056/e3b24a8d595e4e499be30fd8ff5ab804 [2024-10-11 17:24:17,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:24:17,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:24:17,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:24:17,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:24:17,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:24:17,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c914f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17, skipping insertion in model container [2024-10-11 17:24:17,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:24:17,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:24:17,658 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:24:17,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:24:17,767 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:24:17,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17 WrapperNode [2024-10-11 17:24:17,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:24:17,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:24:17,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:24:17,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:24:17,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,836 INFO L138 Inliner]: procedures = 129, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-10-11 17:24:17,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:24:17,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:24:17,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:24:17,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:24:17,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,868 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 5, 6]. 46 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 4 writes are split as follows [0, 1, 3]. [2024-10-11 17:24:17,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:24:17,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:24:17,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:24:17,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:24:17,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (1/1) ... [2024-10-11 17:24:17,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:24:17,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:17,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:24:17,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:24:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 17:24:17,969 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 17:24:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2024-10-11 17:24:17,970 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:24:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:24:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:24:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:24:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:24:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:24:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:24:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:24:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:24:17,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:24:18,086 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:24:18,088 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:24:18,110 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 17:24:18,324 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-11 17:24:18,324 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:24:18,361 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:24:18,361 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 17:24:18,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:18 BoogieIcfgContainer [2024-10-11 17:24:18,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:24:18,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:24:18,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:24:18,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:24:18,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:24:17" (1/3) ... [2024-10-11 17:24:18,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba9a645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:18, skipping insertion in model container [2024-10-11 17:24:18,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:17" (2/3) ... [2024-10-11 17:24:18,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba9a645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:18, skipping insertion in model container [2024-10-11 17:24:18,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:18" (3/3) ... [2024-10-11 17:24:18,370 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2024-10-11 17:24:18,386 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:24:18,386 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:24:18,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:24:18,430 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;@59e458c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:24:18,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:24:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 39 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:24:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:24:18,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:18,444 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:18,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:18,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash -237623695, now seen corresponding path program 1 times [2024-10-11 17:24:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:18,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494201250] [2024-10-11 17:24:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:18,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 17:24:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:24:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:18,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494201250] [2024-10-11 17:24:18,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494201250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:18,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:24:18,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:24:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747710429] [2024-10-11 17:24:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:18,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:24:18,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:18,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:24:18,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:24:18,699 INFO L87 Difference]: Start difference. First operand has 45 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 39 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:18,733 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2024-10-11 17:24:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:24:18,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-11 17:24:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:18,741 INFO L225 Difference]: With dead ends: 44 [2024-10-11 17:24:18,741 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 17:24:18,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-10-11 17:24:18,745 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:18,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:24:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 17:24:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 17:24:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:24:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-10-11 17:24:18,787 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 22 [2024-10-11 17:24:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:18,788 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-10-11 17:24:18,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-10-11 17:24:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:24:18,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:18,789 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:18,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:24:18,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash 182361183, now seen corresponding path program 1 times [2024-10-11 17:24:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:18,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633652042] [2024-10-11 17:24:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:18,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 17:24:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:24:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633652042] [2024-10-11 17:24:19,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633652042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:19,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460118439] [2024-10-11 17:24:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:19,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:19,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:19,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:24:19,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:24:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:19,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 17:24:19,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:24:19,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:24:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460118439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:19,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:24:19,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-10-11 17:24:19,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781775228] [2024-10-11 17:24:19,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:19,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:24:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:19,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:24:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:24:19,537 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:19,629 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-10-11 17:24:19,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:24:19,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-11 17:24:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:19,630 INFO L225 Difference]: With dead ends: 41 [2024-10-11 17:24:19,631 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 17:24:19,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:24:19,634 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:19,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 204 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 17:24:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 17:24:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:24:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-10-11 17:24:19,641 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 29 [2024-10-11 17:24:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:19,643 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-10-11 17:24:19,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-10-11 17:24:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 17:24:19,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:19,644 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:19,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:24:19,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:19,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:19,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:19,847 INFO L85 PathProgramCache]: Analyzing trace with hash 261469062, now seen corresponding path program 1 times [2024-10-11 17:24:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:19,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982254577] [2024-10-11 17:24:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:24:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:24:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982254577] [2024-10-11 17:24:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982254577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:24:20,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:24:20,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295338651] [2024-10-11 17:24:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:20,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:24:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:20,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:24:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:24:20,103 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:24:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:20,219 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2024-10-11 17:24:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:24:20,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-10-11 17:24:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:20,222 INFO L225 Difference]: With dead ends: 64 [2024-10-11 17:24:20,222 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 17:24:20,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:24:20,223 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:20,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 192 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 17:24:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-10-11 17:24:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 17:24:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-10-11 17:24:20,235 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 33 [2024-10-11 17:24:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:20,235 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-10-11 17:24:20,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:24:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-10-11 17:24:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 17:24:20,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:20,238 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:20,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:24:20,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:20,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash -547877564, now seen corresponding path program 1 times [2024-10-11 17:24:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:20,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860601322] [2024-10-11 17:24:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:24:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:24:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860601322] [2024-10-11 17:24:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860601322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:20,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:24:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:24:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809106603] [2024-10-11 17:24:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:20,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:24:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:20,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:24:20,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:24:20,364 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:20,441 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2024-10-11 17:24:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:24:20,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-11 17:24:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:20,442 INFO L225 Difference]: With dead ends: 73 [2024-10-11 17:24:20,443 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 17:24:20,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:24:20,444 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:20,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 177 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 17:24:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-10-11 17:24:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.280701754385965) internal successors, (73), 58 states have internal predecessors, (73), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 17:24:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2024-10-11 17:24:20,451 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 33 [2024-10-11 17:24:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:20,452 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2024-10-11 17:24:20,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2024-10-11 17:24:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 17:24:20,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:20,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:20,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:24:20,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:20,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash 203880407, now seen corresponding path program 1 times [2024-10-11 17:24:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924346830] [2024-10-11 17:24:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 17:24:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:24:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924346830] [2024-10-11 17:24:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924346830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596112982] [2024-10-11 17:24:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:20,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:20,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:24:20,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:24:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:20,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 17:24:20,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:24:20,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:24:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:24:20,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596112982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:24:20,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:24:20,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2024-10-11 17:24:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728540760] [2024-10-11 17:24:20,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:24:20,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:24:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:24:20,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:24:20,982 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 15 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 17:24:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:21,185 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2024-10-11 17:24:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:24:21,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-10-11 17:24:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:21,187 INFO L225 Difference]: With dead ends: 81 [2024-10-11 17:24:21,187 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 17:24:21,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:24:21,188 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 27 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:21,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 299 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 17:24:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2024-10-11 17:24:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 62 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 17:24:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2024-10-11 17:24:21,202 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 34 [2024-10-11 17:24:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:21,202 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2024-10-11 17:24:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 17:24:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-10-11 17:24:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 17:24:21,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:21,203 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:21,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:24:21,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:21,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:21,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash -472694512, now seen corresponding path program 2 times [2024-10-11 17:24:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:21,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176683539] [2024-10-11 17:24:21,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 17:24:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:24:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176683539] [2024-10-11 17:24:21,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176683539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348844953] [2024-10-11 17:24:21,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:24:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:21,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:21,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:24:21,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:24:21,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:24:21,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:24:21,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 17:24:21,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:21,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:24:21,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-10-11 17:24:21,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-10-11 17:24:21,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 17:24:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:24:21,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:24:21,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 17:24:21,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-11 17:24:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:24:21,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348844953] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:24:21,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:24:21,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 9 [2024-10-11 17:24:21,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221184837] [2024-10-11 17:24:21,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:24:21,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:24:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:21,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:24:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:24:21,973 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:24:26,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:30,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:34,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:38,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:42,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:46,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:50,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:54,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:54,244 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2024-10-11 17:24:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:24:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 17:24:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:54,248 INFO L225 Difference]: With dead ends: 106 [2024-10-11 17:24:54,248 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 17:24:54,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:24:54,249 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:54,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 300 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2024-10-11 17:24:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 17:24:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2024-10-11 17:24:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 74 states have internal predecessors, (92), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 17:24:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2024-10-11 17:24:54,257 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 38 [2024-10-11 17:24:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:54,257 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2024-10-11 17:24:54,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:24:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2024-10-11 17:24:54,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 17:24:54,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:54,259 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:54,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:24:54,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:54,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:54,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:54,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1760412277, now seen corresponding path program 3 times [2024-10-11 17:24:54,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:54,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143677227] [2024-10-11 17:24:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:54,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:54,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:54,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 17:24:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:24:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143677227] [2024-10-11 17:24:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143677227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875104633] [2024-10-11 17:24:54,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:24:54,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:54,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:24:54,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:24:55,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:24:55,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:24:55,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 17:24:55,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 17:24:55,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:24:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:24:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875104633] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:24:55,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:24:55,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 24 [2024-10-11 17:24:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982147616] [2024-10-11 17:24:55,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:24:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 17:24:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:55,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 17:24:55,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:24:55,375 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 24 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 17:24:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:55,649 INFO L93 Difference]: Finished difference Result 162 states and 216 transitions. [2024-10-11 17:24:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:24:55,650 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-10-11 17:24:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:55,652 INFO L225 Difference]: With dead ends: 162 [2024-10-11 17:24:55,652 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 17:24:55,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-10-11 17:24:55,654 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 50 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:55,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 525 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:24:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 17:24:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 110. [2024-10-11 17:24:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 100 states have internal predecessors, (122), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:24:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2024-10-11 17:24:55,676 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 39 [2024-10-11 17:24:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:55,676 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2024-10-11 17:24:55,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 17:24:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2024-10-11 17:24:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 17:24:55,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:55,678 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:55,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:24:55,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 17:24:55,883 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:55,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1260470870, now seen corresponding path program 1 times [2024-10-11 17:24:55,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526328830] [2024-10-11 17:24:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 17:24:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:24:56,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:56,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526328830] [2024-10-11 17:24:56,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526328830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:56,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727773561] [2024-10-11 17:24:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:56,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:56,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:56,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:24:56,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:24:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:56,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 17:24:56,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:56,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 17:24:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:24:56,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:24:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727773561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:56,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:24:56,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-10-11 17:24:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481422349] [2024-10-11 17:24:56,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:56,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:24:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:56,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:24:56,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:24:56,231 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:25:00,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:25:04,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:25:08,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:25:12,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:25:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:25:12,358 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2024-10-11 17:25:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:25:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-10-11 17:25:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:25:12,362 INFO L225 Difference]: With dead ends: 132 [2024-10-11 17:25:12,362 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 17:25:12,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:25:12,363 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:25:12,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 234 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-10-11 17:25:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 17:25:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2024-10-11 17:25:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 109 states have internal predecessors, (135), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-11 17:25:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2024-10-11 17:25:12,378 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 40 [2024-10-11 17:25:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:25:12,379 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2024-10-11 17:25:12,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:25:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2024-10-11 17:25:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 17:25:12,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:25:12,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:25:12,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 17:25:12,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:25:12,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:25:12,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:25:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1270009968, now seen corresponding path program 4 times [2024-10-11 17:25:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:25:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259966509] [2024-10-11 17:25:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:25:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:25:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:13,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:25:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:13,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 17:25:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:25:13,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:25:13,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259966509] [2024-10-11 17:25:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259966509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:25:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92494668] [2024-10-11 17:25:13,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:25:13,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:25:13,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:25:13,114 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:25:13,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:25:13,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:25:13,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:25:13,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 17:25:13,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:25:13,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-11 17:25:13,279 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-10-11 17:25:13,284 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-10-11 17:25:13,333 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:25:13,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 17:25:13,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-11 17:25:13,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 17:25:13,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-10-11 17:25:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:25:13,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:25:13,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2024-10-11 17:25:13,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2024-10-11 17:25:18,039 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) 0))))) is different from false [2024-10-11 17:25:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2024-10-11 17:25:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92494668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:25:18,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:25:18,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 22 [2024-10-11 17:25:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366588058] [2024-10-11 17:25:18,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:25:18,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:25:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:25:18,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:25:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=368, Unknown=1, NotChecked=38, Total=462 [2024-10-11 17:25:18,282 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:25:22,361 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) 0)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2024-10-11 17:25:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:25:22,815 INFO L93 Difference]: Finished difference Result 186 states and 231 transitions. [2024-10-11 17:25:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:25:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2024-10-11 17:25:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:25:22,816 INFO L225 Difference]: With dead ends: 186 [2024-10-11 17:25:22,817 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 17:25:22,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=77, Invalid=481, Unknown=2, NotChecked=90, Total=650 [2024-10-11 17:25:22,818 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:25:22,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 565 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 385 Invalid, 0 Unknown, 100 Unchecked, 0.4s Time] [2024-10-11 17:25:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 17:25:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 164. [2024-10-11 17:25:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 146 states have (on average 1.2465753424657535) internal successors, (182), 149 states have internal predecessors, (182), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 17:25:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 208 transitions. [2024-10-11 17:25:22,828 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 208 transitions. Word has length 40 [2024-10-11 17:25:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:25:22,829 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 208 transitions. [2024-10-11 17:25:22,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:25:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 208 transitions. [2024-10-11 17:25:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 17:25:22,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:25:22,831 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:25:22,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:25:23,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 17:25:23,035 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:25:23,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:25:23,035 INFO L85 PathProgramCache]: Analyzing trace with hash 419944873, now seen corresponding path program 1 times [2024-10-11 17:25:23,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:25:23,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960724791] [2024-10-11 17:25:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:25:23,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:25:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:23,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:25:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 17:25:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:25:23,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:25:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960724791] [2024-10-11 17:25:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960724791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:25:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385133148] [2024-10-11 17:25:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:25:23,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:25:23,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:25:23,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:25:23,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:25:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:23,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:25:23,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:25:23,420 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 15 treesize of output 1 [2024-10-11 17:25:23,428 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-10-11 17:25:23,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 17:25:23,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-10-11 17:25:23,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 17:25:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:25:23,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:25:23,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-10-11 17:25:23,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-11 17:25:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:25:24,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385133148] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:25:24,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:25:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 22 [2024-10-11 17:25:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079825855] [2024-10-11 17:25:24,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:25:24,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:25:24,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:25:24,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:25:24,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:25:24,018 INFO L87 Difference]: Start difference. First operand 164 states and 208 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 17:25:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:25:24,545 INFO L93 Difference]: Finished difference Result 183 states and 229 transitions. [2024-10-11 17:25:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:25:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2024-10-11 17:25:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:25:24,547 INFO L225 Difference]: With dead ends: 183 [2024-10-11 17:25:24,547 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 17:25:24,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2024-10-11 17:25:24,548 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 70 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:25:24,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 593 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:25:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 17:25:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2024-10-11 17:25:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 154 states have internal predecessors, (189), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 17:25:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 215 transitions. [2024-10-11 17:25:24,556 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 215 transitions. Word has length 41 [2024-10-11 17:25:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:25:24,557 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 215 transitions. [2024-10-11 17:25:24,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 17:25:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2024-10-11 17:25:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 17:25:24,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:25:24,558 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:25:24,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 17:25:24,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:25:24,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:25:24,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:25:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash 133442742, now seen corresponding path program 2 times [2024-10-11 17:25:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:25:24,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470298255] [2024-10-11 17:25:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:25:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:25:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:25:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 17:25:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:25:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:25:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:25:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470298255] [2024-10-11 17:25:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470298255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:25:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78466143] [2024-10-11 17:25:25,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:25:25,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:25:25,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:25:25,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:25:25,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:25:25,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:25:25,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:25:25,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 17:25:25,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:25:25,686 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 17:25:25,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-10-11 17:25:26,341 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 15 treesize of output 1 [2024-10-11 17:25:27,302 INFO L349 Elim1Store]: treesize reduction 494, result has 19.1 percent of original size [2024-10-11 17:25:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1331 treesize of output 1522 [2024-10-11 17:25:28,038 INFO L349 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2024-10-11 17:25:28,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 571 [2024-10-11 17:25:28,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:25:28,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:25:28,126 INFO L349 Elim1Store]: treesize reduction 124, result has 34.0 percent of original size [2024-10-11 17:25:28,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 489 treesize of output 539 [2024-10-11 17:25:28,235 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-10-11 17:25:28,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 53 [2024-10-11 17:25:47,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:25:47,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 819 treesize of output 703 [2024-10-11 17:25:47,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:25:47,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 185 treesize of output 409