./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-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 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:11:43,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:11:43,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:11:43,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:11:43,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:11:44,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:11:44,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:11:44,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:11:44,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:11:44,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:11:44,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:11:44,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:11:44,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:11:44,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:11:44,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:11:44,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:11:44,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:11:44,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:11:44,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:11:44,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:11:44,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:11:44,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:11:44,031 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:11:44,032 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:11:44,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:11:44,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:11:44,033 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:11:44,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:11:44,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:11:44,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:11:44,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:11:44,034 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:11:44,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:11:44,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:11:44,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:11:44,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:11:44,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:11:44,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:11:44,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:11:44,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:11:44,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:11:44,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:11:44,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:11:44,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:11:44,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:11:44,038 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 -> 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb [2024-11-09 07:11:44,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:11:44,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:11:44,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:11:44,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:11:44,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:11:44,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2024-11-09 07:11:45,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:11:45,964 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:11:45,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2024-11-09 07:11:45,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b714b8120/ac52bfe4477044b6b9d62c275716b1fa/FLAG946da9fa9 [2024-11-09 07:11:46,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b714b8120/ac52bfe4477044b6b9d62c275716b1fa [2024-11-09 07:11:46,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:11:46,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:11:46,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:11:46,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:11:46,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:11:46,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6cdee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46, skipping insertion in model container [2024-11-09 07:11:46,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:11:46,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:11:46,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:11:46,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:11:46,766 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:11:46,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46 WrapperNode [2024-11-09 07:11:46,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:11:46,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:11:46,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:11:46,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:11:46,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,812 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2024-11-09 07:11:46,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:11:46,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:11:46,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:11:46,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:11:46,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,850 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2024-11-09 07:11:46,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:11:46,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:11:46,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:11:46,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:11:46,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (1/1) ... [2024-11-09 07:11:46,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:11:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:46,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:11:46,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:11:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:11:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:11:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:11:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:11:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:11:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:11:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:11:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:11:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:11:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:11:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:11:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:11:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:11:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:11:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:11:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:11:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:11:47,134 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:11:47,137 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:11:47,492 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-09 07:11:47,493 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:11:47,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:11:47,505 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-09 07:11:47,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:47 BoogieIcfgContainer [2024-11-09 07:11:47,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:11:47,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:11:47,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:11:47,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:11:47,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:11:46" (1/3) ... [2024-11-09 07:11:47,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0d937f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:47, skipping insertion in model container [2024-11-09 07:11:47,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:46" (2/3) ... [2024-11-09 07:11:47,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0d937f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:47, skipping insertion in model container [2024-11-09 07:11:47,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:47" (3/3) ... [2024-11-09 07:11:47,514 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2024-11-09 07:11:47,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:11:47,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:11:47,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:11:47,581 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;@3232462d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:11:47,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:11:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 43 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:11:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:11:47,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:47,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:47,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:47,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1569916446, now seen corresponding path program 1 times [2024-11-09 07:11:47,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:47,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579549373] [2024-11-09 07:11:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:47,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:47,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579549373] [2024-11-09 07:11:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579549373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:47,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:11:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503367339] [2024-11-09 07:11:47,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:47,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:11:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:47,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:11:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:11:47,940 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 43 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:47,959 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-11-09 07:11:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:11:47,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:11:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:47,967 INFO L225 Difference]: With dead ends: 43 [2024-11-09 07:11:47,968 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 07:11:47,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:11:47,972 INFO L432 NwaCegarLoop]: 54 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, 54 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-09 07:11:47,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 07:11:47,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 07:11:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 39 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-11-09 07:11:48,000 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 7 [2024-11-09 07:11:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:48,000 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-09 07:11:48,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-11-09 07:11:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:11:48,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:48,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:48,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:11:48,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:48,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1650047025, now seen corresponding path program 1 times [2024-11-09 07:11:48,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:48,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599662269] [2024-11-09 07:11:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:48,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599662269] [2024-11-09 07:11:48,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599662269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:48,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:11:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758382247] [2024-11-09 07:11:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:48,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:11:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:11:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:11:48,252 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:48,334 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2024-11-09 07:11:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:11:48,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:11:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:48,336 INFO L225 Difference]: With dead ends: 57 [2024-11-09 07:11:48,337 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 07:11:48,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:11:48,338 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:48,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 89 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 07:11:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2024-11-09 07:11:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 42 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-11-09 07:11:48,349 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 8 [2024-11-09 07:11:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:48,349 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-11-09 07:11:48,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-11-09 07:11:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:11:48,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:48,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:48,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:11:48,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:48,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash -636741862, now seen corresponding path program 1 times [2024-11-09 07:11:48,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:48,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765206910] [2024-11-09 07:11:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:48,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:48,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:48,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765206910] [2024-11-09 07:11:48,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765206910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:48,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:48,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:11:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878274643] [2024-11-09 07:11:48,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:48,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:11:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:48,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:11:48,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:48,468 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:48,500 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-09 07:11:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:11:48,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:11:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:48,502 INFO L225 Difference]: With dead ends: 43 [2024-11-09 07:11:48,503 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 07:11:48,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:48,505 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:48,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 07:11:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 07:11:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-11-09 07:11:48,515 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 11 [2024-11-09 07:11:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:48,515 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-09 07:11:48,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2024-11-09 07:11:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:11:48,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:48,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:11:48,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:48,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1769597701, now seen corresponding path program 1 times [2024-11-09 07:11:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368746089] [2024-11-09 07:11:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:48,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:48,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368746089] [2024-11-09 07:11:48,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368746089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:48,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:48,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:11:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453029095] [2024-11-09 07:11:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:48,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:11:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:11:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:11:48,987 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:49,117 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-11-09 07:11:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:11:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:11:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:49,119 INFO L225 Difference]: With dead ends: 50 [2024-11-09 07:11:49,119 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 07:11:49,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:11:49,120 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:49,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 110 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 07:11:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-09 07:11:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 46 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-09 07:11:49,129 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 12 [2024-11-09 07:11:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:49,130 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-09 07:11:49,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-09 07:11:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:11:49,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:49,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:49,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:11:49,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash -492403746, now seen corresponding path program 1 times [2024-11-09 07:11:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620324049] [2024-11-09 07:11:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:49,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:49,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620324049] [2024-11-09 07:11:49,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620324049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:49,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:49,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:11:49,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248180126] [2024-11-09 07:11:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:49,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:11:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:49,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:11:49,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:49,206 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:49,233 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-09 07:11:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:11:49,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:11:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:49,234 INFO L225 Difference]: With dead ends: 47 [2024-11-09 07:11:49,235 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 07:11:49,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:49,237 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:49,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 07:11:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 07:11:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-11-09 07:11:49,248 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 12 [2024-11-09 07:11:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:49,248 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-11-09 07:11:49,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-11-09 07:11:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:11:49,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:49,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:11:49,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:49,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1923976115, now seen corresponding path program 1 times [2024-11-09 07:11:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:49,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318414165] [2024-11-09 07:11:49,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:49,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:49,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:49,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318414165] [2024-11-09 07:11:49,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318414165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:49,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017973794] [2024-11-09 07:11:49,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:49,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:49,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:49,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:49,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:11:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:49,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:11:49,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:49,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-11-09 07:11:49,852 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2024-11-09 07:11:49,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 46 [2024-11-09 07:11:49,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:49,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 07:11:49,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 07:11:50,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:50,017 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 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 07:11:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:50,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:50,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017973794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:50,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:50,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2024-11-09 07:11:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009289595] [2024-11-09 07:11:50,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:50,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:11:50,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:11:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:11:50,072 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:50,203 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2024-11-09 07:11:50,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:11:50,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:11:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:50,204 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:11:50,204 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 07:11:50,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:11:50,205 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:50,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 07:11:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2024-11-09 07:11:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-09 07:11:50,209 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 13 [2024-11-09 07:11:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:50,210 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-09 07:11:50,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-09 07:11:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:11:50,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:50,210 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:50,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:11:50,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 07:11:50,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:50,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash 371173507, now seen corresponding path program 1 times [2024-11-09 07:11:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:50,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580427720] [2024-11-09 07:11:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580427720] [2024-11-09 07:11:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580427720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202474898] [2024-11-09 07:11:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:51,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:51,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:51,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:51,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:11:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:51,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 07:11:51,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:51,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-09 07:11:51,346 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-09 07:11:51,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 90 [2024-11-09 07:11:51,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2024-11-09 07:11:51,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2024-11-09 07:11:51,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:51,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:51,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:51,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 07:11:51,386 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:11:51,386 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 122 treesize of output 112 [2024-11-09 07:11:51,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2024-11-09 07:11:51,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2024-11-09 07:11:51,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2024-11-09 07:11:51,772 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 07:11:51,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 70 [2024-11-09 07:11:51,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 69 [2024-11-09 07:11:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:52,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202474898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:52,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-11-09 07:11:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306953986] [2024-11-09 07:11:52,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:52,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:11:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:52,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:11:52,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:11:52,527 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:53,185 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-11-09 07:11:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:11:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:11:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:53,186 INFO L225 Difference]: With dead ends: 70 [2024-11-09 07:11:53,187 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 07:11:53,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:11:53,188 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 60 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:53,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 209 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:11:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 07:11:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-11-09 07:11:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2024-11-09 07:11:53,196 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2024-11-09 07:11:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:53,196 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2024-11-09 07:11:53,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2024-11-09 07:11:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:11:53,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:53,197 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:53,214 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-09 07:11:53,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 07:11:53,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash 616942255, now seen corresponding path program 1 times [2024-11-09 07:11:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149745951] [2024-11-09 07:11:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:53,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:53,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149745951] [2024-11-09 07:11:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149745951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:53,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381879810] [2024-11-09 07:11:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:53,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:53,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:53,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:53,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:11:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:53,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:11:53,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:53,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:53,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:53,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:53,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:53,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-09 07:11:53,811 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 43 treesize of output 22 [2024-11-09 07:11:53,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2024-11-09 07:11:53,866 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:11:53,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:11:53,892 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:11:53,892 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 16 treesize of output 18 [2024-11-09 07:11:53,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:11:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:54,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:11:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381879810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:54,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:11:54,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-11-09 07:11:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294948469] [2024-11-09 07:11:54,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:54,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:11:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:11:54,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:11:54,023 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:54,291 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-11-09 07:11:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:11:54,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:11:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:54,292 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:11:54,293 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:11:54,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:11:54,294 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 82 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:54,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 153 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:11:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:11:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2024-11-09 07:11:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2024-11-09 07:11:54,299 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 18 [2024-11-09 07:11:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:54,299 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2024-11-09 07:11:54,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2024-11-09 07:11:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:11:54,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:54,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:54,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:11:54,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:54,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:54,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1969514127, now seen corresponding path program 2 times [2024-11-09 07:11:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547800103] [2024-11-09 07:11:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547800103] [2024-11-09 07:11:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547800103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331251866] [2024-11-09 07:11:54,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:11:54,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:54,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:54,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:54,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:11:55,145 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:11:55,145 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:11:55,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 07:11:55,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:55,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-09 07:11:55,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 26 [2024-11-09 07:11:55,201 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2024-11-09 07:11:55,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 137 [2024-11-09 07:11:55,209 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 10 treesize of output 8 [2024-11-09 07:11:55,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2024-11-09 07:11:55,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:55,226 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2024-11-09 07:11:55,227 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 1 case distinctions, treesize of input 52 treesize of output 28 [2024-11-09 07:11:55,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:55,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:55,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-09 07:11:55,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:55,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 07:11:55,380 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:11:55,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 40 [2024-11-09 07:11:55,450 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 15 treesize of output 7 [2024-11-09 07:11:55,504 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 07:11:55,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 50 [2024-11-09 07:11:55,591 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-09 07:11:55,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 29 [2024-11-09 07:11:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:55,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:55,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331251866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:55,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:55,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-11-09 07:11:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209706180] [2024-11-09 07:11:55,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:55,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:11:55,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:55,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:11:55,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:11:55,671 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:55,971 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2024-11-09 07:11:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:11:55,971 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:11:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:55,972 INFO L225 Difference]: With dead ends: 79 [2024-11-09 07:11:55,972 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 07:11:55,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:11:55,973 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:55,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 252 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:11:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 07:11:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2024-11-09 07:11:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 67 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2024-11-09 07:11:55,984 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 18 [2024-11-09 07:11:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:55,984 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2024-11-09 07:11:55,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2024-11-09 07:11:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:11:55,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:55,986 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:56,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:11:56,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:56,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:56,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:56,187 INFO L85 PathProgramCache]: Analyzing trace with hash 682041876, now seen corresponding path program 1 times [2024-11-09 07:11:56,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:56,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346283324] [2024-11-09 07:11:56,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:56,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346283324] [2024-11-09 07:11:56,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346283324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882787212] [2024-11-09 07:11:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:56,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:56,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:56,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:56,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:11:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:56,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 07:11:56,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:56,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-09 07:11:56,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2024-11-09 07:11:56,642 INFO L349 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2024-11-09 07:11:56,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 70 [2024-11-09 07:11:56,660 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2024-11-09 07:11:56,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 98 [2024-11-09 07:11:56,667 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 10 treesize of output 8 [2024-11-09 07:11:56,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:11:56,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:56,740 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:11:56,740 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 74 treesize of output 55 [2024-11-09 07:11:56,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:56,766 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-09 07:11:56,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-09 07:11:56,831 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:11:56,831 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 72 treesize of output 53 [2024-11-09 07:11:56,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:11:56,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 26 [2024-11-09 07:11:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:56,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:56,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_987 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2024-11-09 07:11:56,976 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_987 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_987) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) is different from false [2024-11-09 07:11:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882787212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:56,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-09 07:11:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922223446] [2024-11-09 07:11:56,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:56,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:11:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:56,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:11:56,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2024-11-09 07:11:56,996 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:57,449 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2024-11-09 07:11:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:11:57,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:11:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:57,450 INFO L225 Difference]: With dead ends: 175 [2024-11-09 07:11:57,450 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 07:11:57,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=239, Unknown=2, NotChecked=70, Total=420 [2024-11-09 07:11:57,451 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 331 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:57,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 214 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 134 Invalid, 0 Unknown, 265 Unchecked, 0.2s Time] [2024-11-09 07:11:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 07:11:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 114. [2024-11-09 07:11:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 1.2545454545454546) internal successors, (138), 112 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2024-11-09 07:11:57,457 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 19 [2024-11-09 07:11:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:57,457 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2024-11-09 07:11:57,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2024-11-09 07:11:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:11:57,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:57,458 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:57,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:11:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:11:57,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -392229223, now seen corresponding path program 2 times [2024-11-09 07:11:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599631652] [2024-11-09 07:11:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599631652] [2024-11-09 07:11:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599631652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127559163] [2024-11-09 07:11:58,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:11:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:58,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:58,080 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-09 07:11:58,081 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-09 07:11:58,534 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:11:58,534 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:11:58,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 07:11:58,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:58,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-09 07:11:58,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-09 07:11:58,590 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-09 07:11:58,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 78 [2024-11-09 07:11:58,625 INFO L349 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2024-11-09 07:11:58,625 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 4 case distinctions, treesize of input 83 treesize of output 70 [2024-11-09 07:11:58,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2024-11-09 07:11:58,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2024-11-09 07:11:58,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2024-11-09 07:11:58,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,736 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:11:58,737 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 82 treesize of output 59 [2024-11-09 07:11:58,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,760 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-09 07:11:58,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-09 07:11:58,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-09 07:11:58,854 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:11:58,854 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 80 treesize of output 57 [2024-11-09 07:11:58,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-09 07:11:59,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:59,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-09 07:11:59,115 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:11:59,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-09 07:11:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:59,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:59,192 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1139))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2024-11-09 07:11:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:59,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127559163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:59,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:59,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-09 07:11:59,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875812648] [2024-11-09 07:11:59,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:59,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:11:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:11:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2024-11-09 07:11:59,262 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:12:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:00,069 INFO L93 Difference]: Finished difference Result 203 states and 255 transitions. [2024-11-09 07:12:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:12:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:12:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:00,071 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:12:00,071 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 07:12:00,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=659, Unknown=1, NotChecked=56, Total=930 [2024-11-09 07:12:00,072 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 421 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:00,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 271 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 278 Invalid, 0 Unknown, 143 Unchecked, 0.3s Time] [2024-11-09 07:12:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 07:12:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 135. [2024-11-09 07:12:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 133 states have internal predecessors, (167), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:12:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2024-11-09 07:12:00,079 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 21 [2024-11-09 07:12:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:00,079 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2024-11-09 07:12:00,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:12:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2024-11-09 07:12:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:12:00,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:00,080 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:12:00,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:12:00,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:00,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash -477451835, now seen corresponding path program 2 times [2024-11-09 07:12:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:00,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575331281] [2024-11-09 07:12:00,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:00,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:12:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575331281] [2024-11-09 07:12:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575331281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:12:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485079674] [2024-11-09 07:12:01,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:12:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:12:01,327 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-09 07:12:01,328 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-09 07:12:01,645 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:12:01,645 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:12:01,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 07:12:01,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:12:01,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-09 07:12:01,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-09 07:12:01,699 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-09 07:12:01,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 84 [2024-11-09 07:12:01,712 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-09 07:12:01,713 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 59 treesize of output 43 [2024-11-09 07:12:01,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:01,722 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 41 treesize of output 45 [2024-11-09 07:12:01,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2024-11-09 07:12:01,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 15 [2024-11-09 07:12:01,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:12:01,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 15 [2024-11-09 07:12:01,919 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-09 07:12:01,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 99 treesize of output 73 [2024-11-09 07:12:01,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:01,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2024-11-09 07:12:02,200 INFO L349 Elim1Store]: treesize reduction 87, result has 14.7 percent of original size [2024-11-09 07:12:02,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 106 treesize of output 76 [2024-11-09 07:12:02,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:02,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2024-11-09 07:12:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:12:02,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:12:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:12:02,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485079674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:12:02,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:12:02,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2024-11-09 07:12:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69421566] [2024-11-09 07:12:02,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:12:02,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:12:02,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:02,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:12:02,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:12:02,797 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:12:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:12:03,569 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2024-11-09 07:12:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:12:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:12:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:12:03,571 INFO L225 Difference]: With dead ends: 158 [2024-11-09 07:12:03,571 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 07:12:03,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:12:03,572 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:12:03,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 322 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:12:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 07:12:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2024-11-09 07:12:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 136 states have (on average 1.2647058823529411) internal successors, (172), 138 states have internal predecessors, (172), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:12:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2024-11-09 07:12:03,577 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 22 [2024-11-09 07:12:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:12:03,577 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2024-11-09 07:12:03,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:12:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2024-11-09 07:12:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:12:03,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:12:03,579 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:12:03,596 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-09 07:12:03,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:03,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:12:03,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:12:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1974604322, now seen corresponding path program 3 times [2024-11-09 07:12:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:12:03,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685021328] [2024-11-09 07:12:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:12:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:12:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:12:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:12:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:12:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685021328] [2024-11-09 07:12:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685021328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:12:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524160827] [2024-11-09 07:12:04,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:12:04,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:12:04,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:12:04,272 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-09 07:12:04,274 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-09 07:12:04,998 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 07:12:04,999 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:12:05,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-09 07:12:05,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:12:05,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2024-11-09 07:12:05,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:05,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2024-11-09 07:12:05,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-11-09 07:12:05,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-09 07:12:05,081 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2024-11-09 07:12:05,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 82 [2024-11-09 07:12:05,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:05,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:05,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:05,102 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:12:05,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-09 07:12:05,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:05,112 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 29 treesize of output 11 [2024-11-09 07:12:05,119 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:12:05,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 07:12:05,171 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:12:05,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:12:05,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:05,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:05,185 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:12:05,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 07:12:05,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:12:05,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-09 07:12:05,209 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-09 07:12:05,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 07:12:05,261 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:12:05,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-09 07:12:05,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-09 07:12:05,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:12:05,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:12:05,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:12:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:12:05,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:12:09,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|ULTIMATE.start_main_~bcki~0#1.base| Int)) (not (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (select (select |c_#memory_int#1| |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|))))) is different from false [2024-11-09 07:12:09,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:09,952 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 67 treesize of output 60 [2024-11-09 07:12:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-09 07:12:10,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524160827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:12:10,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:12:10,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 24 [2024-11-09 07:12:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708011099] [2024-11-09 07:12:10,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:12:10,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:12:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:12:10,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:12:10,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=4, NotChecked=42, Total=552 [2024-11-09 07:12:10,069 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:12:15,007 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-09 07:12:19,011 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-09 07:12:23,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse4 (select .cse5 0)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse1 (forall ((|v_ULTIMATE.start_main_~bcki~0#1.base_81| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_69| Int)) (not (= .cse2 (select (select |c_#memory_int#1| |v_ULTIMATE.start_main_~bcki~0#1.base_81|) (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_69| 8)))))) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (and (= (select .cse0 0) 0) (or .cse1 (= .cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse3 8) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (not (= .cse4 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= (select (select |c_#memory_int#1| .cse4) 8) 1) (or (= .cse2 (select (select |c_#memory_int#1| (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8))) .cse1 (= .cse2 (select .cse3 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8))))))) is different from false [2024-11-09 07:12:27,037 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-09 07:12:31,041 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-09 07:12:35,046 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-09 07:12:39,049 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-09 07:12:43,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:12:47,058 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-09 07:12:51,063 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-09 07:12:55,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:12:59,080 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-09 07:13:03,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:13:07,089 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-09 07:13:11,091 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-09 07:13:15,096 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-09 07:13:19,100 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]