./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-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 b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:09:52,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:09:52,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:09:52,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:09:52,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:09:52,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:09:52,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:09:52,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:09:52,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:09:52,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:09:52,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:09:52,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:09:52,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:09:52,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:09:52,975 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:09:52,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:09:52,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:09:52,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:09:52,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:09:52,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:09:52,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:09:52,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:09:52,983 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:09:52,983 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:09:52,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:09:52,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:09:52,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:09:52,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:09:52,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:09:52,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:09:52,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:09:52,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:09:52,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:09:52,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:09:52,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:09:52,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:09:52,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:09:52,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:09:52,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:09:52,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:09:52,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:09:52,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:09:52,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:09:52,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:09:52,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:09:52,989 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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2024-11-19 06:09:53,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:09:53,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:09:53,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:09:53,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:09:53,264 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:09:53,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-2.i [2024-11-19 06:09:54,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:09:54,903 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:09:54,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2024-11-19 06:09:54,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a2fdf84/d5a143a2a1094c67b19a446ee4c5cf25/FLAGab1e7561c [2024-11-19 06:09:55,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a2fdf84/d5a143a2a1094c67b19a446ee4c5cf25 [2024-11-19 06:09:55,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:09:55,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:09:55,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:09:55,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:09:55,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:09:55,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56118f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55, skipping insertion in model container [2024-11-19 06:09:55,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:09:55,637 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:09:55,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:09:55,651 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:09:55,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:09:55,749 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:09:55,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55 WrapperNode [2024-11-19 06:09:55,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:09:55,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:09:55,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:09:55,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:09:55,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,801 INFO L138 Inliner]: procedures = 226, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2024-11-19 06:09:55,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:09:55,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:09:55,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:09:55,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:09:55,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,834 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 06:09:55,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:09:55,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:09:55,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:09:55,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:09:55,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (1/1) ... [2024-11-19 06:09:55,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:09:55,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:55,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:09:55,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:09:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:09:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:09:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:09:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:09:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:09:55,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:09:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:09:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:09:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:09:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:09:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:09:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2024-11-19 06:09:55,932 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2024-11-19 06:09:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:09:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:09:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:09:55,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:09:56,051 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:09:56,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:09:56,247 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-19 06:09:56,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:09:56,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:09:56,262 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 06:09:56,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:09:56 BoogieIcfgContainer [2024-11-19 06:09:56,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:09:56,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:09:56,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:09:56,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:09:56,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:09:55" (1/3) ... [2024-11-19 06:09:56,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248f4976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:09:56, skipping insertion in model container [2024-11-19 06:09:56,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:55" (2/3) ... [2024-11-19 06:09:56,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248f4976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:09:56, skipping insertion in model container [2024-11-19 06:09:56,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:09:56" (3/3) ... [2024-11-19 06:09:56,272 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2024-11-19 06:09:56,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:09:56,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:09:56,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:09:56,326 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;@49dc41c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:09:56,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:09:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 32 states have (on average 1.46875) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:09:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:09:56,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:56,337 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:56,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:56,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash -435527478, now seen corresponding path program 1 times [2024-11-19 06:09:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:56,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210862390] [2024-11-19 06:09:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:09:56,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210862390] [2024-11-19 06:09:56,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210862390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:56,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997078776] [2024-11-19 06:09:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:56,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:56,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:56,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:09:56,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:09:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:57,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:09:57,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 06:09:57,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:09:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997078776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:09:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2024-11-19 06:09:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609644478] [2024-11-19 06:09:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:57,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:09:57,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:09:57,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:09:57,216 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.46875) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:57,237 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-19 06:09:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:09:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-19 06:09:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:57,244 INFO L225 Difference]: With dead ends: 39 [2024-11-19 06:09:57,244 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 06:09:57,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:09:57,249 INFO L432 NwaCegarLoop]: 48 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, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:57,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:09:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 06:09:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 06:09:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:09:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-19 06:09:57,280 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 39 [2024-11-19 06:09:57,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:57,281 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-19 06:09:57,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-19 06:09:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:09:57,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:57,283 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:57,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:09:57,483 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,SelfDestructingSolverStorable0 [2024-11-19 06:09:57,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1995034883, now seen corresponding path program 1 times [2024-11-19 06:09:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:57,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274762915] [2024-11-19 06:09:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:09:57,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:57,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274762915] [2024-11-19 06:09:57,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274762915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:57,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122607732] [2024-11-19 06:09:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:57,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:57,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:57,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:09:57,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:09:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:57,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:09:57,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:09:57,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:09:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122607732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:57,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:09:57,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-19 06:09:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608112109] [2024-11-19 06:09:57,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:57,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:09:57,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:57,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:09:57,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:09:57,959 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:58,051 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-11-19 06:09:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:09:58,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-19 06:09:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:58,053 INFO L225 Difference]: With dead ends: 48 [2024-11-19 06:09:58,055 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 06:09:58,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:09:58,057 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:58,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:09:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 06:09:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2024-11-19 06:09:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:09:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-11-19 06:09:58,068 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 41 [2024-11-19 06:09:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:58,068 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-19 06:09:58,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-19 06:09:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:09:58,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:58,073 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:58,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:09:58,276 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,SelfDestructingSolverStorable1 [2024-11-19 06:09:58,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:58,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1996362409, now seen corresponding path program 1 times [2024-11-19 06:09:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:58,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794665494] [2024-11-19 06:09:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-19 06:09:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:58,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794665494] [2024-11-19 06:09:58,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794665494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:58,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:09:58,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:09:58,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184476933] [2024-11-19 06:09:58,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:58,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:09:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:58,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:09:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:09:58,692 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:58,770 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-19 06:09:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:09:58,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-19 06:09:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:58,772 INFO L225 Difference]: With dead ends: 47 [2024-11-19 06:09:58,772 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 06:09:58,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:09:58,774 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:58,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 185 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:09:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 06:09:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-19 06:09:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:09:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-11-19 06:09:58,785 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 42 [2024-11-19 06:09:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:58,786 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-11-19 06:09:58,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-11-19 06:09:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:09:58,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:58,789 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:58,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:09:58,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:58,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:58,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1489258261, now seen corresponding path program 1 times [2024-11-19 06:09:58,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465057669] [2024-11-19 06:09:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:09:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465057669] [2024-11-19 06:09:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465057669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:58,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121948320] [2024-11-19 06:09:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:58,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:58,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:58,998 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-19 06:09:59,000 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-19 06:09:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:59,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:09:59,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:09:59,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:09:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:09:59,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121948320] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:59,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:09:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 16 [2024-11-19 06:09:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102642804] [2024-11-19 06:09:59,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:59,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:09:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:59,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:09:59,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:09:59,563 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:59,762 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-19 06:09:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:09:59,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-19 06:09:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:59,765 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:09:59,765 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:09:59,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:09:59,767 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 78 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:59,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 175 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:09:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:09:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2024-11-19 06:09:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:09:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-19 06:09:59,775 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 42 [2024-11-19 06:09:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:59,775 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-19 06:09:59,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-11-19 06:09:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:09:59,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:59,776 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2024-11-19 06:09:59,794 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-19 06:09:59,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:59,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:59,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1092704934, now seen corresponding path program 1 times [2024-11-19 06:09:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:59,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400769040] [2024-11-19 06:09:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:10:00,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400769040] [2024-11-19 06:10:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400769040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749868507] [2024-11-19 06:10:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:00,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:00,533 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-19 06:10:00,536 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-19 06:10:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:00,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:10:00,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:00,748 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 13 treesize of output 9 [2024-11-19 06:10:00,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-19 06:10:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:10:00,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:10:01,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749868507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:10:01,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:10:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-11-19 06:10:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166585668] [2024-11-19 06:10:01,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:01,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:10:01,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:10:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:10:01,030 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 06:10:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:01,772 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2024-11-19 06:10:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 06:10:01,772 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2024-11-19 06:10:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:01,774 INFO L225 Difference]: With dead ends: 69 [2024-11-19 06:10:01,774 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 06:10:01,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1564, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 06:10:01,776 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 178 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:01,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 418 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:10:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 06:10:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2024-11-19 06:10:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:10:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-11-19 06:10:01,790 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 45 [2024-11-19 06:10:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:01,791 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-11-19 06:10:01,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 06:10:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-11-19 06:10:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:10:01,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:01,792 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2024-11-19 06:10:01,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:10:01,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:01,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:01,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1373258684, now seen corresponding path program 1 times [2024-11-19 06:10:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:01,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928928826] [2024-11-19 06:10:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:01,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 06:10:02,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:02,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928928826] [2024-11-19 06:10:02,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928928826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:10:02,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:10:02,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:10:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358145470] [2024-11-19 06:10:02,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:10:02,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:10:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:02,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:10:02,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:10:02,340 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:10:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:02,506 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-19 06:10:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:10:02,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-11-19 06:10:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:02,507 INFO L225 Difference]: With dead ends: 57 [2024-11-19 06:10:02,507 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 06:10:02,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:10:02,508 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:02,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:10:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 06:10:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-19 06:10:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:10:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-19 06:10:02,518 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 48 [2024-11-19 06:10:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:02,518 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-19 06:10:02,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:10:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-19 06:10:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:10:02,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:02,519 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:02,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:10:02,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:02,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1912983903, now seen corresponding path program 2 times [2024-11-19 06:10:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:02,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084300365] [2024-11-19 06:10:02,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:10:02,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:02,554 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:10:02,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:10:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084300365] [2024-11-19 06:10:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084300365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518566063] [2024-11-19 06:10:03,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:10:03,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:03,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:03,528 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-19 06:10:03,529 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-19 06:10:03,687 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:10:03,687 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:03,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-19 06:10:03,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:03,765 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-19 06:10:03,792 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 13 treesize of output 9 [2024-11-19 06:10:03,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:10:03,925 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:04,024 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:10:04,025 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 27 treesize of output 30 [2024-11-19 06:10:04,031 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 12 treesize of output 4 [2024-11-19 06:10:04,043 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 06:10:04,044 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-19 06:10:04,137 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 26 treesize of output 18 [2024-11-19 06:10:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:10:04,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:04,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:04,423 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 16 treesize of output 20 [2024-11-19 06:10:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518566063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:04,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:10:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2024-11-19 06:10:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420340366] [2024-11-19 06:10:04,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:04,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 06:10:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 06:10:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 06:10:04,482 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 24 states have internal predecessors, (53), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 06:10:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:05,768 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-19 06:10:05,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 06:10:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 24 states have internal predecessors, (53), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 49 [2024-11-19 06:10:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:05,774 INFO L225 Difference]: With dead ends: 68 [2024-11-19 06:10:05,774 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 06:10:05,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=414, Invalid=2556, Unknown=0, NotChecked=0, Total=2970 [2024-11-19 06:10:05,776 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 158 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:05,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 417 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:10:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 06:10:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-11-19 06:10:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2024-11-19 06:10:05,782 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 49 [2024-11-19 06:10:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:05,782 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-11-19 06:10:05,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 24 states have internal predecessors, (53), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 06:10:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2024-11-19 06:10:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:10:05,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:05,784 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2024-11-19 06:10:05,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:10:05,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:05,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:05,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash 708604469, now seen corresponding path program 3 times [2024-11-19 06:10:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917410675] [2024-11-19 06:10:05,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:10:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:06,022 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 06:10:06,023 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:10:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917410675] [2024-11-19 06:10:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917410675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101367024] [2024-11-19 06:10:06,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:10:06,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:06,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:06,772 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-19 06:10:06,774 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-19 06:10:06,945 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 06:10:06,945 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:06,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 06:10:06,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:06,956 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-19 06:10:06,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:10:06,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:10:07,151 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:07,161 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:07,284 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:10:07,285 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 34 treesize of output 37 [2024-11-19 06:10:07,304 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:10:07,305 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 28 treesize of output 31 [2024-11-19 06:10:07,330 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 06:10:07,331 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-19 06:10:07,729 INFO L349 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2024-11-19 06:10:07,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 103 [2024-11-19 06:10:07,775 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-19 06:10:07,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 98 [2024-11-19 06:10:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:10:08,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:08,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:08,223 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 16 treesize of output 20 [2024-11-19 06:10:08,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:08,229 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 16 treesize of output 20 [2024-11-19 06:10:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101367024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:08,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:10:08,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2024-11-19 06:10:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692870540] [2024-11-19 06:10:08,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:08,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 06:10:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 06:10:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=887, Unknown=1, NotChecked=0, Total=992 [2024-11-19 06:10:08,293 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:10:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:09,510 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2024-11-19 06:10:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-19 06:10:09,511 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-19 06:10:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:09,512 INFO L225 Difference]: With dead ends: 75 [2024-11-19 06:10:09,512 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 06:10:09,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=420, Invalid=2771, Unknown=1, NotChecked=0, Total=3192 [2024-11-19 06:10:09,513 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 169 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:09,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 338 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:10:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 06:10:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2024-11-19 06:10:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 56 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2024-11-19 06:10:09,519 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 50 [2024-11-19 06:10:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:09,520 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2024-11-19 06:10:09,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:10:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2024-11-19 06:10:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:10:09,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:09,521 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:09,537 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-19 06:10:09,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:09,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash -83662975, now seen corresponding path program 1 times [2024-11-19 06:10:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:09,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781823321] [2024-11-19 06:10:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-19 06:10:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781823321] [2024-11-19 06:10:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781823321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395214557] [2024-11-19 06:10:09,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:09,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:09,991 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-19 06:10:09,992 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-19 06:10:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:10,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:10:10,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:10,230 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 22 treesize of output 7 [2024-11-19 06:10:10,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:10,299 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 32 treesize of output 32 [2024-11-19 06:10:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 06:10:10,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:10:10,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395214557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:10:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:10:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-11-19 06:10:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755301704] [2024-11-19 06:10:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:10:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:10:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:10:10,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:10:10,341 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:10:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:10,450 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2024-11-19 06:10:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:10:10,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2024-11-19 06:10:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:10,451 INFO L225 Difference]: With dead ends: 65 [2024-11-19 06:10:10,451 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 06:10:10,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:10:10,452 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:10,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 176 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:10:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 06:10:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-19 06:10:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-19 06:10:10,457 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 52 [2024-11-19 06:10:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:10,457 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-19 06:10:10,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:10:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-19 06:10:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 06:10:10,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:10,458 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:10,473 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-19 06:10:10,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:10,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:10,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -301914566, now seen corresponding path program 4 times [2024-11-19 06:10:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693804888] [2024-11-19 06:10:10,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 06:10:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:10,707 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 06:10:10,707 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:10:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:12,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693804888] [2024-11-19 06:10:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693804888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:12,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243614652] [2024-11-19 06:10:12,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 06:10:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:12,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:12,483 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-19 06:10:12,483 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-19 06:10:12,667 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 06:10:12,667 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:12,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-19 06:10:12,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:12,690 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-19 06:10:12,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:10:12,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:10:12,806 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:12,913 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:10:12,914 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 21 treesize of output 24 [2024-11-19 06:10:12,932 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-19 06:10:12,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2024-11-19 06:10:13,055 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 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-19 06:10:13,060 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 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-19 06:10:13,162 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-19 06:10:13,162 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 22 treesize of output 27 [2024-11-19 06:10:13,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:13,183 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-11-19 06:10:13,184 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 62 treesize of output 47 [2024-11-19 06:10:13,198 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-19 06:10:13,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-19 06:10:13,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-19 06:10:13,575 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-19 06:10:13,575 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 26 [2024-11-19 06:10:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:10:13,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:13,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:13,779 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 46 treesize of output 45 [2024-11-19 06:10:13,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:13,787 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 36 treesize of output 40 [2024-11-19 06:10:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243614652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:13,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:10:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2024-11-19 06:10:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706436871] [2024-11-19 06:10:13,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:13,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 06:10:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:13,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 06:10:13,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1439, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 06:10:13,846 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:15,506 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-19 06:10:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 06:10:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2024-11-19 06:10:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:15,507 INFO L225 Difference]: With dead ends: 82 [2024-11-19 06:10:15,507 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 06:10:15,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=476, Invalid=3556, Unknown=0, NotChecked=0, Total=4032 [2024-11-19 06:10:15,509 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 234 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:15,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 392 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:10:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 06:10:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2024-11-19 06:10:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2024-11-19 06:10:15,514 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 53 [2024-11-19 06:10:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:15,514 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2024-11-19 06:10:15,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2024-11-19 06:10:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:10:15,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:15,516 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:15,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 06:10:15,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 06:10:15,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:15,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1613270677, now seen corresponding path program 1 times [2024-11-19 06:10:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:15,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806584650] [2024-11-19 06:10:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:10:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806584650] [2024-11-19 06:10:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806584650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808985400] [2024-11-19 06:10:16,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:16,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:16,567 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:16,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:10:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:16,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-19 06:10:16,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:16,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:10:16,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:10:16,946 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:17,021 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:10:17,021 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 21 treesize of output 24 [2024-11-19 06:10:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:10:17,458 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 06:10:17,458 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 26 [2024-11-19 06:10:17,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 06:10:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:10:17,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:18,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:18,073 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 16 treesize of output 20 [2024-11-19 06:10:22,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:22,307 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 18 treesize of output 22 [2024-11-19 06:10:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:10:22,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808985400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:10:22,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:10:22,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 57 [2024-11-19 06:10:22,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70245061] [2024-11-19 06:10:22,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:22,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-19 06:10:22,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:22,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-19 06:10:22,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3003, Unknown=2, NotChecked=0, Total=3192 [2024-11-19 06:10:22,744 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 57 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 52 states have internal predecessors, (107), 4 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-19 06:10:27,380 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 [1] [2024-11-19 06:10:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:29,037 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-19 06:10:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 06:10:29,037 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 52 states have internal predecessors, (107), 4 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 54 [2024-11-19 06:10:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:29,038 INFO L225 Difference]: With dead ends: 82 [2024-11-19 06:10:29,038 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 06:10:29,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=665, Invalid=6473, Unknown=2, NotChecked=0, Total=7140 [2024-11-19 06:10:29,041 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 192 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 42 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:29,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 696 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1127 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2024-11-19 06:10:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 06:10:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-19 06:10:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-11-19 06:10:29,049 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 54 [2024-11-19 06:10:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:29,049 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-11-19 06:10:29,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 52 states have internal predecessors, (107), 4 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-19 06:10:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-11-19 06:10:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 06:10:29,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:29,051 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:29,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:10:29,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:29,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:29,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708587, now seen corresponding path program 5 times [2024-11-19 06:10:29,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16263027] [2024-11-19 06:10:29,253 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 06:10:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:29,285 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-19 06:10:29,286 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 39 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:10:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16263027] [2024-11-19 06:10:30,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16263027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528576391] [2024-11-19 06:10:30,615 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 06:10:30,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:30,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:30,616 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:30,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:10:30,822 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-19 06:10:30,822 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:30,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-11-19 06:10:30,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:30,834 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-19 06:10:30,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-19 06:10:31,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:10:31,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:10:31,190 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-19 06:10:31,190 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 21 treesize of output 29 [2024-11-19 06:10:31,199 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 20 treesize of output 15 [2024-11-19 06:10:31,402 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:31,411 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:31,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,566 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 53 treesize of output 36 [2024-11-19 06:10:31,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,585 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2024-11-19 06:10:31,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2024-11-19 06:10:31,596 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 24 treesize of output 19 [2024-11-19 06:10:31,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,603 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 20 treesize of output 15 [2024-11-19 06:10:31,759 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:31,767 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:31,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,941 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-19 06:10:31,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 76 [2024-11-19 06:10:31,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,958 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-11-19 06:10:31,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2024-11-19 06:10:31,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:31,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-19 06:10:31,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-19 06:10:32,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:32,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:32,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:32,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-11-19 06:10:32,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2024-11-19 06:10:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:10:32,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:33,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:33,553 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 171 treesize of output 156 [2024-11-19 06:10:33,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:33,563 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 150 treesize of output 138 [2024-11-19 06:10:33,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528576391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:33,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:10:33,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 48 [2024-11-19 06:10:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384029660] [2024-11-19 06:10:33,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-19 06:10:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:33,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-19 06:10:33,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2999, Unknown=0, NotChecked=0, Total=3192 [2024-11-19 06:10:33,681 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 48 states, 48 states have (on average 1.75) internal successors, (84), 43 states have internal predecessors, (84), 6 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 06:10:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:37,019 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-19 06:10:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:10:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.75) internal successors, (84), 43 states have internal predecessors, (84), 6 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 56 [2024-11-19 06:10:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:37,020 INFO L225 Difference]: With dead ends: 88 [2024-11-19 06:10:37,020 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 06:10:37,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=599, Invalid=7411, Unknown=0, NotChecked=0, Total=8010 [2024-11-19 06:10:37,022 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 167 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:37,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 359 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 06:10:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 06:10:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2024-11-19 06:10:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 60 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-19 06:10:37,026 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 56 [2024-11-19 06:10:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:37,026 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-19 06:10:37,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.75) internal successors, (84), 43 states have internal predecessors, (84), 6 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 06:10:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-19 06:10:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 06:10:37,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:37,027 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:37,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:10:37,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 06:10:37,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:37,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1967540198, now seen corresponding path program 2 times [2024-11-19 06:10:37,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:37,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317842526] [2024-11-19 06:10:37,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:10:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:37,251 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:10:37,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 06:10:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317842526] [2024-11-19 06:10:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317842526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369085573] [2024-11-19 06:10:38,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:10:38,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:38,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:38,242 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:38,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 06:10:38,425 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:10:38,425 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:38,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-19 06:10:38,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:38,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-19 06:10:38,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:10:38,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:10:42,539 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from false [2024-11-19 06:10:42,542 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from true [2024-11-19 06:10:46,660 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_search_list_~l#1.offset| 0) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| c_~head~0.base) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from false [2024-11-19 06:10:46,663 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_search_list_~l#1.offset| 0) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| c_~head~0.base) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from true [2024-11-19 06:10:50,743 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from false [2024-11-19 06:10:50,745 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from true [2024-11-19 06:10:54,808 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from false [2024-11-19 06:10:54,811 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from true [2024-11-19 06:10:54,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:54,907 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 33 treesize of output 33 [2024-11-19 06:10:54,921 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= .cse2 c_~head~0.base)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from false [2024-11-19 06:10:54,923 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= .cse2 c_~head~0.base)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from true [2024-11-19 06:10:58,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |#memory_int#1| .cse1))) (= .cse1 c_~head~0.base))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from false [2024-11-19 06:10:58,958 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |#memory_int#1| .cse1))) (= .cse1 c_~head~0.base))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from true [2024-11-19 06:10:58,995 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= 0 |c_ULTIMATE.start_search_list_#res#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_search_list_#res#1.base|)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |#memory_int#1| .cse1))) (= .cse1 c_~head~0.base) (= (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|) 0) 2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2) |c_ULTIMATE.start_search_list_#res#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2) |c_ULTIMATE.start_search_list_#res#1.offset|)))))) is different from false [2024-11-19 06:10:58,998 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= 0 |c_ULTIMATE.start_search_list_#res#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_search_list_#res#1.base|)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |#memory_int#1| .cse1))) (= .cse1 c_~head~0.base) (= (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|) 0) 2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2) |c_ULTIMATE.start_search_list_#res#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2) |c_ULTIMATE.start_search_list_#res#1.offset|)))))) is different from true [2024-11-19 06:11:03,050 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse5 .cse4))) (and (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= (select (select |#memory_int#1| .cse0) 0) 2) (= .cse2 c_~head~0.base)))) (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse6 (select .cse3 .cse7))) (and (not (= .cse6 0)) (= (select .cse5 .cse7) |c_ULTIMATE.start_main_~temp~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse8 (select .cse5 .cse9))) (and (= .cse8 |c_ULTIMATE.start_main_~temp~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_main_~temp~0#1.offset|) (not (= .cse1 .cse8)))))))))) is different from false [2024-11-19 06:11:03,054 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse5 .cse4))) (and (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= (select (select |#memory_int#1| .cse0) 0) 2) (= .cse2 c_~head~0.base)))) (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse6 (select .cse3 .cse7))) (and (not (= .cse6 0)) (= (select .cse5 .cse7) |c_ULTIMATE.start_main_~temp~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse8 (select .cse5 .cse9))) (and (= .cse8 |c_ULTIMATE.start_main_~temp~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_main_~temp~0#1.offset|) (not (= .cse1 .cse8)))))))))) is different from true [2024-11-19 06:11:07,157 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse3 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse0 0)) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse7 (select .cse1 .cse4))) (and (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= (select (select |#memory_int#1| .cse7) 0) 2) (= .cse6 c_~head~0.base)))) (= .cse7 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse3 .cse8) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse5 .cse9)) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from false [2024-11-19 06:11:07,159 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse3 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse0 0)) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse7 (select .cse1 .cse4))) (and (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= (select (select |#memory_int#1| .cse7) 0) 2) (= .cse6 c_~head~0.base)))) (= .cse7 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse3 .cse8) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse5 .cse9)) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from true [2024-11-19 06:11:11,225 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse5 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse3 (select |#memory_int#1| .cse3))) (= 2 (select (select |#memory_int#1| .cse0) 0)) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse3) (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse4) 0) 1)))))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse6 (select .cse5 .cse7))) (and (= .cse6 |c_ULTIMATE.start_delete_list_~l#1.base|) (= (select .cse1 .cse7) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse4 .cse6)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse5 .cse8) |c_ULTIMATE.start_delete_list_~l#1.base|) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse9 0))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)) is different from false [2024-11-19 06:11:11,228 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse5 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse3 (select |#memory_int#1| .cse3))) (= 2 (select (select |#memory_int#1| .cse0) 0)) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse3) (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse4) 0) 1)))))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse6 (select .cse5 .cse7))) (and (= .cse6 |c_ULTIMATE.start_delete_list_~l#1.base|) (= (select .cse1 .cse7) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse4 .cse6)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse5 .cse8) |c_ULTIMATE.start_delete_list_~l#1.base|) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse9 0))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)) is different from true [2024-11-19 06:11:11,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:11:11,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 152 [2024-11-19 06:11:11,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:11:11,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 125 [2024-11-19 06:11:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 9 not checked. [2024-11-19 06:11:13,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:11:13,859 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 75 treesize of output 63 [2024-11-19 06:11:13,864 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 28 treesize of output 22 [2024-11-19 06:11:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369085573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:11:13,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:11:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 31 [2024-11-19 06:11:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727954306] [2024-11-19 06:11:13,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:11:13,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:11:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:11:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:11:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=965, Unknown=24, NotChecked=710, Total=1806 [2024-11-19 06:11:13,952 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:11:18,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse3 (= .cse1 0))) (and (or (= (select .cse0 .cse1) 1) (and (= .cse2 c_~head~0.base) .cse3)) (= c_~head~0.offset 0) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse2) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base)))) (= (select .cse0 0) 1)) .cse3))) is different from false [2024-11-19 06:11:18,230 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse3 (= .cse1 0))) (and (or (= (select .cse0 .cse1) 1) (and (= .cse2 c_~head~0.base) .cse3)) (= c_~head~0.offset 0) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse2) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base)))) (= (select .cse0 0) 1)) .cse3))) is different from true