./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-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 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:05:06,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:05:06,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-20 14:05:06,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:05:06,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:05:06,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:05:06,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:05:06,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:05:06,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:05:06,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:05:06,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:05:06,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:05:06,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:05:06,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:05:06,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:05:06,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:05:06,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 14:05:06,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:05:06,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:05:06,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:05:06,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:05:06,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 14:05:06,379 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:05:06,379 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:05:06,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:05:06,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 14:05:06,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:05:06,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:05:06,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:05:06,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:05:06,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 14:05:06,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:05:06,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:05:06,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:05:06,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:05:06,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:05:06,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:05:06,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:05:06,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:05:06,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:05:06,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:05:06,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:05:06,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:05:06,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:05:06,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:05:06,386 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 -> 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 [2024-11-20 14:05:06,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:05:06,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:05:06,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:05:06,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:05:06,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:05:06,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2024-11-20 14:05:08,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:05:08,378 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:05:08,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2024-11-20 14:05:08,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1932f202e/bcc55bc492754946bb41c5f95db53019/FLAGb29155dd1 [2024-11-20 14:05:08,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1932f202e/bcc55bc492754946bb41c5f95db53019 [2024-11-20 14:05:08,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:05:08,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:05:08,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:05:08,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:05:08,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:05:08,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:08,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e06e19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08, skipping insertion in model container [2024-11-20 14:05:08,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:08,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:05:08,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:05:08,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:05:08,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:05:08,922 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:05:08,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08 WrapperNode [2024-11-20 14:05:08,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:05:08,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:05:08,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:05:08,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:05:08,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:08,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:08,973 INFO L138 Inliner]: procedures = 119, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 224 [2024-11-20 14:05:08,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:05:08,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:05:08,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:05:08,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:05:08,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:08,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:08,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:09,012 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-20 14:05:09,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:09,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:09,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:09,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:09,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:09,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:09,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:05:09,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:05:09,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:05:09,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:05:09,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (1/1) ... [2024-11-20 14:05:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:05:09,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:09,066 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-20 14:05:09,068 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-20 14:05:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 14:05:09,113 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 14:05:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:05:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:05:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:05:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:05:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:05:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:05:09,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:05:09,225 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:05:09,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:05:09,509 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 14:05:09,510 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:05:09,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:05:09,536 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-20 14:05:09,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:05:09 BoogieIcfgContainer [2024-11-20 14:05:09,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:05:09,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:05:09,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:05:09,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:05:09,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:05:08" (1/3) ... [2024-11-20 14:05:09,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b15aa8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:05:09, skipping insertion in model container [2024-11-20 14:05:09,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:08" (2/3) ... [2024-11-20 14:05:09,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b15aa8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:05:09, skipping insertion in model container [2024-11-20 14:05:09,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:05:09" (3/3) ... [2024-11-20 14:05:09,546 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2024-11-20 14:05:09,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:05:09,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 14:05:09,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:05:09,614 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;@61846ca6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:05:09,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 14:05:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 75 states have internal predecessors, (132), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 14:05:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:05:09,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:09,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:09,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:09,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1525442300, now seen corresponding path program 1 times [2024-11-20 14:05:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:09,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411039466] [2024-11-20 14:05:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:09,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:09,856 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-20 14:05:09,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:09,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411039466] [2024-11-20 14:05:09,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411039466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:05:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:05:09,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:05:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710364475] [2024-11-20 14:05:09,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:05:09,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 14:05:09,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 14:05:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:05:09,899 INFO L87 Difference]: Start difference. First operand has 91 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 75 states have internal predecessors, (132), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:09,916 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2024-11-20 14:05:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 14:05:09,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 14:05:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:09,925 INFO L225 Difference]: With dead ends: 75 [2024-11-20 14:05:09,925 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 14:05:09,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:05:09,931 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:09,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:05:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 14:05:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-20 14:05:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 71 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-20 14:05:09,973 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 7 [2024-11-20 14:05:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:09,973 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-20 14:05:09,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-20 14:05:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 14:05:09,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:09,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:09,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:05:09,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:09,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1651115684, now seen corresponding path program 1 times [2024-11-20 14:05:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:09,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391650250] [2024-11-20 14:05:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:10,065 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-20 14:05:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391650250] [2024-11-20 14:05:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391650250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:05:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:05:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:05:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969435864] [2024-11-20 14:05:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:05:10,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:05:10,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:10,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:05:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:10,075 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:10,135 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-11-20 14:05:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:05:10,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 14:05:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:10,138 INFO L225 Difference]: With dead ends: 69 [2024-11-20 14:05:10,138 INFO L226 Difference]: Without dead ends: 69 [2024-11-20 14:05:10,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:10,139 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:10,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:05:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-20 14:05:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-20 14:05:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 67 states have internal predecessors, (78), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2024-11-20 14:05:10,150 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 8 [2024-11-20 14:05:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:10,151 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2024-11-20 14:05:10,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-11-20 14:05:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 14:05:10,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:10,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:10,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:05:10,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:10,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -744980996, now seen corresponding path program 1 times [2024-11-20 14:05:10,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:10,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947500802] [2024-11-20 14:05:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:10,585 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-20 14:05:10,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947500802] [2024-11-20 14:05:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947500802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:05:10,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:05:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:05:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021360618] [2024-11-20 14:05:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:05:10,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:05:10,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:10,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:05:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:05:10,592 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:10,729 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2024-11-20 14:05:10,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:05:10,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 14:05:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:10,731 INFO L225 Difference]: With dead ends: 110 [2024-11-20 14:05:10,731 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 14:05:10,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:05:10,732 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 138 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:10,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 142 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:05:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 14:05:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 68. [2024-11-20 14:05:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 66 states have internal predecessors, (77), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2024-11-20 14:05:10,746 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 11 [2024-11-20 14:05:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2024-11-20 14:05:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2024-11-20 14:05:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:05:10,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:10,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:05:10,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:10,751 INFO L85 PathProgramCache]: Analyzing trace with hash 176108302, now seen corresponding path program 1 times [2024-11-20 14:05:10,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:10,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212235157] [2024-11-20 14:05:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:10,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:10,801 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-20 14:05:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:10,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212235157] [2024-11-20 14:05:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212235157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:05:10,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:05:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:05:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446296061] [2024-11-20 14:05:10,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:05:10,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:05:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:10,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:05:10,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:10,804 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:10,836 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2024-11-20 14:05:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:05:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 14:05:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:10,837 INFO L225 Difference]: With dead ends: 91 [2024-11-20 14:05:10,837 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 14:05:10,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:10,839 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:10,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 149 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:05:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 14:05:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2024-11-20 14:05:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.303030303030303) internal successors, (86), 74 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2024-11-20 14:05:10,849 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 14 [2024-11-20 14:05:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:10,850 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2024-11-20 14:05:10,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2024-11-20 14:05:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:05:10,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:10,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:10,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:05:10,853 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash 421022757, now seen corresponding path program 1 times [2024-11-20 14:05:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677795152] [2024-11-20 14:05:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:05:11,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:11,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677795152] [2024-11-20 14:05:11,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677795152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:05:11,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:05:11,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:05:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812144224] [2024-11-20 14:05:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:05:11,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:05:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:05:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:05:11,058 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:11,180 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2024-11-20 14:05:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:05:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 14:05:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:11,181 INFO L225 Difference]: With dead ends: 86 [2024-11-20 14:05:11,182 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 14:05:11,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:05:11,184 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:11,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 287 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:05:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 14:05:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-20 14:05:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 78 states have internal predecessors, (90), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2024-11-20 14:05:11,218 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 17 [2024-11-20 14:05:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:11,219 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2024-11-20 14:05:11,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2024-11-20 14:05:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:05:11,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:11,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:11,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:05:11,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:11,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash 478281059, now seen corresponding path program 1 times [2024-11-20 14:05:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:11,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675797264] [2024-11-20 14:05:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:11,316 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-20 14:05:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:11,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675797264] [2024-11-20 14:05:11,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675797264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:05:11,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840973291] [2024-11-20 14:05:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:11,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:11,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:11,323 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-20 14:05:11,325 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-20 14:05:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:11,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:05:11,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:05:11,512 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 13 treesize of output 9 [2024-11-20 14:05:11,554 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-20 14:05:11,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:05:11,592 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-20 14:05:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840973291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:05:11,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:05:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-20 14:05:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97151819] [2024-11-20 14:05:11,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:05:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:05:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:11,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:05:11,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:05:11,595 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:11,646 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2024-11-20 14:05:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:05:11,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 14:05:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:11,647 INFO L225 Difference]: With dead ends: 85 [2024-11-20 14:05:11,649 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 14:05:11,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:05:11,650 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:11,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:05:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 14:05:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-20 14:05:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 80 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2024-11-20 14:05:11,657 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 17 [2024-11-20 14:05:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2024-11-20 14:05:11,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2024-11-20 14:05:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:05:11,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:11,661 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:11,672 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-20 14:05:11,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 14:05:11,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1941865044, now seen corresponding path program 2 times [2024-11-20 14:05:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:11,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683242633] [2024-11-20 14:05:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:12,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:12,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683242633] [2024-11-20 14:05:12,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683242633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:05:12,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805999261] [2024-11-20 14:05:12,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:05:12,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:12,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:12,003 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-20 14:05:12,005 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-20 14:05:12,091 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:05:12,092 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:05:12,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 14:05:12,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:05:12,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2024-11-20 14:05:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:12,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:05:12,387 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 8 treesize of output 4 [2024-11-20 14:05:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:12,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805999261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:05:12,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:05:12,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2024-11-20 14:05:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370604701] [2024-11-20 14:05:12,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:05:12,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:05:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:12,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:05:12,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:05:12,413 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:12,774 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2024-11-20 14:05:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:05:12,777 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 14:05:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:12,778 INFO L225 Difference]: With dead ends: 142 [2024-11-20 14:05:12,778 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 14:05:12,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:05:12,779 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 94 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:12,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 818 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:05:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 14:05:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2024-11-20 14:05:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 75 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2024-11-20 14:05:12,791 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 18 [2024-11-20 14:05:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:12,791 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2024-11-20 14:05:12,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2024-11-20 14:05:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:05:12,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:12,797 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:12,806 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-20 14:05:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 14:05:12,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:12,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 227239491, now seen corresponding path program 1 times [2024-11-20 14:05:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:12,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256359261] [2024-11-20 14:05:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:13,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256359261] [2024-11-20 14:05:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256359261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:05:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587990698] [2024-11-20 14:05:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:13,319 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-20 14:05:13,320 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-20 14:05:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:13,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 14:05:13,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:05:13,424 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-20 14:05:13,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-20 14:05:13,468 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 30 treesize of output 22 [2024-11-20 14:05:13,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-20 14:05:13,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:05:13,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:05:13,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-20 14:05:13,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:13,513 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 16 treesize of output 11 [2024-11-20 14:05:13,523 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-20 14:05:13,533 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 16 treesize of output 11 [2024-11-20 14:05:13,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-20 14:05:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:13,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:05:13,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:13,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2024-11-20 14:05:13,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:13,723 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 186 treesize of output 145 [2024-11-20 14:05:13,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:13,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 124 [2024-11-20 14:05:13,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 80 treesize of output 74 [2024-11-20 14:05:13,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:13,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-20 14:05:13,801 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 48 treesize of output 40 [2024-11-20 14:05:13,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 25 [2024-11-20 14:05:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587990698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:05:14,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:05:14,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-11-20 14:05:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959116662] [2024-11-20 14:05:14,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:05:14,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:05:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:14,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:05:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2024-11-20 14:05:14,152 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:14,374 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2024-11-20 14:05:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:05:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 14:05:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:14,376 INFO L225 Difference]: With dead ends: 145 [2024-11-20 14:05:14,376 INFO L226 Difference]: Without dead ends: 145 [2024-11-20 14:05:14,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=128, Unknown=1, NotChecked=0, Total=182 [2024-11-20 14:05:14,377 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 205 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:14,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 360 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:05:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-20 14:05:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2024-11-20 14:05:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.275) internal successors, (102), 88 states have internal predecessors, (102), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2024-11-20 14:05:14,383 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 21 [2024-11-20 14:05:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:14,384 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2024-11-20 14:05:14,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2024-11-20 14:05:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:05:14,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:14,385 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:14,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 14:05:14,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:14,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:14,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1176120509, now seen corresponding path program 1 times [2024-11-20 14:05:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:14,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565692274] [2024-11-20 14:05:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:14,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:14,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565692274] [2024-11-20 14:05:14,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565692274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:05:14,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:05:14,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:05:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126473846] [2024-11-20 14:05:14,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:05:14,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:05:14,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:14,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:05:14,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:14,622 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:14,648 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2024-11-20 14:05:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:05:14,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-20 14:05:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:14,649 INFO L225 Difference]: With dead ends: 124 [2024-11-20 14:05:14,649 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 14:05:14,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:14,650 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 28 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:14,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 144 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:05:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 14:05:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2024-11-20 14:05:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 101 states have internal predecessors, (115), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2024-11-20 14:05:14,654 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 22 [2024-11-20 14:05:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:14,654 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2024-11-20 14:05:14,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2024-11-20 14:05:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:05:14,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:14,655 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:14,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:05:14,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash 622380787, now seen corresponding path program 1 times [2024-11-20 14:05:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:14,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302370286] [2024-11-20 14:05:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:05:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302370286] [2024-11-20 14:05:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302370286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:05:14,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:05:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:05:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777473439] [2024-11-20 14:05:14,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:05:14,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:05:14,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:14,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:05:14,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:14,729 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:14,761 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-20 14:05:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:05:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-20 14:05:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:14,764 INFO L225 Difference]: With dead ends: 138 [2024-11-20 14:05:14,764 INFO L226 Difference]: Without dead ends: 138 [2024-11-20 14:05:14,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:14,765 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 33 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:14,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 167 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:05:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-20 14:05:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2024-11-20 14:05:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 114 states have internal predecessors, (129), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2024-11-20 14:05:14,771 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 29 [2024-11-20 14:05:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:14,771 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2024-11-20 14:05:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2024-11-20 14:05:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:05:14,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:14,773 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:14,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:05:14,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:14,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:14,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1749267135, now seen corresponding path program 1 times [2024-11-20 14:05:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156046584] [2024-11-20 14:05:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:14,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:05:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156046584] [2024-11-20 14:05:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156046584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:05:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097499303] [2024-11-20 14:05:14,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:14,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:14,860 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-20 14:05:14,862 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-20 14:05:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:15,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 14:05:15,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:05:15,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-20 14:05:15,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-20 14:05:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:05:15,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:05:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:05:15,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097499303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:05:15,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:05:15,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2024-11-20 14:05:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554255820] [2024-11-20 14:05:15,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:05:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:05:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:05:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:05:15,145 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:15,370 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2024-11-20 14:05:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:05:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-20 14:05:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:15,372 INFO L225 Difference]: With dead ends: 129 [2024-11-20 14:05:15,372 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 14:05:15,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:05:15,372 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 127 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:15,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 340 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:05:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 14:05:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2024-11-20 14:05:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 119 states have internal predecessors, (134), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2024-11-20 14:05:15,377 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 29 [2024-11-20 14:05:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:15,378 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2024-11-20 14:05:15,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2024-11-20 14:05:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:05:15,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:15,379 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:15,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 14:05:15,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:15,585 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:15,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:15,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1811642221, now seen corresponding path program 1 times [2024-11-20 14:05:15,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:15,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520529289] [2024-11-20 14:05:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:15,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:16,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:16,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520529289] [2024-11-20 14:05:16,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520529289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:05:16,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015431134] [2024-11-20 14:05:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:16,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:16,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:16,095 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-20 14:05:16,099 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-20 14:05:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:16,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 14:05:16,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:05:16,228 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-20 14:05:16,261 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 14:05:16,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 14:05:16,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 35 treesize of output 26 [2024-11-20 14:05:16,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:16,276 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 16 treesize of output 11 [2024-11-20 14:05:16,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 42 treesize of output 33 [2024-11-20 14:05:16,302 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-20 14:05:16,302 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 61 [2024-11-20 14:05:16,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 30 [2024-11-20 14:05:16,329 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 16 treesize of output 11 [2024-11-20 14:05:16,417 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-20 14:05:16,418 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 49 [2024-11-20 14:05:16,430 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-20 14:05:16,430 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 47 [2024-11-20 14:05:16,445 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-20 14:05:16,446 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 49 [2024-11-20 14:05:16,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:16,463 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-20 14:05:16,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 64 [2024-11-20 14:05:16,480 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-20 14:05:16,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-20 14:05:16,539 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-20 14:05:16,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 56 [2024-11-20 14:05:16,697 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-20 14:05:16,697 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-20 14:05:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:16,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:05:16,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int)) (v_ArrVal_616 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_24| Int) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|) 0)) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_614))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_616)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) is different from false [2024-11-20 14:05:16,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:16,803 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-20 14:05:16,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:16,847 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 67 [2024-11-20 14:05:16,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:16,871 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 34557 treesize of output 24868 [2024-11-20 14:05:17,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:17,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2254 treesize of output 2127 [2024-11-20 14:05:17,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:17,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2130 treesize of output 1934 [2024-11-20 14:05:17,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1916 treesize of output 1856 [2024-11-20 14:05:17,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:17,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1856 treesize of output 1789 [2024-11-20 14:05:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-20 14:05:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015431134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:05:18,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:05:18,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-11-20 14:05:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172346154] [2024-11-20 14:05:18,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:05:18,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:05:18,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:18,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:05:18,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=152, Unknown=11, NotChecked=26, Total=240 [2024-11-20 14:05:18,317 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:22,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 14:05:26,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 14:05:30,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 14:05:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:30,881 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2024-11-20 14:05:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:05:30,882 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-20 14:05:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:30,883 INFO L225 Difference]: With dead ends: 183 [2024-11-20 14:05:30,883 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 14:05:30,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=398, Unknown=12, NotChecked=44, Total=600 [2024-11-20 14:05:30,883 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 466 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 43 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:30,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 453 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 328 Invalid, 4 Unknown, 173 Unchecked, 12.4s Time] [2024-11-20 14:05:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 14:05:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2024-11-20 14:05:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 118 states have internal predecessors, (133), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2024-11-20 14:05:30,887 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 30 [2024-11-20 14:05:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2024-11-20 14:05:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2024-11-20 14:05:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:05:30,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:30,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:30,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 14:05:31,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-20 14:05:31,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:31,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1607239560, now seen corresponding path program 2 times [2024-11-20 14:05:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672600907] [2024-11-20 14:05:31,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:31,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672600907] [2024-11-20 14:05:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672600907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:05:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039058486] [2024-11-20 14:05:31,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:05:31,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:31,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:31,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:05:31,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 14:05:31,580 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:05:31,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:05:31,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-20 14:05:31,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:05:31,631 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-20 14:05:31,642 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-20 14:05:31,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 65 [2024-11-20 14:05:31,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 34 [2024-11-20 14:05:31,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-20 14:05:31,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:31,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:31,664 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 16 treesize of output 11 [2024-11-20 14:05:31,705 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:05:31,705 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2024-11-20 14:05:31,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-11-20 14:05:31,941 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~item~0#1.base_45| Int) (|v_ULTIMATE.start_main_~item~0#1.base_46| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_45| 0) |v_ULTIMATE.start_main_~item~0#1.base_46| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_45| 1) |v_ULTIMATE.start_main_~item~0#1.base_46|) 0))) is different from true [2024-11-20 14:05:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 14:05:31,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:05:32,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_711) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2024-11-20 14:05:32,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:32,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-11-20 14:05:32,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:32,034 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 246 treesize of output 177 [2024-11-20 14:05:32,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 124 treesize of output 120 [2024-11-20 14:05:32,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:32,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 118 [2024-11-20 14:05:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039058486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:05:33,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:05:33,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-20 14:05:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946577686] [2024-11-20 14:05:33,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:05:33,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 14:05:33,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 14:05:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2024-11-20 14:05:33,131 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:33,718 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2024-11-20 14:05:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:05:33,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-20 14:05:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:33,719 INFO L225 Difference]: With dead ends: 149 [2024-11-20 14:05:33,719 INFO L226 Difference]: Without dead ends: 147 [2024-11-20 14:05:33,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=143, Unknown=2, NotChecked=50, Total=240 [2024-11-20 14:05:33,720 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 69 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:33,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 602 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 208 Unchecked, 0.5s Time] [2024-11-20 14:05:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-20 14:05:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2024-11-20 14:05:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 127 states have (on average 1.204724409448819) internal successors, (153), 134 states have internal predecessors, (153), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2024-11-20 14:05:33,723 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 30 [2024-11-20 14:05:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:33,724 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2024-11-20 14:05:33,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2024-11-20 14:05:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:05:33,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:33,725 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:33,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-20 14:05:33,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:33,926 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:33,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1777882656, now seen corresponding path program 1 times [2024-11-20 14:05:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553787601] [2024-11-20 14:05:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:05:33,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:33,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553787601] [2024-11-20 14:05:33,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553787601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:05:33,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:05:33,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:05:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394624255] [2024-11-20 14:05:33,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:05:33,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:05:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:05:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:33,964 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:33,979 INFO L93 Difference]: Finished difference Result 138 states and 162 transitions. [2024-11-20 14:05:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:05:33,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-20 14:05:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:33,981 INFO L225 Difference]: With dead ends: 138 [2024-11-20 14:05:33,981 INFO L226 Difference]: Without dead ends: 138 [2024-11-20 14:05:33,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:05:33,982 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:33,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:05:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-20 14:05:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-20 14:05:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 136 states have internal predecessors, (155), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2024-11-20 14:05:33,988 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 31 [2024-11-20 14:05:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:33,988 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2024-11-20 14:05:33,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2024-11-20 14:05:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:05:33,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:33,989 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:33,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:05:33,989 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:33,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1776035614, now seen corresponding path program 1 times [2024-11-20 14:05:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:33,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589351353] [2024-11-20 14:05:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589351353] [2024-11-20 14:05:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589351353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:05:34,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832410884] [2024-11-20 14:05:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:34,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:34,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:34,498 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:05:34,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 14:05:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:34,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 14:05:34,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:05:34,615 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-20 14:05:34,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:34,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:34,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 36 treesize of output 26 [2024-11-20 14:05:34,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-20 14:05:34,661 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:05:34,661 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 16 treesize of output 15 [2024-11-20 14:05:34,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-20 14:05:34,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:05:34,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:05:34,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-20 14:05:34,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:34,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-20 14:05:34,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:05:34,718 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2024-11-20 14:05:34,724 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 27 treesize of output 1 [2024-11-20 14:05:34,729 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 24 treesize of output 11 [2024-11-20 14:05:34,839 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 27 treesize of output 15 [2024-11-20 14:05:34,843 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 7 treesize of output 3 [2024-11-20 14:05:34,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 14:05:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:34,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:05:34,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2024-11-20 14:05:34,963 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_848 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_848) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) is different from false [2024-11-20 14:05:34,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:34,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 148 [2024-11-20 14:05:35,006 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-20 14:05:35,007 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 232 treesize of output 227 [2024-11-20 14:05:35,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:35,038 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 246 treesize of output 232 [2024-11-20 14:05:35,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 177 treesize of output 171 [2024-11-20 14:05:35,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:35,090 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 535 treesize of output 497 [2024-11-20 14:05:35,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:35,143 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 252 treesize of output 263 [2024-11-20 14:05:35,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 238 treesize of output 230 [2024-11-20 14:05:35,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-20 14:05:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832410884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:05:35,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:05:35,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-20 14:05:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431749144] [2024-11-20 14:05:35,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:05:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 14:05:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:05:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 14:05:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=203, Unknown=1, NotChecked=28, Total=272 [2024-11-20 14:05:35,417 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:05:35,838 INFO L93 Difference]: Finished difference Result 202 states and 238 transitions. [2024-11-20 14:05:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:05:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-20 14:05:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:05:35,839 INFO L225 Difference]: With dead ends: 202 [2024-11-20 14:05:35,839 INFO L226 Difference]: Without dead ends: 202 [2024-11-20 14:05:35,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=397, Unknown=1, NotChecked=42, Total=552 [2024-11-20 14:05:35,840 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 297 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:05:35,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 653 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 306 Invalid, 0 Unknown, 124 Unchecked, 0.2s Time] [2024-11-20 14:05:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-20 14:05:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 141. [2024-11-20 14:05:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 132 states have (on average 1.2121212121212122) internal successors, (160), 139 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2024-11-20 14:05:35,843 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 31 [2024-11-20 14:05:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:05:35,843 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2024-11-20 14:05:35,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:05:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2024-11-20 14:05:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:05:35,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:05:35,844 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:05:35,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 14:05:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:36,045 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:05:36,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:05:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1715235295, now seen corresponding path program 3 times [2024-11-20 14:05:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:05:36,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950223630] [2024-11-20 14:05:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:05:36,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:05:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:05:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:36,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:05:36,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950223630] [2024-11-20 14:05:36,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950223630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:05:36,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117848428] [2024-11-20 14:05:36,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 14:05:36,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:05:36,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:05:36,399 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:05:36,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 14:05:36,560 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 14:05:36,560 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:05:36,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 14:05:36,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:05:36,571 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-20 14:05:36,617 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-20 14:05:36,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 47 [2024-11-20 14:05:36,676 INFO L349 Elim1Store]: treesize reduction 121, result has 31.6 percent of original size [2024-11-20 14:05:36,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 150 [2024-11-20 14:05:36,685 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 8 treesize of output 7 [2024-11-20 14:05:36,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 39 treesize of output 10 [2024-11-20 14:05:36,728 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:05:36,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2024-11-20 14:05:36,742 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-20 14:05:36,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:05:36,780 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-20 14:05:36,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 43 [2024-11-20 14:05:36,890 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-20 14:05:36,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-20 14:05:36,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:05:36,900 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-20 14:05:36,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:36,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:05:36,911 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 115 treesize of output 15 [2024-11-20 14:05:36,970 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-20 14:05:36,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-20 14:05:36,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-20 14:05:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:05:37,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:05:37,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 8))) (and (forall ((v_ArrVal_952 (Array Int Int))) (or (not (= v_ArrVal_952 (store .cse0 .cse1 (select v_ArrVal_952 .cse1)))) (forall ((v_ArrVal_953 (Array Int Int))) (or (not (= v_ArrVal_953 (store .cse2 .cse1 (select v_ArrVal_953 .cse1)))) (= (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_953))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (forall ((v_ArrVal_952 (Array Int Int))) (or (not (= v_ArrVal_952 (store .cse0 .cse1 (select v_ArrVal_952 .cse1)))) (forall ((v_ArrVal_953 (Array Int Int))) (or (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_952))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) (not (= v_ArrVal_953 (store .cse2 .cse1 (select v_ArrVal_953 .cse1)))))))))) is different from false [2024-11-20 14:05:37,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:37,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 758 treesize of output 631 [2024-11-20 14:05:37,492 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2024-11-20 14:05:37,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 694 treesize of output 583 [2024-11-20 14:05:37,894 INFO L349 Elim1Store]: treesize reduction 152, result has 42.4 percent of original size [2024-11-20 14:05:37,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 1043 treesize of output 966 [2024-11-20 14:05:38,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:05:38,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3134 treesize of output 3107 [2024-11-20 14:05:39,137 INFO L349 Elim1Store]: treesize reduction 8, result has 97.2 percent of original size [2024-11-20 14:05:39,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 2956 treesize of output 2554 [2024-11-20 14:05:45,243 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 566 DAG size of output: 235 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-20 14:05:45,243 INFO L349 Elim1Store]: treesize reduction 1499, result has 23.3 percent of original size [2024-11-20 14:05:45,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 17 new quantified variables, introduced 63 case distinctions, treesize of input 1247 treesize of output 1979