./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_of_sll_nondet_append-2.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_of_sll_nondet_append-2.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 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:24:18,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:24:18,114 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:18,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:24:18,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:24:18,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:24:18,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:24:18,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:24:18,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:24:18,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:24:18,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:24:18,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:24:18,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:24:18,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:24:18,150 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:24:18,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:24:18,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:24:18,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:24:18,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:24:18,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:24:18,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:24:18,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:24:18,152 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:24:18,152 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:24:18,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:24:18,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:24:18,153 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:24:18,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:24:18,153 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:24:18,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:24:18,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:24:18,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:24:18,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:24:18,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:24:18,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:24:18,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:24:18,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:24:18,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:24:18,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:24:18,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:24:18,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:24:18,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:24:18,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:24:18,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:24:18,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:24:18,157 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2024-10-11 17:24:18,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:24:18,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:24:18,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:24:18,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:24:18,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:24:18,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2024-10-11 17:24:19,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:24:19,851 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:24:19,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2024-10-11 17:24:19,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3fb771a6a/654160547a9441e790fa3cfacec5b66c/FLAG6737fd9c6 [2024-10-11 17:24:19,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3fb771a6a/654160547a9441e790fa3cfacec5b66c [2024-10-11 17:24:19,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:24:19,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:24:19,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:24:19,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:24:19,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:24:19,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:19" (1/1) ... [2024-10-11 17:24:19,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43525e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:19, skipping insertion in model container [2024-10-11 17:24:19,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:19" (1/1) ... [2024-10-11 17:24:19,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:24:20,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:24:20,160 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:24:20,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:24:20,268 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:24:20,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:20 WrapperNode [2024-10-11 17:24:20,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:24:20,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:24:20,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:24:20,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:24:20,277 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:20" (1/1) ... [2024-10-11 17:24:20,287 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:20" (1/1) ... [2024-10-11 17:24:20,309 INFO L138 Inliner]: procedures = 129, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 186 [2024-10-11 17:24:20,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:24:20,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:24:20,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:24:20,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:24:20,319 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:20" (1/1) ... [2024-10-11 17:24:20,319 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:20" (1/1) ... [2024-10-11 17:24:20,323 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:20" (1/1) ... [2024-10-11 17:24:20,342 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-10-11 17:24:20,342 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:20" (1/1) ... [2024-10-11 17:24:20,343 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:20" (1/1) ... [2024-10-11 17:24:20,350 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:20" (1/1) ... [2024-10-11 17:24:20,354 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:20" (1/1) ... [2024-10-11 17:24:20,355 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:20" (1/1) ... [2024-10-11 17:24:20,356 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:20" (1/1) ... [2024-10-11 17:24:20,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:24:20,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:24:20,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:24:20,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:24:20,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:20" (1/1) ... [2024-10-11 17:24:20,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:24:20,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:20,393 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:20,395 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:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 17:24:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 17:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:24:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2024-10-11 17:24:20,452 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2024-10-11 17:24:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:24:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:24:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:24:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:24:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:24:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:24:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:24:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:24:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:24:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:24:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:24:20,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:24:20,589 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:24:20,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:24:20,611 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 17:24:20,815 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-11 17:24:20,819 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:24:20,850 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:24:20,852 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-11 17:24:20,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:20 BoogieIcfgContainer [2024-10-11 17:24:20,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:24:20,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:24:20,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:24:20,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:24:20,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:24:19" (1/3) ... [2024-10-11 17:24:20,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac47b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:20, skipping insertion in model container [2024-10-11 17:24:20,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:20" (2/3) ... [2024-10-11 17:24:20,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac47b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:20, skipping insertion in model container [2024-10-11 17:24:20,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:20" (3/3) ... [2024-10-11 17:24:20,859 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2024-10-11 17:24:20,873 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:24:20,873 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:24:20,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:24:20,919 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;@2e1d770b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:24:20,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:24:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:24:20,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:20,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:20,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:20,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1849334703, now seen corresponding path program 1 times [2024-10-11 17:24:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686474801] [2024-10-11 17:24:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:21,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 17:24:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:24:21,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:21,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686474801] [2024-10-11 17:24:21,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686474801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:21,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:24:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:24:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000766804] [2024-10-11 17:24:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:21,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:24:21,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:21,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:24:21,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:24:21,321 INFO L87 Difference]: Start difference. First operand has 49 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:24:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:21,417 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2024-10-11 17:24:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:24:21,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 17:24:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:21,424 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:24:21,425 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 17:24:21,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:24:21,429 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:21,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 17:24:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2024-10-11 17:24:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 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:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2024-10-11 17:24:21,457 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 17 [2024-10-11 17:24:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:21,457 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-10-11 17:24:21,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:24:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2024-10-11 17:24:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:24:21,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:21,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:21,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:24:21,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:21,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -98634229, now seen corresponding path program 1 times [2024-10-11 17:24:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:21,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734616966] [2024-10-11 17:24:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:21,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:24:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:24:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734616966] [2024-10-11 17:24:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734616966] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191972656] [2024-10-11 17:24:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:21,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:21,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:21,824 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:21,826 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:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:21,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:24:21,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:24:22,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:24:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:24:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191972656] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:24:22,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:24:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 4] total 12 [2024-10-11 17:24:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598402705] [2024-10-11 17:24:22,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:24:22,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:24:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:24:22,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:24:22,082 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:24:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:22,344 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2024-10-11 17:24:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:24:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-10-11 17:24:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:22,346 INFO L225 Difference]: With dead ends: 85 [2024-10-11 17:24:22,347 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 17:24:22,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:24:22,349 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:22,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 419 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:24:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 17:24:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2024-10-11 17:24:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 17:24:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2024-10-11 17:24:22,362 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 22 [2024-10-11 17:24:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:22,363 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2024-10-11 17:24:22,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:24:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-10-11 17:24:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 17:24:22,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:22,365 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:22,379 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:22,568 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:22,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:22,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1420656401, now seen corresponding path program 1 times [2024-10-11 17:24:22,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:22,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052033803] [2024-10-11 17:24:22,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:22,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 17:24:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 17:24:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052033803] [2024-10-11 17:24:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052033803] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738847695] [2024-10-11 17:24:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:22,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:22,855 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:22,858 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:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:22,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:24:22,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:24:23,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:24:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:24:23,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738847695] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:24:23,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:24:23,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-10-11 17:24:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992772886] [2024-10-11 17:24:23,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:24:23,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:24:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:24:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:24:23,198 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:23,301 INFO L93 Difference]: Finished difference Result 87 states and 121 transitions. [2024-10-11 17:24:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:24:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-10-11 17:24:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:23,303 INFO L225 Difference]: With dead ends: 87 [2024-10-11 17:24:23,303 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 17:24:23,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:24:23,304 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:23,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 396 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 17:24:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-11 17:24:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 77 states have internal predecessors, (102), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 17:24:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-10-11 17:24:23,311 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 35 [2024-10-11 17:24:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:23,312 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-10-11 17:24:23,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-10-11 17:24:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 17:24:23,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:23,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:23,328 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:23,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:23,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:23,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1189424971, now seen corresponding path program 2 times [2024-10-11 17:24:23,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:23,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356594454] [2024-10-11 17:24:23,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:23,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 17:24:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 17:24:23,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:23,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356594454] [2024-10-11 17:24:23,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356594454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:23,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356300567] [2024-10-11 17:24:23,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:24:23,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:23,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:23,795 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:23,798 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:23,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:24:23,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:24:23,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 17:24:23,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:23,994 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:24,026 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:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 17:24:24,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:24:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356300567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:24,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:24:24,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2024-10-11 17:24:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630099821] [2024-10-11 17:24:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:24,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:24:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:24:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:24:24,042 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:24:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:24,155 INFO L93 Difference]: Finished difference Result 176 states and 258 transitions. [2024-10-11 17:24:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:24:24,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-10-11 17:24:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:24,158 INFO L225 Difference]: With dead ends: 176 [2024-10-11 17:24:24,158 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 17:24:24,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:24:24,159 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 78 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:24,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 331 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 17:24:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 155. [2024-10-11 17:24:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 142 states have internal predecessors, (188), 10 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-11 17:24:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2024-10-11 17:24:24,176 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 38 [2024-10-11 17:24:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:24,177 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2024-10-11 17:24:24,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:24:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2024-10-11 17:24:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 17:24:24,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:24,181 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:24,194 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:24,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:24,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1189773065, now seen corresponding path program 1 times [2024-10-11 17:24:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710542278] [2024-10-11 17:24:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:24,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 17:24:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:24:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710542278] [2024-10-11 17:24:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710542278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514032529] [2024-10-11 17:24:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:24,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:24,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:24,543 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:24,544 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:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:24,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 17:24:24,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:24:24,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:24:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:24:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514032529] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:24:24,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:24:24,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-10-11 17:24:24,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888253035] [2024-10-11 17:24:24,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:24:24,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:24:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:24,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:24:24,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:24:24,931 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 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:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:25,090 INFO L93 Difference]: Finished difference Result 231 states and 363 transitions. [2024-10-11 17:24:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:24:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 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 38 [2024-10-11 17:24:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:25,092 INFO L225 Difference]: With dead ends: 231 [2024-10-11 17:24:25,092 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 17:24:25,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:24:25,093 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 62 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:25,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 336 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 17:24:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 161. [2024-10-11 17:24:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 143 states have (on average 1.3706293706293706) internal successors, (196), 148 states have internal predecessors, (196), 10 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-11 17:24:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 239 transitions. [2024-10-11 17:24:25,109 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 239 transitions. Word has length 38 [2024-10-11 17:24:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:25,110 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 239 transitions. [2024-10-11 17:24:25,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 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:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 239 transitions. [2024-10-11 17:24:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:24:25,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:25,111 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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:25,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:24:25,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:25,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:25,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1305822769, now seen corresponding path program 1 times [2024-10-11 17:24:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:25,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707254956] [2024-10-11 17:24:25,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:25,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 17:24:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 17:24:25,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:25,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707254956] [2024-10-11 17:24:25,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707254956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:25,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:24:25,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:24:25,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437729579] [2024-10-11 17:24:25,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:25,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:24:25,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:25,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:24:25,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:24:25,518 INFO L87 Difference]: Start difference. First operand 161 states and 239 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:24:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:25,716 INFO L93 Difference]: Finished difference Result 306 states and 448 transitions. [2024-10-11 17:24:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:24:25,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:24:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:25,719 INFO L225 Difference]: With dead ends: 306 [2024-10-11 17:24:25,719 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 17:24:25,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:24:25,720 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 70 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:25,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 450 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:24:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 17:24:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 241. [2024-10-11 17:24:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 211 states have (on average 1.3364928909952607) internal successors, (282), 223 states have internal predecessors, (282), 19 states have call successors, (19), 4 states have call predecessors, (19), 9 states have return successors, (60), 13 states have call predecessors, (60), 19 states have call successors, (60) [2024-10-11 17:24:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2024-10-11 17:24:25,751 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 44 [2024-10-11 17:24:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:25,752 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2024-10-11 17:24:25,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:24:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2024-10-11 17:24:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:24:25,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:25,755 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 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:25,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:24:25,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:25,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -521753463, now seen corresponding path program 1 times [2024-10-11 17:24:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:25,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547974432] [2024-10-11 17:24:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 17:24:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 17:24:26,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547974432] [2024-10-11 17:24:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547974432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:26,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:24:26,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:24:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812725929] [2024-10-11 17:24:26,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:26,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:24:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:26,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:24:26,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:24:26,365 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:24:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:26,634 INFO L93 Difference]: Finished difference Result 307 states and 465 transitions. [2024-10-11 17:24:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:24:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-10-11 17:24:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:26,636 INFO L225 Difference]: With dead ends: 307 [2024-10-11 17:24:26,636 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 17:24:26,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:24:26,637 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:26,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 477 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:24:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 17:24:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 255. [2024-10-11 17:24:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 225 states have (on average 1.3377777777777777) internal successors, (301), 236 states have internal predecessors, (301), 19 states have call successors, (19), 4 states have call predecessors, (19), 9 states have return successors, (60), 14 states have call predecessors, (60), 19 states have call successors, (60) [2024-10-11 17:24:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 380 transitions. [2024-10-11 17:24:26,658 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 380 transitions. Word has length 47 [2024-10-11 17:24:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:26,658 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 380 transitions. [2024-10-11 17:24:26,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:24:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 380 transitions. [2024-10-11 17:24:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:24:26,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:26,662 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:26,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:24:26,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:26,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1097564679, now seen corresponding path program 1 times [2024-10-11 17:24:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:26,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544326812] [2024-10-11 17:24:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 17:24:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 17:24:27,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544326812] [2024-10-11 17:24:27,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544326812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413986351] [2024-10-11 17:24:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:27,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:27,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:27,830 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:27,831 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:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:27,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-11 17:24:27,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:27,976 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:24:28,017 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 17:24:28,018 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 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 17:24:28,057 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 17:24:28,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 17:24:28,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:24:28,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:24:28,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:28,247 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 18 treesize of output 7 [2024-10-11 17:24:28,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-11 17:24:28,298 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:24:28,308 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:24:28,379 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 66 treesize of output 42 [2024-10-11 17:24:28,431 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 7 treesize of output 3 [2024-10-11 17:24:28,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:24:28,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 22 [2024-10-11 17:24:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 17:24:28,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:24:28,843 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 114 treesize of output 106 [2024-10-11 17:24:28,849 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 66 treesize of output 58 [2024-10-11 17:24:28,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:24:28,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:24:28,916 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 228 treesize of output 222 [2024-10-11 17:24:29,147 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:24:29,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:24:29,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1339 treesize of output 1170 [2024-10-11 17:24:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 17:24:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413986351] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:24:30,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:24:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 34 [2024-10-11 17:24:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773587090] [2024-10-11 17:24:30,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:24:30,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 17:24:30,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:30,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 17:24:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 17:24:30,656 INFO L87 Difference]: Start difference. First operand 255 states and 380 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 30 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:24:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:31,458 INFO L93 Difference]: Finished difference Result 325 states and 494 transitions. [2024-10-11 17:24:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 17:24:31,459 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 30 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-10-11 17:24:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:31,461 INFO L225 Difference]: With dead ends: 325 [2024-10-11 17:24:31,461 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 17:24:31,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=1602, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 17:24:31,462 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 92 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:31,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 857 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:24:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 17:24:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 256. [2024-10-11 17:24:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 226 states have (on average 1.336283185840708) internal successors, (302), 237 states have internal predecessors, (302), 19 states have call successors, (19), 4 states have call predecessors, (19), 9 states have return successors, (60), 14 states have call predecessors, (60), 19 states have call successors, (60) [2024-10-11 17:24:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2024-10-11 17:24:31,470 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 48 [2024-10-11 17:24:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:31,470 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2024-10-11 17:24:31,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 30 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:24:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2024-10-11 17:24:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:24:31,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:31,472 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 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:31,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:24:31,676 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:24:31,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:31,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1767843191, now seen corresponding path program 2 times [2024-10-11 17:24:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393579066] [2024-10-11 17:24:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:32,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 17:24:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:24:33,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:33,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393579066] [2024-10-11 17:24:33,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393579066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:33,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971825728] [2024-10-11 17:24:33,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:24:33,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:33,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:33,123 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:24:33,124 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:24:33,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:24:33,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:24:33,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 17:24:33,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:33,260 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:24:33,292 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 17:24:33,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 17:24:33,356 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 17:24:33,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 17:24:33,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:33,487 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 17:24:33,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 17:24:33,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:24:33,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-10-11 17:24:33,656 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-11 17:24:33,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 49 [2024-10-11 17:24:33,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-10-11 17:24:33,727 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:24:33,735 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:24:33,852 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 140 treesize of output 92 [2024-10-11 17:24:33,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-10-11 17:24:34,045 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-10-11 17:24:34,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 37 [2024-10-11 17:24:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:24:34,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:24:34,542 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 436 treesize of output 404 [2024-10-11 17:24:34,548 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 540 treesize of output 476 [2024-10-11 17:24:38,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse4 (= |c_sll_append_~head#1.base| |c_sll_append_#in~head#1.base|)) (.cse3 (= |c_sll_append_~head#1.offset| |c_sll_append_#in~head#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#2.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base|) .cse10 |c_sll_append_sll_create_~head~0#1.offset|) |c_sll_append_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse0 (store |c_#memory_$Pointer$#2.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base|) .cse10 |c_sll_append_sll_create_~head~0#1.base|) |c_sll_append_node_create_with_sublist_~new_node~0#1.offset| 0)))) (and (let ((.cse1 (select (select .cse0 |c_sll_append_sll_create_~head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|)) (.cse2 (select (select .cse5 |c_sll_append_sll_create_~head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (not .cse3) (and (= .cse1 0) (= .cse2 0)) (not .cse4))) (or (and .cse3 .cse4) (let ((.cse7 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse28 (+ 4 v_arrayElimCell_40))) (let ((.cse26 (select (select .cse0 v_arrayElimCell_39) .cse28)) (.cse27 (select (select .cse5 v_arrayElimCell_39) .cse28))) (let ((.cse25 (select (select .cse0 .cse26) .cse27))) (or (not (= (select (select .cse0 .cse25) (select (select .cse5 .cse26) .cse27)) 0)) (= .cse25 0))))))) (.cse6 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse24 (+ 4 v_arrayElimCell_40))) (let ((.cse22 (select (select .cse0 v_arrayElimCell_39) .cse24)) (.cse23 (select (select .cse5 v_arrayElimCell_39) .cse24))) (let ((.cse21 (select (select .cse5 .cse22) .cse23))) (or (= .cse21 0) (not (= (select (select .cse0 (select (select .cse0 .cse22) .cse23)) .cse21) 0))))))))) (and (or .cse6 .cse4) (or .cse7 .cse3) (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse11 (select .cse5 v_arrayElimCell_39)) (.cse9 (select .cse0 v_arrayElimCell_39)) (.cse14 (+ 4 v_arrayElimCell_40))) (let ((.cse12 (select .cse9 .cse14)) (.cse13 (select .cse11 .cse14))) (let ((.cse8 (select (select .cse5 .cse12) .cse13))) (or (= .cse8 0) (= (select (select .cse5 (select .cse9 .cse10)) (select .cse11 .cse10)) 0) (not (= (select (select .cse0 (select (select .cse0 .cse12) .cse13)) .cse8) 0))))))) (or .cse7 .cse4) (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse16 (select .cse5 v_arrayElimCell_39)) (.cse15 (select .cse0 v_arrayElimCell_39)) (.cse20 (+ 4 v_arrayElimCell_40))) (let ((.cse18 (select .cse15 .cse20)) (.cse19 (select .cse16 .cse20))) (let ((.cse17 (select (select .cse0 .cse18) .cse19))) (or (= (select (select .cse0 (select .cse15 .cse10)) (select .cse16 .cse10)) 0) (not (= (select (select .cse0 .cse17) (select (select .cse5 .cse18) .cse19)) 0)) (= .cse17 0)))))) (or .cse6 .cse3))))))) is different from false [2024-10-11 17:24:39,738 INFO L349 Elim1Store]: treesize reduction 648, result has 62.3 percent of original size [2024-10-11 17:24:39,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 981826 treesize of output 923888 [2024-10-11 17:24:51,640 WARN L286 SmtUtils]: Spent 11.90s on a formula simplification. DAG size of input: 1276 DAG size of output: 787 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)