./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:12:12,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:12:12,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:12:12,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:12:12,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:12:12,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:12:12,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:12:12,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:12:12,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:12:12,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:12:12,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:12:12,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:12:12,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:12:12,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:12:12,337 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:12:12,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:12:12,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:12:12,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:12:12,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:12:12,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:12:12,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:12:12,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:12:12,339 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:12:12,339 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:12:12,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:12:12,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:12:12,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:12:12,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:12:12,340 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:12:12,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:12:12,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:12:12,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:12:12,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:12:12,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:12:12,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:12:12,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:12:12,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:12:12,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:12:12,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:12:12,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:12:12,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:12:12,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:12:12,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:12:12,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:12:12,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:12:12,344 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2024-11-09 07:12:12,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:12:12,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:12:12,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:12:12,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:12:12,563 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:12:12,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2024-11-09 07:12:13,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:12:13,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:12:13,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2024-11-09 07:12:13,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca14459a3/5071f19b9c1d43798e3c1f9002372919/FLAG94f71eb6f [2024-11-09 07:12:14,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca14459a3/5071f19b9c1d43798e3c1f9002372919 [2024-11-09 07:12:14,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:12:14,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:12:14,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:12:14,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:12:14,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:12:14,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf1316b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14, skipping insertion in model container [2024-11-09 07:12:14,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:12:14,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:12:14,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:12:14,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:12:14,392 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:12:14,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14 WrapperNode [2024-11-09 07:12:14,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:12:14,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:12:14,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:12:14,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:12:14,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,437 INFO L138 Inliner]: procedures = 129, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 186 [2024-11-09 07:12:14,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:12:14,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:12:14,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:12:14,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:12:14,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,469 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-11-09 07:12:14,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:12:14,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:12:14,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:12:14,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:12:14,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (1/1) ... [2024-11-09 07:12:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:12:14,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:12:14,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:12:14,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:12:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 07:12:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 07:12:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:12:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:12:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:12:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:12:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:12:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:12:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2024-11-09 07:12:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2024-11-09 07:12:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:12:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:12:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:12:14,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:12:14,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:12:14,748 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 07:12:14,931 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-09 07:12:14,932 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:12:14,945 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:12:14,946 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 07:12:14,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:12:14 BoogieIcfgContainer [2024-11-09 07:12:14,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:12:14,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:12:14,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:12:14,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:12:14,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:12:14" (1/3) ... [2024-11-09 07:12:14,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5695c0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:12:14, skipping insertion in model container [2024-11-09 07:12:14,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:12:14" (2/3) ... [2024-11-09 07:12:14,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5695c0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:12:14, skipping insertion in model container [2024-11-09 07:12:14,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:12:14" (3/3) ... [2024-11-09 07:12:14,951 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2024-11-09 07:12:14,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:12:14,967 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:12:15,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:12:15,018 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;@17f5cae0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:12:15,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:12:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 50 states have internal predecessors, (76), 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-11-09 07:12:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:12:15,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:15,031 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] [2024-11-09 07:12:15,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:15,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash -165227221, now seen corresponding path program 1 times [2024-11-09 07:12:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815118171] [2024-11-09 07:12:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:15,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 07:12:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:12:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:15,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815118171] [2024-11-09 07:12:15,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815118171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:12:15,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:12:15,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:12:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295151919] [2024-11-09 07:12:15,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:12:15,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:12:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:15,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:12:15,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:12:15,338 INFO L87 Difference]: Start difference. First operand has 55 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 50 states have internal predecessors, (76), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11-09 07:12:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:15,415 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2024-11-09 07:12:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:12:15,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 20 [2024-11-09 07:12:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:15,423 INFO L225 Difference]: With dead ends: 54 [2024-11-09 07:12:15,424 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 07:12:15,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:12:15,430 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:15,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:12:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 07:12:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 07:12:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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-11-09 07:12:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-11-09 07:12:15,466 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2024-11-09 07:12:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:15,467 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-11-09 07:12:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11-09 07:12:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-11-09 07:12:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:12:15,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:15,470 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] [2024-11-09 07:12:15,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:12:15,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:15,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash -939358433, now seen corresponding path program 1 times [2024-11-09 07:12:15,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:15,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466273414] [2024-11-09 07:12:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:15,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 07:12:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:12:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466273414] [2024-11-09 07:12:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466273414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:12:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:12:15,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:12:15,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620547889] [2024-11-09 07:12:15,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:12:15,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:12:15,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:12:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:12:15,692 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-11-09 07:12:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:15,749 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2024-11-09 07:12:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:12:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-11-09 07:12:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:15,750 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:12:15,750 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:12:15,750 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-11-09 07:12:15,751 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:15,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:12:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:12:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-11-09 07:12:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 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-11-09 07:12:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-09 07:12:15,762 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 20 [2024-11-09 07:12:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:15,762 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-09 07:12:15,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-11-09 07:12:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-09 07:12:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:12:15,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:15,765 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, 1, 1, 1] [2024-11-09 07:12:15,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:12:15,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:15,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1599016021, now seen corresponding path program 1 times [2024-11-09 07:12:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500089530] [2024-11-09 07:12:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 07:12:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:12:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500089530] [2024-11-09 07:12:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500089530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:12:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746810078] [2024-11-09 07:12:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:15,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:15,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:12:15,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:12:15,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:12:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:15,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:12:15,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:12:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:12:16,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:12:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:12:16,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746810078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:12:16,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:12:16,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 07:12:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103383531] [2024-11-09 07:12:16,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:12:16,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:12:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:12:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:12:16,114 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:12:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:16,220 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2024-11-09 07:12:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:12:16,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-09 07:12:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:16,221 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:12:16,221 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:12:16,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:12:16,222 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:16,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 198 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:12:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:12:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2024-11-09 07:12:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 60 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:12:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-09 07:12:16,230 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 25 [2024-11-09 07:12:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:16,232 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-09 07:12:16,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:12:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-09 07:12:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:12:16,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:16,234 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-11-09 07:12:16,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:12:16,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:16,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:16,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2125835307, now seen corresponding path program 2 times [2024-11-09 07:12:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11202921] [2024-11-09 07:12:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:16,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:12:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:12:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11202921] [2024-11-09 07:12:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11202921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:12:16,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:12:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:12:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646102639] [2024-11-09 07:12:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:12:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:12:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:12:16,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:12:16,698 INFO L87 Difference]: Start difference. First operand 66 states and 87 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-11-09 07:12:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:16,763 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2024-11-09 07:12:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:12:16,763 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 35 [2024-11-09 07:12:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:16,766 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:12:16,766 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:12:16,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:12:16,767 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:16,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 292 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:12:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:12:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-09 07:12:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.338235294117647) internal successors, (91), 70 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 07:12:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-09 07:12:16,778 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 35 [2024-11-09 07:12:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:16,778 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-09 07:12:16,779 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-11-09 07:12:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-09 07:12:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:12:16,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:16,781 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, 1, 1, 1] [2024-11-09 07:12:16,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:12:16,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:16,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1159237773, now seen corresponding path program 1 times [2024-11-09 07:12:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846344486] [2024-11-09 07:12:16,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:12:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:12:17,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:17,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846344486] [2024-11-09 07:12:17,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846344486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:12:17,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109382315] [2024-11-09 07:12:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:17,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:17,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:12:17,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:12:17,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:12:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:17,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:12:17,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:12:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:12:17,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:12:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:12:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109382315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:12:17,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:12:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-09 07:12:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047520103] [2024-11-09 07:12:17,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:12:17,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:12:17,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:17,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:12:17,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:12:17,400 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 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-11-09 07:12:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:17,469 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2024-11-09 07:12:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:12:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 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 38 [2024-11-09 07:12:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:17,471 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:12:17,471 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:12:17,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:12:17,471 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 18 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:17,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 405 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:12:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:12:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2024-11-09 07:12:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 07:12:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2024-11-09 07:12:17,481 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 38 [2024-11-09 07:12:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:17,481 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2024-11-09 07:12:17,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 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-11-09 07:12:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2024-11-09 07:12:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:12:17,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:17,485 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, 1, 1, 1] [2024-11-09 07:12:17,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:12:17,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:17,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:17,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1287145237, now seen corresponding path program 2 times [2024-11-09 07:12:17,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:17,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448592838] [2024-11-09 07:12:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:12:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:12:17,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448592838] [2024-11-09 07:12:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448592838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:12:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135167315] [2024-11-09 07:12:17,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:12:17,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:17,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:12:17,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:12:17,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:12:18,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:12:18,014 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:12:18,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:12:18,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:12:18,141 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-11-09 07:12:18,177 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-11-09 07:12:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 07:12:18,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:12:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135167315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:12:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:12:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-09 07:12:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334269534] [2024-11-09 07:12:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:12:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:12:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:12:18,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:12:18,191 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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-11-09 07:12:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:18,346 INFO L93 Difference]: Finished difference Result 166 states and 230 transitions. [2024-11-09 07:12:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:12:18,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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 41 [2024-11-09 07:12:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:18,348 INFO L225 Difference]: With dead ends: 166 [2024-11-09 07:12:18,348 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 07:12:18,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:12:18,349 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:18,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 429 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:12:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 07:12:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143. [2024-11-09 07:12:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 132 states have internal predecessors, (172), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-09 07:12:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2024-11-09 07:12:18,366 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 41 [2024-11-09 07:12:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:18,367 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2024-11-09 07:12:18,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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-11-09 07:12:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2024-11-09 07:12:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:12:18,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:18,368 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, 1, 1, 1] [2024-11-09 07:12:18,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:12:18,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:18,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:18,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1286797143, now seen corresponding path program 1 times [2024-11-09 07:12:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188939547] [2024-11-09 07:12:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:18,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:12:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 07:12:18,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:18,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188939547] [2024-11-09 07:12:18,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188939547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:12:18,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:12:18,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:12:18,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700093655] [2024-11-09 07:12:18,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:12:18,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:12:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:18,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:12:18,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:12:18,693 INFO L87 Difference]: Start difference. First operand 143 states and 201 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-11-09 07:12:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:18,763 INFO L93 Difference]: Finished difference Result 172 states and 241 transitions. [2024-11-09 07:12:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:12:18,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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 41 [2024-11-09 07:12:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:18,766 INFO L225 Difference]: With dead ends: 172 [2024-11-09 07:12:18,766 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 07:12:18,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:12:18,766 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 34 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:18,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 186 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:12:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 07:12:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 143. [2024-11-09 07:12:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 132 states have internal predecessors, (172), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-09 07:12:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2024-11-09 07:12:18,773 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 41 [2024-11-09 07:12:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:18,773 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2024-11-09 07:12:18,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-11-09 07:12:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2024-11-09 07:12:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:12:18,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:18,776 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, 1, 1, 1, 1, 1, 1] [2024-11-09 07:12:18,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:12:18,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:18,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1159349289, now seen corresponding path program 1 times [2024-11-09 07:12:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:18,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530203694] [2024-11-09 07:12:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:18,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:18,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:12:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:12:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530203694] [2024-11-09 07:12:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530203694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:12:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774425917] [2024-11-09 07:12:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:18,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:18,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:12:18,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:12:18,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:12:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:19,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:12:19,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:12:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:12:19,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:12:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:12:19,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774425917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:12:19,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:12:19,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2024-11-09 07:12:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726947476] [2024-11-09 07:12:19,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:12:19,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:12:19,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:19,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:12:19,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:12:19,356 INFO L87 Difference]: Start difference. First operand 143 states and 201 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:12:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:19,428 INFO L93 Difference]: Finished difference Result 171 states and 242 transitions. [2024-11-09 07:12:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:12:19,430 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-11-09 07:12:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:19,431 INFO L225 Difference]: With dead ends: 171 [2024-11-09 07:12:19,431 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 07:12:19,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:12:19,431 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 8 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:19,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 400 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:12:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 07:12:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2024-11-09 07:12:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 138 states have internal predecessors, (180), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-09 07:12:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 209 transitions. [2024-11-09 07:12:19,442 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 209 transitions. Word has length 44 [2024-11-09 07:12:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:19,442 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 209 transitions. [2024-11-09 07:12:19,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:12:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 209 transitions. [2024-11-09 07:12:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:12:19,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:19,443 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-11-09 07:12:19,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:12:19,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:19,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:19,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash -274684491, now seen corresponding path program 2 times [2024-11-09 07:12:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:19,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135765770] [2024-11-09 07:12:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:12:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 07:12:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:19,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135765770] [2024-11-09 07:12:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135765770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:12:19,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:12:19,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:12:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784009821] [2024-11-09 07:12:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:12:19,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:12:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:12:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:12:19,909 INFO L87 Difference]: Start difference. First operand 149 states and 209 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 6 states have internal predecessors, (29), 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-11-09 07:12:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:20,105 INFO L93 Difference]: Finished difference Result 288 states and 403 transitions. [2024-11-09 07:12:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:12:20,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 6 states have internal predecessors, (29), 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-11-09 07:12:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:20,107 INFO L225 Difference]: With dead ends: 288 [2024-11-09 07:12:20,108 INFO L226 Difference]: Without dead ends: 288 [2024-11-09 07:12:20,108 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-11-09 07:12:20,108 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 76 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:20,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 502 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:12:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-09 07:12:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 132. [2024-11-09 07:12:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 122 states have internal predecessors, (153), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-09 07:12:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2024-11-09 07:12:20,117 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 47 [2024-11-09 07:12:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:20,118 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2024-11-09 07:12:20,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 6 states have internal predecessors, (29), 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-11-09 07:12:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2024-11-09 07:12:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:12:20,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:20,122 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, 1, 1, 1] [2024-11-09 07:12:20,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:12:20,122 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:20,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash 576378920, now seen corresponding path program 1 times [2024-11-09 07:12:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757715657] [2024-11-09 07:12:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:12:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 07:12:20,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757715657] [2024-11-09 07:12:20,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757715657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:12:20,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:12:20,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:12:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766935062] [2024-11-09 07:12:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:12:20,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:12:20,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:20,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:12:20,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:12:20,851 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 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-11-09 07:12:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:21,171 INFO L93 Difference]: Finished difference Result 216 states and 305 transitions. [2024-11-09 07:12:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:12:21,171 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 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 51 [2024-11-09 07:12:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:21,172 INFO L225 Difference]: With dead ends: 216 [2024-11-09 07:12:21,172 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 07:12:21,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:12:21,173 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 81 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:21,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 656 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:12:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 07:12:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2024-11-09 07:12:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 133 states have (on average 1.300751879699248) internal successors, (173), 136 states have internal predecessors, (173), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-09 07:12:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 202 transitions. [2024-11-09 07:12:21,182 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 202 transitions. Word has length 51 [2024-11-09 07:12:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:21,185 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 202 transitions. [2024-11-09 07:12:21,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 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-11-09 07:12:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2024-11-09 07:12:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:12:21,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:21,186 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, 1, 1, 1, 1] [2024-11-09 07:12:21,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:12:21,186 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:21,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1227429328, now seen corresponding path program 1 times [2024-11-09 07:12:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832837439] [2024-11-09 07:12:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:21,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:12:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 07:12:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832837439] [2024-11-09 07:12:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832837439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:12:22,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210907744] [2024-11-09 07:12:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:12:22,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:12:22,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:12:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:22,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-09 07:12:22,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:12:22,754 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-11-09 07:12:22,817 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:12:22,818 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-11-09 07:12:22,857 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:12:22,857 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-11-09 07:12:22,983 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:12:22,983 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-11-09 07:12:23,050 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-11-09 07:12:23,167 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-11-09 07:12:23,178 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-11-09 07:12:23,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:12:23,249 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 07:12:23,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 [2024-11-09 07:12:23,419 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 07:12:23,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-09 07:12:23,431 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:12:23,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:12:23,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:23,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 115 [2024-11-09 07:12:23,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:23,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 111 [2024-11-09 07:12:23,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:12:23,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:12:23,866 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 22 [2024-11-09 07:12:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 07:12:23,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:12:24,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:24,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 13273 treesize of output 12390 [2024-11-09 07:12:24,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:24,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2934 treesize of output 2756 [2024-11-09 07:12:24,693 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:12:24,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 290 [2024-11-09 07:12:29,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1046 treesize of output 986 [2024-11-09 07:12:29,346 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 1046 treesize of output 986 [2024-11-09 07:12:40,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:40,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:40,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3201 treesize of output 2432 [2024-11-09 07:12:41,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:41,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:41,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:41,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:41,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:41,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3643 treesize of output 2754 [2024-11-09 07:12:42,091 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:42,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:42,112 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 3643 treesize of output 2754 [2024-11-09 07:12:43,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:43,113 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:43,166 INFO L349 Elim1Store]: treesize reduction 82, result has 48.8 percent of original size [2024-11-09 07:12:43,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 12154 treesize of output 11272 [2024-11-09 07:12:43,664 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:43,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:43,684 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 3643 treesize of output 2754 [2024-11-09 07:12:44,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:44,788 INFO L349 Elim1Store]: treesize reduction 74, result has 62.4 percent of original size [2024-11-09 07:12:44,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 12154 treesize of output 11317 [2024-11-09 07:12:45,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:45,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:45,597 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 3201 treesize of output 2432 [2024-11-09 07:12:46,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:46,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:46,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:46,714 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 294 treesize of output 286 [2024-11-09 07:12:46,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:46,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:46,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:46,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:46,804 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 3201 treesize of output 2432 [2024-11-09 07:12:48,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:48,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:48,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:48,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3201 treesize of output 2432 [2024-11-09 07:12:49,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:49,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:49,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3643 treesize of output 2754 [2024-11-09 07:12:50,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:50,211 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:12:50,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:50,213 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 294 treesize of output 286 [2024-11-09 07:13:40,205 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:13:40,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 246 [2024-11-09 07:13:40,238 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:13:40,238 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 84 treesize of output 1 [2024-11-09 07:13:40,289 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:13:40,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 246 [2024-11-09 07:13:40,347 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:13:40,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 246 [2024-11-09 07:13:40,393 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:13:40,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 246 [2024-11-09 07:13:40,445 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:13:40,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 246 [2024-11-09 07:13:40,491 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:13:40,491 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 3 case distinctions, treesize of input 1160 treesize of output 1146 [2024-11-09 07:13:40,601 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:13:40,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 246 [2024-11-09 07:13:40,646 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:13:40,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1166 treesize of output 1152 [2024-11-09 07:13:40,733 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:13:40,733 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 84 treesize of output 1