./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:08:33,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:08:33,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:08:33,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:08:33,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:08:33,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:08:33,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:08:33,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:08:33,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:08:33,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:08:33,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:08:33,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:08:33,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:08:33,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:08:33,116 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:08:33,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:08:33,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:08:33,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:08:33,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:08:33,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:08:33,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:08:33,121 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:08:33,121 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:08:33,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:08:33,122 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:08:33,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:08:33,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:08:33,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:08:33,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:08:33,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:08:33,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:08:33,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:08:33,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:08:33,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:08:33,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:08:33,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:08:33,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:08:33,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:08:33,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:08:33,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:08:33,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:08:33,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:08:33,128 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2024-10-14 18:08:33,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:08:33,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:08:33,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:08:33,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:08:33,367 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:08:33,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i [2024-10-14 18:08:34,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:08:34,911 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:08:34,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i [2024-10-14 18:08:34,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d5e8c70/4d503ada494244a5a141410c18b26f25/FLAG405966df1 [2024-10-14 18:08:35,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d5e8c70/4d503ada494244a5a141410c18b26f25 [2024-10-14 18:08:35,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:08:35,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:08:35,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:08:35,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:08:35,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:08:35,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b72c3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35, skipping insertion in model container [2024-10-14 18:08:35,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:08:35,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:08:35,577 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:08:35,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:08:35,653 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:08:35,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35 WrapperNode [2024-10-14 18:08:35,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:08:35,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:08:35,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:08:35,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:08:35,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,695 INFO L138 Inliner]: procedures = 119, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2024-10-14 18:08:35,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:08:35,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:08:35,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:08:35,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:08:35,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,728 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-10-14 18:08:35,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:08:35,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:08:35,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:08:35,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:08:35,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (1/1) ... [2024-10-14 18:08:35,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:08:35,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:35,772 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-10-14 18:08:35,775 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-10-14 18:08:35,814 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 18:08:35,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 18:08:35,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 18:08:35,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 18:08:35,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:08:35,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:08:35,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:08:35,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:08:35,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:08:35,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:08:35,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:08:35,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:08:35,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:08:35,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:08:35,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:08:35,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:08:35,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:08:35,914 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:08:35,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:08:36,265 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-10-14 18:08:36,266 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:08:36,319 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:08:36,319 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-14 18:08:36,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:08:36 BoogieIcfgContainer [2024-10-14 18:08:36,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:08:36,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:08:36,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:08:36,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:08:36,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:08:35" (1/3) ... [2024-10-14 18:08:36,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd5e5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:08:36, skipping insertion in model container [2024-10-14 18:08:36,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:35" (2/3) ... [2024-10-14 18:08:36,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd5e5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:08:36, skipping insertion in model container [2024-10-14 18:08:36,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:08:36" (3/3) ... [2024-10-14 18:08:36,332 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2024-10-14 18:08:36,346 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:08:36,347 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2024-10-14 18:08:36,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:08:36,394 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;@7cc7e641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:08:36,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-10-14 18:08:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 94 states have (on average 2.276595744680851) internal successors, (214), 157 states have internal predecessors, (214), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 18:08:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 18:08:36,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:36,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 18:08:36,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:36,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash 15978, now seen corresponding path program 1 times [2024-10-14 18:08:36,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056691026] [2024-10-14 18:08:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056691026] [2024-10-14 18:08:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056691026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:36,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 18:08:36,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146105272] [2024-10-14 18:08:36,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:36,620 INFO L87 Difference]: Start difference. First operand has 173 states, 94 states have (on average 2.276595744680851) internal successors, (214), 157 states have internal predecessors, (214), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 18:08:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:36,782 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2024-10-14 18:08:36,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:36,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-14 18:08:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:36,792 INFO L225 Difference]: With dead ends: 148 [2024-10-14 18:08:36,793 INFO L226 Difference]: Without dead ends: 147 [2024-10-14 18:08:36,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 18:08:36,797 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:36,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 103 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-14 18:08:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-14 18:08:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 81 states have (on average 1.9506172839506173) internal successors, (158), 145 states have internal predecessors, (158), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2024-10-14 18:08:36,828 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 2 [2024-10-14 18:08:36,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:36,828 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2024-10-14 18:08:36,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 18:08:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2024-10-14 18:08:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 18:08:36,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:36,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 18:08:36,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:08:36,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:36,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 15979, now seen corresponding path program 1 times [2024-10-14 18:08:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:36,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060058355] [2024-10-14 18:08:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060058355] [2024-10-14 18:08:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060058355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:36,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:36,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 18:08:36,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176071559] [2024-10-14 18:08:36,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:36,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:36,948 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 18:08:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:37,086 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2024-10-14 18:08:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:37,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-14 18:08:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:37,088 INFO L225 Difference]: With dead ends: 136 [2024-10-14 18:08:37,088 INFO L226 Difference]: Without dead ends: 136 [2024-10-14 18:08:37,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 18:08:37,090 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 127 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:37,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 107 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-14 18:08:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-14 18:08:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 81 states have (on average 1.8024691358024691) internal successors, (146), 134 states have internal predecessors, (146), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2024-10-14 18:08:37,104 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 2 [2024-10-14 18:08:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:37,104 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2024-10-14 18:08:37,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 18:08:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2024-10-14 18:08:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 18:08:37,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:37,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:37,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:08:37,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:37,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2125466043, now seen corresponding path program 1 times [2024-10-14 18:08:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:37,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033503941] [2024-10-14 18:08:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:37,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:37,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033503941] [2024-10-14 18:08:37,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033503941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:37,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:37,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:08:37,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234182555] [2024-10-14 18:08:37,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:37,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:08:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:37,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:08:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:08:37,292 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-14 18:08:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:37,441 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2024-10-14 18:08:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:08:37,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-14 18:08:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:37,443 INFO L225 Difference]: With dead ends: 138 [2024-10-14 18:08:37,443 INFO L226 Difference]: Without dead ends: 138 [2024-10-14 18:08:37,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-14 18:08:37,444 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:37,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 111 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-14 18:08:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2024-10-14 18:08:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 87 states have (on average 1.7241379310344827) internal successors, (150), 134 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 164 transitions. [2024-10-14 18:08:37,459 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 164 transitions. Word has length 7 [2024-10-14 18:08:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:37,459 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 164 transitions. [2024-10-14 18:08:37,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-14 18:08:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 164 transitions. [2024-10-14 18:08:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 18:08:37,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:37,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:37,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:08:37,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2125466042, now seen corresponding path program 1 times [2024-10-14 18:08:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940302741] [2024-10-14 18:08:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:37,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940302741] [2024-10-14 18:08:37,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940302741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:37,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:37,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:08:37,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464949973] [2024-10-14 18:08:37,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:37,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:08:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:37,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:08:37,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:08:37,653 INFO L87 Difference]: Start difference. First operand 136 states and 164 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-10-14 18:08:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:37,855 INFO L93 Difference]: Finished difference Result 209 states and 251 transitions. [2024-10-14 18:08:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:08:37,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-10-14 18:08:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:37,856 INFO L225 Difference]: With dead ends: 209 [2024-10-14 18:08:37,858 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 18:08:37,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:08:37,859 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 538 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:37,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 144 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:08:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 18:08:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 142. [2024-10-14 18:08:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.6989247311827957) internal successors, (158), 140 states have internal predecessors, (158), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2024-10-14 18:08:37,875 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 7 [2024-10-14 18:08:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:37,875 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2024-10-14 18:08:37,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-10-14 18:08:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2024-10-14 18:08:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:08:37,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:37,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:37,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:08:37,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:37,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 945106439, now seen corresponding path program 1 times [2024-10-14 18:08:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33464776] [2024-10-14 18:08:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33464776] [2024-10-14 18:08:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33464776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:37,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:37,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:08:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517407258] [2024-10-14 18:08:37,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:37,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:37,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:37,914 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-10-14 18:08:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:37,948 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2024-10-14 18:08:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2024-10-14 18:08:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:37,949 INFO L225 Difference]: With dead ends: 137 [2024-10-14 18:08:37,949 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 18:08:37,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-14 18:08:37,966 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 112 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:37,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 133 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:08:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 18:08:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-14 18:08:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 93 states have (on average 1.6344086021505377) internal successors, (152), 135 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2024-10-14 18:08:37,979 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 10 [2024-10-14 18:08:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:37,979 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2024-10-14 18:08:37,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-10-14 18:08:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2024-10-14 18:08:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 18:08:37,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:37,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:37,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 18:08:37,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:37,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1831998218, now seen corresponding path program 1 times [2024-10-14 18:08:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587209997] [2024-10-14 18:08:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:38,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:38,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587209997] [2024-10-14 18:08:38,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587209997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:38,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:38,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:08:38,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303877574] [2024-10-14 18:08:38,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:38,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:08:38,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:38,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:08:38,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:08:38,083 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-10-14 18:08:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:38,204 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2024-10-14 18:08:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:08:38,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-10-14 18:08:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:38,205 INFO L225 Difference]: With dead ends: 136 [2024-10-14 18:08:38,205 INFO L226 Difference]: Without dead ends: 136 [2024-10-14 18:08:38,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10-14 18:08:38,206 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 3 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:38,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 384 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-14 18:08:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-14 18:08:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 93 states have (on average 1.6129032258064515) internal successors, (150), 134 states have internal predecessors, (150), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2024-10-14 18:08:38,215 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 9 [2024-10-14 18:08:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:38,215 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2024-10-14 18:08:38,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-10-14 18:08:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2024-10-14 18:08:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 18:08:38,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:38,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:38,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 18:08:38,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:38,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1831998219, now seen corresponding path program 1 times [2024-10-14 18:08:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254424862] [2024-10-14 18:08:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254424862] [2024-10-14 18:08:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254424862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:38,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:08:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574332300] [2024-10-14 18:08:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:08:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:08:38,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:08:38,365 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-10-14 18:08:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:38,503 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2024-10-14 18:08:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:08:38,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-10-14 18:08:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:38,504 INFO L225 Difference]: With dead ends: 135 [2024-10-14 18:08:38,504 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 18:08:38,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10-14 18:08:38,505 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:38,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 384 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 18:08:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-14 18:08:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.5913978494623655) internal successors, (148), 133 states have internal predecessors, (148), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2024-10-14 18:08:38,517 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 9 [2024-10-14 18:08:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:38,517 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2024-10-14 18:08:38,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-10-14 18:08:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2024-10-14 18:08:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:08:38,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:38,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:38,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 18:08:38,518 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:38,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:38,519 INFO L85 PathProgramCache]: Analyzing trace with hash -385860111, now seen corresponding path program 1 times [2024-10-14 18:08:38,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:38,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226997633] [2024-10-14 18:08:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:38,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226997633] [2024-10-14 18:08:38,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226997633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:38,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:08:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319356460] [2024-10-14 18:08:38,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:38,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:08:38,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:38,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:08:38,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:08:38,713 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-10-14 18:08:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:38,917 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2024-10-14 18:08:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:08:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2024-10-14 18:08:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:38,918 INFO L225 Difference]: With dead ends: 135 [2024-10-14 18:08:38,918 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 18:08:38,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:08:38,919 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 200 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:38,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 240 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 18:08:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-10-14 18:08:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 93 states have (on average 1.5806451612903225) internal successors, (147), 132 states have internal predecessors, (147), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2024-10-14 18:08:38,926 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 11 [2024-10-14 18:08:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:38,927 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2024-10-14 18:08:38,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-10-14 18:08:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2024-10-14 18:08:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:08:38,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:38,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:38,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 18:08:38,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:38,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash -385860110, now seen corresponding path program 1 times [2024-10-14 18:08:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:38,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799710991] [2024-10-14 18:08:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:39,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799710991] [2024-10-14 18:08:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799710991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 18:08:39,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265375853] [2024-10-14 18:08:39,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:39,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:08:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:39,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:08:39,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:39,181 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-10-14 18:08:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:39,617 INFO L93 Difference]: Finished difference Result 189 states and 221 transitions. [2024-10-14 18:08:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 18:08:39,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 11 [2024-10-14 18:08:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:39,618 INFO L225 Difference]: With dead ends: 189 [2024-10-14 18:08:39,618 INFO L226 Difference]: Without dead ends: 189 [2024-10-14 18:08:39,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-14 18:08:39,619 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 275 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:39,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 515 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:08:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-14 18:08:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 121. [2024-10-14 18:08:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.528735632183908) internal successors, (133), 119 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2024-10-14 18:08:39,624 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 11 [2024-10-14 18:08:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:39,624 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2024-10-14 18:08:39,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-10-14 18:08:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2024-10-14 18:08:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:08:39,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:39,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:39,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 18:08:39,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:39,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1590650999, now seen corresponding path program 1 times [2024-10-14 18:08:39,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:39,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956722741] [2024-10-14 18:08:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:39,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:39,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956722741] [2024-10-14 18:08:39,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956722741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:39,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:39,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:08:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746982268] [2024-10-14 18:08:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:39,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:39,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:39,653 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10-14 18:08:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:39,688 INFO L93 Difference]: Finished difference Result 170 states and 199 transitions. [2024-10-14 18:08:39,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2024-10-14 18:08:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:39,688 INFO L225 Difference]: With dead ends: 170 [2024-10-14 18:08:39,689 INFO L226 Difference]: Without dead ends: 170 [2024-10-14 18:08:39,689 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-10-14 18:08:39,689 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 40 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:39,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 220 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:08:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-14 18:08:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 134. [2024-10-14 18:08:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 100 states have (on average 1.47) internal successors, (147), 132 states have internal predecessors, (147), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2024-10-14 18:08:39,692 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 16 [2024-10-14 18:08:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:39,692 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2024-10-14 18:08:39,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10-14 18:08:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2024-10-14 18:08:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 18:08:39,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:39,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:39,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 18:08:39,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:39,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash 271995679, now seen corresponding path program 1 times [2024-10-14 18:08:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432408957] [2024-10-14 18:08:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:39,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:39,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432408957] [2024-10-14 18:08:39,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432408957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:39,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:39,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:08:39,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737365693] [2024-10-14 18:08:39,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:39,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:08:39,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:08:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:08:39,865 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-10-14 18:08:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:39,956 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2024-10-14 18:08:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:08:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-10-14 18:08:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:39,957 INFO L225 Difference]: With dead ends: 141 [2024-10-14 18:08:39,957 INFO L226 Difference]: Without dead ends: 141 [2024-10-14 18:08:39,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:08:39,958 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:39,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 418 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-14 18:08:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-10-14 18:08:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 136 states have internal predecessors, (151), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2024-10-14 18:08:39,960 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 18 [2024-10-14 18:08:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:39,960 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2024-10-14 18:08:39,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-10-14 18:08:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2024-10-14 18:08:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:08:39,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:39,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:39,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 18:08:39,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:39,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash 275840090, now seen corresponding path program 1 times [2024-10-14 18:08:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:39,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111963919] [2024-10-14 18:08:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:40,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:40,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111963919] [2024-10-14 18:08:40,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111963919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:40,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:40,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:08:40,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109352135] [2024-10-14 18:08:40,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:40,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:08:40,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:40,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:08:40,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:40,102 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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-10-14 18:08:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:40,311 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2024-10-14 18:08:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:08:40,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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-10-14 18:08:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:40,313 INFO L225 Difference]: With dead ends: 210 [2024-10-14 18:08:40,313 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 18:08:40,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 18:08:40,313 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 272 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:40,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 390 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:08:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 18:08:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 142. [2024-10-14 18:08:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 140 states have internal predecessors, (155), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2024-10-14 18:08:40,318 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 19 [2024-10-14 18:08:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:40,319 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2024-10-14 18:08:40,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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-10-14 18:08:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2024-10-14 18:08:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:08:40,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:40,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:40,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 18:08:40,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:40,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash -101384236, now seen corresponding path program 1 times [2024-10-14 18:08:40,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:40,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456526780] [2024-10-14 18:08:40,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:40,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:40,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456526780] [2024-10-14 18:08:40,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456526780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:40,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:40,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:08:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360977578] [2024-10-14 18:08:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:40,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:08:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:08:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:08:40,375 INFO L87 Difference]: Start difference. First operand 142 states and 164 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-10-14 18:08:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:40,452 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2024-10-14 18:08:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:08:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-14 18:08:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:40,454 INFO L225 Difference]: With dead ends: 142 [2024-10-14 18:08:40,454 INFO L226 Difference]: Without dead ends: 142 [2024-10-14 18:08:40,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:08:40,454 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 120 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:40,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 186 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-14 18:08:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-14 18:08:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 140 states have internal predecessors, (154), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2024-10-14 18:08:40,458 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 19 [2024-10-14 18:08:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:40,459 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2024-10-14 18:08:40,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-10-14 18:08:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2024-10-14 18:08:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 18:08:40,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:40,459 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:40,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 18:08:40,459 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:40,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash -975301181, now seen corresponding path program 1 times [2024-10-14 18:08:40,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:40,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182177125] [2024-10-14 18:08:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:40,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:40,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182177125] [2024-10-14 18:08:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182177125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:40,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297674567] [2024-10-14 18:08:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:40,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:40,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:40,547 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-10-14 18:08:40,548 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-10-14 18:08:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:40,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:08:40,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:40,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:40,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:40,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 18:08:40,712 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 27 treesize of output 11 [2024-10-14 18:08:40,726 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 18:08:40,731 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 27 treesize of output 11 [2024-10-14 18:08:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:40,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297674567] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:40,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:40,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2024-10-14 18:08:40,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948601458] [2024-10-14 18:08:40,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:40,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:08:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:40,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:08:40,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:08:40,908 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-10-14 18:08:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:41,027 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2024-10-14 18:08:41,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:08:41,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 22 [2024-10-14 18:08:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:41,028 INFO L225 Difference]: With dead ends: 163 [2024-10-14 18:08:41,028 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 18:08:41,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:08:41,028 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 17 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:41,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 366 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 18:08:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2024-10-14 18:08:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 149 states have internal predecessors, (164), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2024-10-14 18:08:41,032 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 22 [2024-10-14 18:08:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:41,032 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2024-10-14 18:08:41,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-10-14 18:08:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2024-10-14 18:08:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:08:41,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:41,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:41,047 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-10-14 18:08:41,236 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,SelfDestructingSolverStorable13 [2024-10-14 18:08:41,237 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:41,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash -169566645, now seen corresponding path program 1 times [2024-10-14 18:08:41,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:41,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002042004] [2024-10-14 18:08:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:41,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:41,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002042004] [2024-10-14 18:08:41,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002042004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682349090] [2024-10-14 18:08:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:41,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:41,306 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-10-14 18:08:41,307 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-10-14 18:08:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:41,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 18:08:41,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:41,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 18:08:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:41,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682349090] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:41,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-10-14 18:08:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901405250] [2024-10-14 18:08:41,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:08:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:41,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:08:41,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:08:41,496 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-10-14 18:08:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:41,631 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2024-10-14 18:08:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:08:41,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 23 [2024-10-14 18:08:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:41,632 INFO L225 Difference]: With dead ends: 160 [2024-10-14 18:08:41,632 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 18:08:41,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:08:41,633 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 8 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:41,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 437 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 18:08:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-14 18:08:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 109 states have (on average 1.4220183486238531) internal successors, (155), 141 states have internal predecessors, (155), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2024-10-14 18:08:41,638 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 23 [2024-10-14 18:08:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:41,638 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2024-10-14 18:08:41,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-10-14 18:08:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2024-10-14 18:08:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:08:41,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:41,639 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:41,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 18:08:41,839 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,SelfDestructingSolverStorable14 [2024-10-14 18:08:41,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:41,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1408130527, now seen corresponding path program 1 times [2024-10-14 18:08:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:41,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703049311] [2024-10-14 18:08:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:42,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703049311] [2024-10-14 18:08:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703049311] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184343693] [2024-10-14 18:08:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:42,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:42,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:42,149 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-10-14 18:08:42,150 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-10-14 18:08:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:42,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 18:08:42,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:42,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:42,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:42,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:42,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:42,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:42,378 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:42,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-10-14 18:08:42,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:42,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:08:42,432 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:08:42,432 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 24 treesize of output 17 [2024-10-14 18:08:42,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:42,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 18:08:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:42,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:42,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (or (forall ((v_ArrVal_490 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_491 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_491))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store .cse1 .cse2 v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (= .cse2 0)))))) (or (forall ((v_ArrVal_491 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_491))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_493)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (forall ((v_ArrVal_490 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) is different from false [2024-10-14 18:08:42,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:42,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-14 18:08:42,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:42,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2024-10-14 18:08:42,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:42,797 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 76 treesize of output 75 [2024-10-14 18:08:42,801 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 66 treesize of output 62 [2024-10-14 18:08:42,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:42,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-14 18:08:42,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-14 18:08:42,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:08:42,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:42,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2024-10-14 18:08:42,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:42,885 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 18:08:42,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 67 [2024-10-14 18:08:42,894 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 6 treesize of output 4 [2024-10-14 18:08:42,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:42,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-14 18:08:42,904 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:42,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 18:08:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:43,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184343693] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:43,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:43,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 25 [2024-10-14 18:08:43,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145537855] [2024-10-14 18:08:43,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:43,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 18:08:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:43,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 18:08:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=468, Unknown=13, NotChecked=44, Total=600 [2024-10-14 18:08:43,018 INFO L87 Difference]: Start difference. First operand 143 states and 164 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-10-14 18:08:43,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0)))) (and (or (forall ((v_ArrVal_493 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) .cse0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (forall ((v_ArrVal_493 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (<= .cse2 0) (or (= .cse1 0) (< .cse2 0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse0 (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2024-10-14 18:08:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:44,301 INFO L93 Difference]: Finished difference Result 317 states and 376 transitions. [2024-10-14 18:08:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 18:08:44,301 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 18:08:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:44,302 INFO L225 Difference]: With dead ends: 317 [2024-10-14 18:08:44,303 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 18:08:44,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1041, Unknown=16, NotChecked=138, Total=1406 [2024-10-14 18:08:44,304 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1017 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 36 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 353 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:44,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 1413 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1347 Invalid, 31 Unknown, 353 Unchecked, 0.9s Time] [2024-10-14 18:08:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 18:08:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 153. [2024-10-14 18:08:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.403361344537815) internal successors, (167), 151 states have internal predecessors, (167), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2024-10-14 18:08:44,311 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 29 [2024-10-14 18:08:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:44,311 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2024-10-14 18:08:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-10-14 18:08:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2024-10-14 18:08:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:08:44,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:44,313 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:44,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:08:44,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:44,514 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:44,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1521654695, now seen corresponding path program 1 times [2024-10-14 18:08:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488367442] [2024-10-14 18:08:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:44,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488367442] [2024-10-14 18:08:44,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488367442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:44,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:08:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949286983] [2024-10-14 18:08:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:44,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:44,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:44,555 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:44,590 INFO L93 Difference]: Finished difference Result 218 states and 249 transitions. [2024-10-14 18:08:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:44,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-14 18:08:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:44,592 INFO L225 Difference]: With dead ends: 218 [2024-10-14 18:08:44,592 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 18:08:44,592 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-10-14 18:08:44,592 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:44,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 220 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:08:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 18:08:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 171. [2024-10-14 18:08:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 169 states have internal predecessors, (186), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 195 transitions. [2024-10-14 18:08:44,598 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 195 transitions. Word has length 30 [2024-10-14 18:08:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:44,598 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 195 transitions. [2024-10-14 18:08:44,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 195 transitions. [2024-10-14 18:08:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:08:44,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:44,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:44,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 18:08:44,600 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:44,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash 706251702, now seen corresponding path program 1 times [2024-10-14 18:08:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177442235] [2024-10-14 18:08:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177442235] [2024-10-14 18:08:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177442235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122128620] [2024-10-14 18:08:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:44,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:44,763 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-10-14 18:08:44,764 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-10-14 18:08:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:44,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 18:08:44,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:44,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:08:44,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:08:44,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:08:44,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:44,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:44,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122128620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:45,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2024-10-14 18:08:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518941093] [2024-10-14 18:08:45,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:45,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 18:08:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 18:08:45,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:08:45,064 INFO L87 Difference]: Start difference. First operand 171 states and 195 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 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-10-14 18:08:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:45,246 INFO L93 Difference]: Finished difference Result 218 states and 247 transitions. [2024-10-14 18:08:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:08:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 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 33 [2024-10-14 18:08:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:45,248 INFO L225 Difference]: With dead ends: 218 [2024-10-14 18:08:45,248 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 18:08:45,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:08:45,249 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 419 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:45,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 290 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:08:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 18:08:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 170. [2024-10-14 18:08:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 168 states have internal predecessors, (184), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2024-10-14 18:08:45,252 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 33 [2024-10-14 18:08:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:45,253 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2024-10-14 18:08:45,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 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-10-14 18:08:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2024-10-14 18:08:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 18:08:45,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:45,253 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:45,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 18:08:45,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 18:08:45,454 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:45,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash 232211828, now seen corresponding path program 1 times [2024-10-14 18:08:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:45,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104115634] [2024-10-14 18:08:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:45,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:45,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104115634] [2024-10-14 18:08:45,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104115634] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:45,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522869970] [2024-10-14 18:08:45,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:45,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:45,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:45,791 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-10-14 18:08:45,793 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-10-14 18:08:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:45,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 18:08:45,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:45,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:45,914 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:45,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:45,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:45,976 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:45,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-14 18:08:46,008 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:08:46,008 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 24 treesize of output 17 [2024-10-14 18:08:46,046 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:46,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-14 18:08:46,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:08:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:46,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:46,190 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-14 18:08:46,190 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 19 treesize of output 18 [2024-10-14 18:08:46,237 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_784 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_782))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-10-14 18:08:46,246 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_784 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_782))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-10-14 18:08:46,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:46,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2024-10-14 18:08:46,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:46,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 207 [2024-10-14 18:08:46,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:46,280 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 64 treesize of output 59 [2024-10-14 18:08:46,285 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 74 treesize of output 68 [2024-10-14 18:08:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:46,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522869970] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:46,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:46,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 25 [2024-10-14 18:08:46,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203888858] [2024-10-14 18:08:46,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:46,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 18:08:46,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:46,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 18:08:46,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=8, NotChecked=90, Total=650 [2024-10-14 18:08:46,413 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand has 26 states, 25 states have (on average 3.92) internal successors, (98), 26 states have internal predecessors, (98), 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-10-14 18:08:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:47,024 INFO L93 Difference]: Finished difference Result 222 states and 258 transitions. [2024-10-14 18:08:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:08:47,024 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.92) internal successors, (98), 26 states have internal predecessors, (98), 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 36 [2024-10-14 18:08:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:47,025 INFO L225 Difference]: With dead ends: 222 [2024-10-14 18:08:47,025 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 18:08:47,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=8, NotChecked=130, Total=1260 [2024-10-14 18:08:47,026 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 427 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:47,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 894 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 909 Invalid, 0 Unknown, 406 Unchecked, 0.4s Time] [2024-10-14 18:08:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 18:08:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2024-10-14 18:08:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.346938775510204) internal successors, (198), 178 states have internal predecessors, (198), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2024-10-14 18:08:47,030 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 36 [2024-10-14 18:08:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:47,030 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2024-10-14 18:08:47,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.92) internal successors, (98), 26 states have internal predecessors, (98), 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-10-14 18:08:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2024-10-14 18:08:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 18:08:47,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:47,031 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:47,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 18:08:47,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:47,236 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:47,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash 232211829, now seen corresponding path program 1 times [2024-10-14 18:08:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:47,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250271282] [2024-10-14 18:08:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250271282] [2024-10-14 18:08:47,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250271282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:47,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155454127] [2024-10-14 18:08:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:47,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:47,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:47,597 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-10-14 18:08:47,599 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-10-14 18:08:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:47,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 18:08:47,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:47,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:47,723 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:47,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:47,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:47,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:47,807 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:47,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-10-14 18:08:47,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:47,846 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:08:47,847 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-10-14 18:08:47,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:08:47,861 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:08:47,861 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 24 treesize of output 17 [2024-10-14 18:08:47,907 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:47,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-14 18:08:47,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:48,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:08:48,022 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-10-14 18:08:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:48,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:48,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:48,154 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 42 treesize of output 46 [2024-10-14 18:08:48,181 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_885 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_885) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 1))) (forall ((v_ArrVal_886 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2024-10-14 18:08:48,198 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)) (forall ((v_ArrVal_885 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_885) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_886 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2024-10-14 18:08:48,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_886 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_886) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_885 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_885) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)))) is different from false [2024-10-14 18:08:48,218 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_881 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_881) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_882) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)) (forall ((v_ArrVal_882 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_882))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_885) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_881) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_882) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_886) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2024-10-14 18:08:48,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_881) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_882) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_886) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_882 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_882))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_885) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_881 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_881) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_882) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)))) is different from false [2024-10-14 18:08:48,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:48,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-10-14 18:08:48,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:48,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-10-14 18:08:48,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-10-14 18:08:48,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:48,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 111 [2024-10-14 18:08:48,263 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 68 treesize of output 60 [2024-10-14 18:08:48,267 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 88 treesize of output 82 [2024-10-14 18:08:48,270 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 56 treesize of output 54 [2024-10-14 18:08:48,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:48,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-14 18:08:48,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:48,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-10-14 18:08:48,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:48,322 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 26 treesize of output 18 [2024-10-14 18:08:48,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:48,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 18:08:48,334 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:08:48,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2024-10-14 18:08:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:48,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155454127] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:48,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 28 [2024-10-14 18:08:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449208398] [2024-10-14 18:08:48,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:48,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 18:08:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:48,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 18:08:48,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=489, Unknown=5, NotChecked=240, Total=812 [2024-10-14 18:08:48,417 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand has 29 states, 28 states have (on average 3.75) internal successors, (105), 29 states have internal predecessors, (105), 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-10-14 18:08:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:49,404 INFO L93 Difference]: Finished difference Result 285 states and 328 transitions. [2024-10-14 18:08:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 18:08:49,404 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.75) internal successors, (105), 29 states have internal predecessors, (105), 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 36 [2024-10-14 18:08:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:49,405 INFO L225 Difference]: With dead ends: 285 [2024-10-14 18:08:49,405 INFO L226 Difference]: Without dead ends: 285 [2024-10-14 18:08:49,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1166, Unknown=5, NotChecked=380, Total=1806 [2024-10-14 18:08:49,407 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 594 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1337 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:49,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 923 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1082 Invalid, 0 Unknown, 1337 Unchecked, 0.5s Time] [2024-10-14 18:08:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-14 18:08:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 183. [2024-10-14 18:08:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 150 states have (on average 1.34) internal successors, (201), 181 states have internal predecessors, (201), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 209 transitions. [2024-10-14 18:08:49,417 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 209 transitions. Word has length 36 [2024-10-14 18:08:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:49,417 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 209 transitions. [2024-10-14 18:08:49,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.75) internal successors, (105), 29 states have internal predecessors, (105), 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-10-14 18:08:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 209 transitions. [2024-10-14 18:08:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:08:49,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:49,418 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:49,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:49,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:49,623 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1370959522, now seen corresponding path program 1 times [2024-10-14 18:08:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625183381] [2024-10-14 18:08:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:08:49,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625183381] [2024-10-14 18:08:49,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625183381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:49,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:49,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:08:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149339368] [2024-10-14 18:08:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:49,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:49,653 INFO L87 Difference]: Start difference. First operand 183 states and 209 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-10-14 18:08:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:49,673 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2024-10-14 18:08:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:49,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 39 [2024-10-14 18:08:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:49,675 INFO L225 Difference]: With dead ends: 184 [2024-10-14 18:08:49,675 INFO L226 Difference]: Without dead ends: 184 [2024-10-14 18:08:49,675 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-10-14 18:08:49,675 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:49,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:08:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-14 18:08:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-14 18:08:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 151 states have (on average 1.3311258278145695) internal successors, (201), 182 states have internal predecessors, (201), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2024-10-14 18:08:49,680 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 39 [2024-10-14 18:08:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:49,680 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2024-10-14 18:08:49,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-10-14 18:08:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2024-10-14 18:08:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 18:08:49,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:49,680 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:49,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 18:08:49,681 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:49,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash 579373491, now seen corresponding path program 1 times [2024-10-14 18:08:49,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:49,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685037939] [2024-10-14 18:08:49,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:49,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685037939] [2024-10-14 18:08:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685037939] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045277951] [2024-10-14 18:08:50,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:50,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:50,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:50,252 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-10-14 18:08:50,254 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-10-14 18:08:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:50,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-14 18:08:50,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:50,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:50,403 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:50,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:50,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:50,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:50,483 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:50,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-10-14 18:08:50,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:50,523 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:08:50,524 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 24 treesize of output 17 [2024-10-14 18:08:50,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:50,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:50,564 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:50,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2024-10-14 18:08:50,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:50,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-14 18:08:50,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-14 18:08:50,666 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-10-14 18:08:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:50,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:50,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2024-10-14 18:08:50,770 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1033 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1035 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) is different from false [2024-10-14 18:08:50,866 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1029))) (or (forall ((v_ArrVal_1033 (Array Int Int))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)) (< (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1029 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1030))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_1035) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1029))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (< .cse3 0) (forall ((v_ArrVal_1033 (Array Int Int))) (< .cse3 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)))))))) is different from false [2024-10-14 18:08:50,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1029))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (forall ((v_ArrVal_1033 (Array Int Int))) (< .cse0 (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1030) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1))) (< .cse0 0))))) (or (forall ((v_ArrVal_1029 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1029) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1030))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_1035) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1029))) (or (< (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((v_ArrVal_1033 (Array Int Int))) (< (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1030) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1))))))) is different from false [2024-10-14 18:08:50,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:50,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-14 18:08:50,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-14 18:08:50,913 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 7 treesize of output 5 [2024-10-14 18:08:50,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:50,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2024-10-14 18:08:50,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:50,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 207 [2024-10-14 18:08:50,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:50,936 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 64 treesize of output 59 [2024-10-14 18:08:50,939 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 74 treesize of output 68 [2024-10-14 18:08:50,993 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:08:50,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2024-10-14 18:08:51,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:51,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2024-10-14 18:08:51,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:51,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-10-14 18:08:51,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:51,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-10-14 18:08:51,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:51,025 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-14 18:08:51,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2024-10-14 18:08:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045277951] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:51,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2024-10-14 18:08:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625567350] [2024-10-14 18:08:51,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 18:08:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 18:08:51,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=829, Unknown=3, NotChecked=180, Total=1122 [2024-10-14 18:08:51,120 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand has 34 states, 34 states have (on average 3.264705882352941) internal successors, (111), 33 states have internal predecessors, (111), 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-10-14 18:08:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:51,991 INFO L93 Difference]: Finished difference Result 303 states and 346 transitions. [2024-10-14 18:08:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 18:08:51,993 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.264705882352941) internal successors, (111), 33 states have internal predecessors, (111), 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 40 [2024-10-14 18:08:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:51,994 INFO L225 Difference]: With dead ends: 303 [2024-10-14 18:08:51,994 INFO L226 Difference]: Without dead ends: 303 [2024-10-14 18:08:51,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=1610, Unknown=3, NotChecked=258, Total=2162 [2024-10-14 18:08:51,995 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1140 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 863 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:51,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1026 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 967 Invalid, 0 Unknown, 863 Unchecked, 0.5s Time] [2024-10-14 18:08:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-14 18:08:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2024-10-14 18:08:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 181 states have internal predecessors, (199), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 207 transitions. [2024-10-14 18:08:51,999 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 207 transitions. Word has length 40 [2024-10-14 18:08:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:52,000 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 207 transitions. [2024-10-14 18:08:52,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.264705882352941) internal successors, (111), 33 states have internal predecessors, (111), 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-10-14 18:08:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 207 transitions. [2024-10-14 18:08:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 18:08:52,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:52,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:52,014 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-10-14 18:08:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:52,205 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:52,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash 567998358, now seen corresponding path program 1 times [2024-10-14 18:08:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647634906] [2024-10-14 18:08:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647634906] [2024-10-14 18:08:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647634906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653403263] [2024-10-14 18:08:52,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:52,508 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-10-14 18:08:52,509 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-10-14 18:08:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:52,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 18:08:52,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:52,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:52,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:52,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:52,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:52,698 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:52,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 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-14 18:08:52,765 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:08:52,765 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 33 treesize of output 24 [2024-10-14 18:08:52,781 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:52,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-14 18:08:52,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:08:52,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:08:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:52,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:52,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1136 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1136) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_1136 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1136) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) is different from false [2024-10-14 18:08:52,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:52,992 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 51 treesize of output 55 [2024-10-14 18:08:53,009 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1134 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1134))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1136)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_prenex_4))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_prenex_3)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2024-10-14 18:08:53,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1134 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1134))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1136)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse1 v_prenex_4))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_prenex_3)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2024-10-14 18:08:53,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:53,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-10-14 18:08:53,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:53,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 211 [2024-10-14 18:08:53,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:53,045 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 155 treesize of output 151 [2024-10-14 18:08:53,053 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 143 treesize of output 135 [2024-10-14 18:08:53,131 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:08:53,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2024-10-14 18:08:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:53,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653403263] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:53,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:53,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 23 [2024-10-14 18:08:53,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300792029] [2024-10-14 18:08:53,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:53,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:08:53,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:53,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:08:53,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=345, Unknown=9, NotChecked=120, Total=552 [2024-10-14 18:08:53,190 INFO L87 Difference]: Start difference. First operand 183 states and 207 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-10-14 18:08:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:53,565 INFO L93 Difference]: Finished difference Result 221 states and 252 transitions. [2024-10-14 18:08:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:08:53,565 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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 40 [2024-10-14 18:08:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:53,566 INFO L225 Difference]: With dead ends: 221 [2024-10-14 18:08:53,566 INFO L226 Difference]: Without dead ends: 221 [2024-10-14 18:08:53,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=520, Unknown=10, NotChecked=150, Total=812 [2024-10-14 18:08:53,567 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 428 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 573 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:53,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 756 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 682 Invalid, 0 Unknown, 573 Unchecked, 0.3s Time] [2024-10-14 18:08:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-14 18:08:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 203. [2024-10-14 18:08:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 170 states have (on average 1.3529411764705883) internal successors, (230), 201 states have internal predecessors, (230), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2024-10-14 18:08:53,571 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 40 [2024-10-14 18:08:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:53,571 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2024-10-14 18:08:53,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-10-14 18:08:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2024-10-14 18:08:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 18:08:53,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:53,572 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:53,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 18:08:53,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-14 18:08:53,773 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 567998359, now seen corresponding path program 1 times [2024-10-14 18:08:53,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:53,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873159144] [2024-10-14 18:08:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873159144] [2024-10-14 18:08:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873159144] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000444891] [2024-10-14 18:08:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:54,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:54,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:54,083 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:54,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 18:08:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:54,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 18:08:54,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:54,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:54,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:54,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:54,221 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 8 treesize of output 1 [2024-10-14 18:08:54,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:54,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:54,302 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:54,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-14 18:08:54,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:54,345 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:08:54,345 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-10-14 18:08:54,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:08:54,360 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:08:54,361 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 33 treesize of output 24 [2024-10-14 18:08:54,393 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:54,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-14 18:08:54,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:54,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:08:54,504 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-10-14 18:08:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:54,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:54,638 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1241 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-10-14 18:08:54,658 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1241) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1241 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1241) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-10-14 18:08:54,667 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1238))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1237) .cse0 v_ArrVal_1241) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1241) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-10-14 18:08:54,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1238))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1237) .cse1 v_ArrVal_1241) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1238) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1241) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-10-14 18:08:54,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:54,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-14 18:08:54,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:54,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-10-14 18:08:54,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-10-14 18:08:54,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:54,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2024-10-14 18:08:54,715 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 56 treesize of output 54 [2024-10-14 18:08:54,721 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 78 treesize of output 72 [2024-10-14 18:08:54,726 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 50 treesize of output 46 [2024-10-14 18:08:54,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-10-14 18:08:54,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:54,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-10-14 18:08:54,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:54,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:54,787 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-10-14 18:08:54,791 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:54,793 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-10-14 18:08:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000444891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:54,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2024-10-14 18:08:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711480084] [2024-10-14 18:08:54,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:54,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 18:08:54,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 18:08:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=358, Unknown=4, NotChecked=164, Total=600 [2024-10-14 18:08:54,867 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand has 25 states, 24 states have (on average 4.875) internal successors, (117), 25 states have internal predecessors, (117), 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-10-14 18:08:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:55,355 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2024-10-14 18:08:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:08:55,356 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.875) internal successors, (117), 25 states have internal predecessors, (117), 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 40 [2024-10-14 18:08:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:55,357 INFO L225 Difference]: With dead ends: 219 [2024-10-14 18:08:55,357 INFO L226 Difference]: Without dead ends: 219 [2024-10-14 18:08:55,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=601, Unknown=4, NotChecked=220, Total=992 [2024-10-14 18:08:55,357 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 589 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 776 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:55,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 667 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 795 Invalid, 0 Unknown, 776 Unchecked, 0.3s Time] [2024-10-14 18:08:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-14 18:08:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2024-10-14 18:08:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 170 states have (on average 1.3470588235294119) internal successors, (229), 201 states have internal predecessors, (229), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 237 transitions. [2024-10-14 18:08:55,362 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 237 transitions. Word has length 40 [2024-10-14 18:08:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:55,362 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 237 transitions. [2024-10-14 18:08:55,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.875) internal successors, (117), 25 states have internal predecessors, (117), 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-10-14 18:08:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 237 transitions. [2024-10-14 18:08:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:08:55,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:55,363 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:55,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 18:08:55,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-14 18:08:55,565 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:55,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash 428078808, now seen corresponding path program 1 times [2024-10-14 18:08:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260157538] [2024-10-14 18:08:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:08:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260157538] [2024-10-14 18:08:55,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260157538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371049790] [2024-10-14 18:08:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:55,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:55,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 18:08:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:55,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 18:08:55,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:55,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-14 18:08:55,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-14 18:08:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:08:55,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:08:55,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371049790] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:55,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:55,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2024-10-14 18:08:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045367625] [2024-10-14 18:08:55,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:55,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:08:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:08:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:55,877 INFO L87 Difference]: Start difference. First operand 203 states and 237 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-10-14 18:08:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:56,055 INFO L93 Difference]: Finished difference Result 220 states and 260 transitions. [2024-10-14 18:08:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:08:56,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 41 [2024-10-14 18:08:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:56,056 INFO L225 Difference]: With dead ends: 220 [2024-10-14 18:08:56,056 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 18:08:56,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 18:08:56,057 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 210 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:56,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 368 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 18:08:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 207. [2024-10-14 18:08:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3275862068965518) internal successors, (231), 205 states have internal predecessors, (231), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2024-10-14 18:08:56,065 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 41 [2024-10-14 18:08:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:56,065 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2024-10-14 18:08:56,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-10-14 18:08:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2024-10-14 18:08:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:08:56,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:56,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:56,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 18:08:56,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 18:08:56,267 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:56,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash 428081773, now seen corresponding path program 1 times [2024-10-14 18:08:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:56,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854385141] [2024-10-14 18:08:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:56,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854385141] [2024-10-14 18:08:56,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854385141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196485633] [2024-10-14 18:08:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:56,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:56,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:56,505 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:56,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 18:08:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:56,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 18:08:56,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:56,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:56,644 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:56,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:56,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:56,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:56,702 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:56,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-10-14 18:08:56,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:56,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 18:08:56,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:56,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:56,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:56,906 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1438) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 0) (< .cse0 0)))) is different from false [2024-10-14 18:08:56,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1435) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1436) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 0) (< .cse0 0)))) is different from false [2024-10-14 18:08:56,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:56,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2024-10-14 18:08:56,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:56,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2024-10-14 18:08:56,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2024-10-14 18:08:56,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:56,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 194 [2024-10-14 18:08:56,989 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 129 treesize of output 113 [2024-10-14 18:08:56,993 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 163 treesize of output 151 [2024-10-14 18:08:56,997 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 105 treesize of output 101 [2024-10-14 18:08:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:57,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196485633] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:57,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2024-10-14 18:08:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300971699] [2024-10-14 18:08:57,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:57,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:08:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:08:57,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=379, Unknown=15, NotChecked=82, Total=552 [2024-10-14 18:08:57,141 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 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-10-14 18:08:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:57,530 INFO L93 Difference]: Finished difference Result 222 states and 250 transitions. [2024-10-14 18:08:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 18:08:57,531 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 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 41 [2024-10-14 18:08:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:57,532 INFO L225 Difference]: With dead ends: 222 [2024-10-14 18:08:57,532 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 18:08:57,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=710, Unknown=15, NotChecked=118, Total=1056 [2024-10-14 18:08:57,532 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 746 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:57,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 909 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 700 Invalid, 0 Unknown, 382 Unchecked, 0.3s Time] [2024-10-14 18:08:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 18:08:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 208. [2024-10-14 18:08:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 206 states have internal predecessors, (232), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2024-10-14 18:08:57,536 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 41 [2024-10-14 18:08:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:57,536 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2024-10-14 18:08:57,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 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-10-14 18:08:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2024-10-14 18:08:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:08:57,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:57,537 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:57,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 18:08:57,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 18:08:57,742 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:57,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash 385633541, now seen corresponding path program 1 times [2024-10-14 18:08:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:57,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118780509] [2024-10-14 18:08:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:57,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:57,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118780509] [2024-10-14 18:08:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118780509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095620920] [2024-10-14 18:08:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:57,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:57,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:57,981 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:57,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 18:08:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:58,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 18:08:58,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:58,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:58,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:58,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:58,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:58,284 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:58,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-14 18:08:58,324 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:08:58,325 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 33 treesize of output 24 [2024-10-14 18:08:58,344 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:58,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-14 18:08:58,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:08:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:58,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:58,549 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1536 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1536))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1538)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-10-14 18:08:58,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:58,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-10-14 18:08:58,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:58,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 211 [2024-10-14 18:08:58,598 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 171 treesize of output 163 [2024-10-14 18:08:58,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:58,608 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 163 treesize of output 159 [2024-10-14 18:08:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095620920] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:58,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:58,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2024-10-14 18:08:58,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530692914] [2024-10-14 18:08:58,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:58,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:08:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:58,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:08:58,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=396, Unknown=18, NotChecked=42, Total=552 [2024-10-14 18:08:58,774 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 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-10-14 18:08:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:59,217 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2024-10-14 18:08:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:08:59,218 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 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 42 [2024-10-14 18:08:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:59,219 INFO L225 Difference]: With dead ends: 220 [2024-10-14 18:08:59,219 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 18:08:59,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=619, Unknown=18, NotChecked=54, Total=870 [2024-10-14 18:08:59,220 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 248 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:59,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 804 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 845 Invalid, 0 Unknown, 197 Unchecked, 0.4s Time] [2024-10-14 18:08:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 18:08:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 209. [2024-10-14 18:08:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.3238636363636365) internal successors, (233), 207 states have internal predecessors, (233), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2024-10-14 18:08:59,223 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 42 [2024-10-14 18:08:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:59,223 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2024-10-14 18:08:59,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 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-10-14 18:08:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2024-10-14 18:08:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 18:08:59,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:59,224 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:59,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:59,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 18:08:59,425 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:59,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash 182413883, now seen corresponding path program 1 times [2024-10-14 18:08:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737920162] [2024-10-14 18:08:59,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:08:59,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:59,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737920162] [2024-10-14 18:08:59,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737920162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:59,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:59,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:08:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134766914] [2024-10-14 18:08:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:59,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:59,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:59,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:59,469 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-14 18:08:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:59,515 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2024-10-14 18:08:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:59,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 43 [2024-10-14 18:08:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:59,516 INFO L225 Difference]: With dead ends: 275 [2024-10-14 18:08:59,516 INFO L226 Difference]: Without dead ends: 275 [2024-10-14 18:08:59,516 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-10-14 18:08:59,516 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 55 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:59,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 243 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:08:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-14 18:08:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 228. [2024-10-14 18:08:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 226 states have internal predecessors, (253), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 261 transitions. [2024-10-14 18:08:59,521 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 261 transitions. Word has length 43 [2024-10-14 18:08:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 261 transitions. [2024-10-14 18:08:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-14 18:08:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 261 transitions. [2024-10-14 18:08:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 18:08:59,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:59,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:59,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 18:08:59,522 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:59,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -930261649, now seen corresponding path program 1 times [2024-10-14 18:08:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275370640] [2024-10-14 18:08:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:08:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:59,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275370640] [2024-10-14 18:08:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275370640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:59,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:59,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:08:59,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706729348] [2024-10-14 18:08:59,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:59,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:08:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:59,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:08:59,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:08:59,574 INFO L87 Difference]: Start difference. First operand 228 states and 261 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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-10-14 18:08:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:59,649 INFO L93 Difference]: Finished difference Result 231 states and 264 transitions. [2024-10-14 18:08:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:08:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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 43 [2024-10-14 18:08:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:59,650 INFO L225 Difference]: With dead ends: 231 [2024-10-14 18:08:59,650 INFO L226 Difference]: Without dead ends: 231 [2024-10-14 18:08:59,650 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-10-14 18:08:59,651 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 143 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:59,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 139 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-14 18:08:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2024-10-14 18:08:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.2923076923076924) internal successors, (252), 225 states have internal predecessors, (252), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 260 transitions. [2024-10-14 18:08:59,654 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 260 transitions. Word has length 43 [2024-10-14 18:08:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:59,654 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 260 transitions. [2024-10-14 18:08:59,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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-10-14 18:08:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 260 transitions. [2024-10-14 18:08:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 18:08:59,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:59,655 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:59,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 18:08:59,655 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:08:59,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:59,655 INFO L85 PathProgramCache]: Analyzing trace with hash -864164995, now seen corresponding path program 1 times [2024-10-14 18:08:59,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:59,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229296924] [2024-10-14 18:08:59,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:59,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:09:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:09:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229296924] [2024-10-14 18:09:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229296924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:09:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689158161] [2024-10-14 18:09:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:09:00,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:09:00,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:09:00,250 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:09:00,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 18:09:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:00,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-14 18:09:00,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:09:00,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:09:00,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:09:00,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:09:00,452 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:09:00,508 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:09:00,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-10-14 18:09:00,540 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:09:00,540 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 32 treesize of output 23 [2024-10-14 18:09:00,562 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-10-14 18:09:00,605 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-14 18:09:00,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-14 18:09:00,629 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 23 treesize of output 11 [2024-10-14 18:09:00,692 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-10-14 18:09:00,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 42 [2024-10-14 18:09:00,750 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-10-14 18:09:00,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 47 [2024-10-14 18:09:00,793 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-14 18:09:00,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 56 [2024-10-14 18:09:00,906 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:09:00,906 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-10-14 18:09:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:09:00,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:09:00,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2024-10-14 18:09:01,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1810))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1812)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2024-10-14 18:09:01,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:01,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-10-14 18:09:01,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:01,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 80 [2024-10-14 18:09:01,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:01,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29995 treesize of output 24902 [2024-10-14 18:09:01,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:01,514 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 745 treesize of output 713 [2024-10-14 18:09:01,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:01,528 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 691 treesize of output 615 [2024-10-14 18:09:01,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:01,553 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 600 treesize of output 537 [2024-10-14 18:09:01,569 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 528 treesize of output 500 [2024-10-14 18:09:01,626 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-10-14 18:09:01,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2024-10-14 18:09:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-14 18:09:02,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689158161] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:09:02,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:09:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 42 [2024-10-14 18:09:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112609366] [2024-10-14 18:09:02,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:09:02,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-14 18:09:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:09:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-14 18:09:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1406, Unknown=41, NotChecked=158, Total=1806 [2024-10-14 18:09:02,029 INFO L87 Difference]: Start difference. First operand 227 states and 260 transitions. Second operand has 43 states, 43 states have (on average 2.5348837209302326) internal successors, (109), 42 states have internal predecessors, (109), 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-10-14 18:09:06,147 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 [0] [2024-10-14 18:09:10,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:09:11,189 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= (select |c_#valid| 0) 0) (not (= .cse0 0)) (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1810))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1812)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (exists ((|v_ULTIMATE.start_main_~item~0#1.offset_107| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_main_~item~0#1.offset_107|))) (and (not (= .cse3 .cse0)) (= .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_main_~head~0#1.base|))))) (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse4 (select v_arrayElimArr_25 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse4) 0)) (not (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_25) .cse4 v_ArrVal_1810))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1812)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_34| Int)) (or (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 |ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_34|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_34| v_ArrVal_1810))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1812)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_34|))))))) is different from false [2024-10-14 18:09:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:09:12,362 INFO L93 Difference]: Finished difference Result 332 states and 380 transitions. [2024-10-14 18:09:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 18:09:12,363 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.5348837209302326) internal successors, (109), 42 states have internal predecessors, (109), 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 44 [2024-10-14 18:09:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:09:12,364 INFO L225 Difference]: With dead ends: 332 [2024-10-14 18:09:12,364 INFO L226 Difference]: Without dead ends: 332 [2024-10-14 18:09:12,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=642, Invalid=3104, Unknown=48, NotChecked=366, Total=4160 [2024-10-14 18:09:12,365 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 754 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 109 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 627 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:09:12,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1870 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2036 Invalid, 20 Unknown, 627 Unchecked, 9.4s Time] [2024-10-14 18:09:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-14 18:09:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 249. [2024-10-14 18:09:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 217 states have (on average 1.2672811059907834) internal successors, (275), 247 states have internal predecessors, (275), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:09:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 283 transitions. [2024-10-14 18:09:12,386 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 283 transitions. Word has length 44 [2024-10-14 18:09:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:09:12,386 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 283 transitions. [2024-10-14 18:09:12,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.5348837209302326) internal successors, (109), 42 states have internal predecessors, (109), 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-10-14 18:09:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 283 transitions. [2024-10-14 18:09:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 18:09:12,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:09:12,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:09:12,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 18:09:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:09:12,588 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:09:12,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:09:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash 552015475, now seen corresponding path program 1 times [2024-10-14 18:09:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:09:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768950278] [2024-10-14 18:09:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:09:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:09:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:09:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:09:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768950278] [2024-10-14 18:09:12,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768950278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:09:12,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:09:12,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:09:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485496849] [2024-10-14 18:09:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:09:12,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:09:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:09:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:09:12,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:09:12,632 INFO L87 Difference]: Start difference. First operand 249 states and 283 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10-14 18:09:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:09:12,682 INFO L93 Difference]: Finished difference Result 278 states and 311 transitions. [2024-10-14 18:09:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:09:12,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2024-10-14 18:09:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:09:12,683 INFO L225 Difference]: With dead ends: 278 [2024-10-14 18:09:12,683 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 18:09:12,683 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-10-14 18:09:12,684 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:09:12,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 320 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:09:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 18:09:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 255. [2024-10-14 18:09:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 223 states have (on average 1.2690582959641257) internal successors, (283), 253 states have internal predecessors, (283), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:09:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2024-10-14 18:09:12,688 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 44 [2024-10-14 18:09:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:09:12,688 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2024-10-14 18:09:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10-14 18:09:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2024-10-14 18:09:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 18:09:12,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:09:12,688 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:09:12,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 18:09:12,689 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-10-14 18:09:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:09:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash -864276314, now seen corresponding path program 1 times [2024-10-14 18:09:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:09:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986003459] [2024-10-14 18:09:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:09:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:09:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:09:13,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:09:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986003459] [2024-10-14 18:09:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986003459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:09:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518526611] [2024-10-14 18:09:13,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:09:13,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:09:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:09:13,493 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:09:13,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:09:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:13,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-14 18:09:13,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:09:13,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:09:13,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:09:13,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:09:13,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:09:13,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:09:13,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:09:13,772 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:09:13,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-14 18:09:13,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:09:13,825 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:09:13,825 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 33 treesize of output 24 [2024-10-14 18:09:13,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:09:13,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:09:13,886 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:09:13,887 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-10-14 18:09:13,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:09:13,902 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 18:09:13,903 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 33 treesize of output 24 [2024-10-14 18:09:13,996 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:09:13,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-14 18:09:14,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:09:14,015 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-14 18:09:14,015 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-10-14 18:09:14,078 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-14 18:09:14,078 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 1 case distinctions, treesize of input 40 treesize of output 20 [2024-10-14 18:09:14,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:09:14,087 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-10-14 18:09:14,163 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-14 18:09:14,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 67 [2024-10-14 18:09:14,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:09:14,238 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-10-14 18:09:14,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2024-10-14 18:09:14,256 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:09:14,257 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-10-14 18:09:14,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:09:14,329 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-14 18:09:14,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 69 [2024-10-14 18:09:14,336 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 32 treesize of output 11 [2024-10-14 18:09:14,501 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 18:09:14,501 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 53 treesize of output 24 [2024-10-14 18:09:14,508 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-10-14 18:09:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:09:14,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:09:14,643 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2023 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2024) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-10-14 18:09:14,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_2023 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2024) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-10-14 18:09:14,670 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2019))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2018) .cse0 v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2024) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2018) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-10-14 18:09:14,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2018) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2019) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2019))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2018) .cse1 v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2024) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-10-14 18:09:14,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2017) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2018) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2019))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2017) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2018) .cse1 v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2024) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-10-14 18:09:14,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:14,866 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 65 treesize of output 63 [2024-10-14 18:09:14,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:14,879 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 29 treesize of output 33 [2024-10-14 18:09:14,887 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2014 Int) (v_arrayElimArr_27 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_27 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_2019))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|))) (< (+ 3 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2017) .cse0 v_ArrVal_2018) .cse1 v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (store |c_#length| .cse0 v_ArrVal_2014) (select (select (store .cse2 .cse1 v_ArrVal_2024) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse3 (select v_arrayElimArr_28 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse3) 0)) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2017) .cse3 v_ArrVal_2018) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_28) .cse3 v_ArrVal_2019) |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_2023) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)))))) is different from false [2024-10-14 18:09:15,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:15,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 353 [2024-10-14 18:09:15,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:15,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 344 treesize of output 233 [2024-10-14 18:09:15,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:15,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8910 treesize of output 8157 [2024-10-14 18:09:15,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:15,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1925276 treesize of output 1907235 [2024-10-14 18:09:16,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:16,503 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 7363 treesize of output 6578 [2024-10-14 18:09:16,564 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 6569 treesize of output 6505 [2024-10-14 18:09:16,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:16,638 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 6505 treesize of output 6116 [2024-10-14 18:09:16,713 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 6107 treesize of output 6075 [2024-10-14 18:09:16,776 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 6075 treesize of output 5883 [2024-10-14 18:09:16,839 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 5883 treesize of output 5691 [2024-10-14 18:09:16,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:16,913 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 5691 treesize of output 5388 [2024-10-14 18:09:16,986 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 5379 treesize of output 5315 [2024-10-14 18:09:17,171 INFO L349 Elim1Store]: treesize reduction 4, result has 97.2 percent of original size [2024-10-14 18:09:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5322 treesize of output 5440 [2024-10-14 18:09:17,506 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 5332 treesize of output 5270 [2024-10-14 18:09:17,604 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 5227 treesize of output 5215 [2024-10-14 18:09:17,690 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 5215 treesize of output 5211 [2024-10-14 18:09:17,772 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 5211 treesize of output 5191 [2024-10-14 18:09:17,925 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 5191 treesize of output 5155 [2024-10-14 18:09:18,008 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 5155 treesize of output 5143 [2024-10-14 18:09:18,088 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 5194 treesize of output 5148 [2024-10-14 18:09:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-14 18:09:45,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518526611] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:09:45,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:09:45,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 43 [2024-10-14 18:09:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895848955] [2024-10-14 18:09:45,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:09:45,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-14 18:09:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:09:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-14 18:09:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1251, Unknown=10, NotChecked=462, Total=1892 [2024-10-14 18:09:45,802 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand has 44 states, 43 states have (on average 3.0) internal successors, (129), 44 states have internal predecessors, (129), 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-10-14 18:09:49,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:09:54,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 [0] [2024-10-14 18:09:58,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:10:02,215 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]