./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:53:15,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:53:15,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 06:53:15,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:53:15,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:53:15,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:53:15,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:53:15,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:53:15,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:53:15,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:53:15,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:53:15,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:53:15,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:53:15,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:53:15,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:53:15,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:53:15,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:53:15,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:53:15,584 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:53:15,584 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:53:15,584 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:53:15,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:53:15,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:53:15,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:53:15,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:53:15,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:53:15,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:53:15,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:53:15,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:53:15,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:53:15,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:53:15,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:53:15,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:53:15,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:53:15,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:53:15,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:53:15,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:53:15,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:53:15,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:53:15,593 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b [2024-11-19 06:53:15,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:53:15,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:53:15,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:53:15,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:53:15,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:53:15,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-19 06:53:17,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:53:17,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:53:17,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-19 06:53:17,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231cdc4aa/6e955234af0843069ec8419c5f78dc20/FLAGa9e2e99c2 [2024-11-19 06:53:17,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231cdc4aa/6e955234af0843069ec8419c5f78dc20 [2024-11-19 06:53:17,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:53:17,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:53:17,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:53:17,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:53:17,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:53:17,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2181f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17, skipping insertion in model container [2024-11-19 06:53:17,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:53:17,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:53:18,007 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:53:18,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:53:18,085 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:53:18,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18 WrapperNode [2024-11-19 06:53:18,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:53:18,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:53:18,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:53:18,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:53:18,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,132 INFO L138 Inliner]: procedures = 121, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 95 [2024-11-19 06:53:18,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:53:18,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:53:18,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:53:18,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:53:18,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,174 INFO L175 MemorySlicer]: Split 17 memory accesses to 1 slices as follows [17]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 8 writes are split as follows [8]. [2024-11-19 06:53:18,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:53:18,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:53:18,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:53:18,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:53:18,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (1/1) ... [2024-11-19 06:53:18,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:53:18,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:18,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:53:18,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:53:18,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:53:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-19 06:53:18,267 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-19 06:53:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:53:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:53:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:53:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:53:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:53:18,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:53:18,366 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:53:18,368 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:53:18,732 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-19 06:53:18,733 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:53:18,749 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:53:18,749 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:53:18,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:53:18 BoogieIcfgContainer [2024-11-19 06:53:18,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:53:18,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:53:18,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:53:18,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:53:18,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:53:17" (1/3) ... [2024-11-19 06:53:18,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1950d79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:53:18, skipping insertion in model container [2024-11-19 06:53:18,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:18" (2/3) ... [2024-11-19 06:53:18,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1950d79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:53:18, skipping insertion in model container [2024-11-19 06:53:18,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:53:18" (3/3) ... [2024-11-19 06:53:18,757 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-shared.i [2024-11-19 06:53:18,774 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:53:18,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-19 06:53:18,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:53:18,819 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;@5f2d5755, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:53:18,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-19 06:53:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:53:18,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:18,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:53:18,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:18,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash 34543147, now seen corresponding path program 1 times [2024-11-19 06:53:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:18,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174600902] [2024-11-19 06:53:18,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174600902] [2024-11-19 06:53:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174600902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:19,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:19,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504939385] [2024-11-19 06:53:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:19,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:19,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:19,136 INFO L87 Difference]: Start difference. First operand has 101 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:19,252 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-19 06:53:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-19 06:53:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:19,262 INFO L225 Difference]: With dead ends: 100 [2024-11-19 06:53:19,262 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:53:19,264 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-11-19 06:53:19,269 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:19,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:53:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 06:53:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 94 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2024-11-19 06:53:19,312 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 5 [2024-11-19 06:53:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:19,313 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2024-11-19 06:53:19,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2024-11-19 06:53:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:53:19,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:19,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:53:19,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:53:19,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:19,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash 34543148, now seen corresponding path program 1 times [2024-11-19 06:53:19,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:19,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812361386] [2024-11-19 06:53:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:19,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812361386] [2024-11-19 06:53:19,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812361386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:19,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865832521] [2024-11-19 06:53:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:19,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:19,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:19,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:19,423 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:19,499 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-19 06:53:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-19 06:53:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:19,501 INFO L225 Difference]: With dead ends: 97 [2024-11-19 06:53:19,501 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 06:53:19,501 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-11-19 06:53:19,502 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:19,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 06:53:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 06:53:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 93 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-19 06:53:19,512 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 5 [2024-11-19 06:53:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:19,514 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-19 06:53:19,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-19 06:53:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:53:19,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:19,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:19,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:53:19,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:19,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1042879868, now seen corresponding path program 1 times [2024-11-19 06:53:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:19,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952282106] [2024-11-19 06:53:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:19,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952282106] [2024-11-19 06:53:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952282106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:19,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:19,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096296644] [2024-11-19 06:53:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:19,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:19,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:19,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:19,626 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:19,720 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2024-11-19 06:53:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:19,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 06:53:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:19,724 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:53:19,724 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:53:19,725 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-11-19 06:53:19,726 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:19,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:53:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-11-19 06:53:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 92 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-19 06:53:19,741 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 10 [2024-11-19 06:53:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:19,744 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-19 06:53:19,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-19 06:53:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:53:19,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:19,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:19,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:53:19,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:19,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1042879867, now seen corresponding path program 1 times [2024-11-19 06:53:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591441582] [2024-11-19 06:53:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:19,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591441582] [2024-11-19 06:53:19,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591441582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:19,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:19,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728767967] [2024-11-19 06:53:19,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:19,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:19,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:19,871 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:19,954 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-19 06:53:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 06:53:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:19,978 INFO L225 Difference]: With dead ends: 100 [2024-11-19 06:53:19,978 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 06:53:19,978 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-11-19 06:53:19,980 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:19,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 147 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 06:53:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-11-19 06:53:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 91 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-19 06:53:19,992 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 10 [2024-11-19 06:53:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:19,993 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-19 06:53:19,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-19 06:53:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:53:19,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:19,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:19,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:53:19,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:19,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1480173691, now seen corresponding path program 1 times [2024-11-19 06:53:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812613733] [2024-11-19 06:53:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:20,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:20,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812613733] [2024-11-19 06:53:20,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812613733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:20,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:20,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943323034] [2024-11-19 06:53:20,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:20,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:20,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:20,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:20,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:20,081 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:20,150 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-19 06:53:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:20,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:53:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:20,152 INFO L225 Difference]: With dead ends: 99 [2024-11-19 06:53:20,152 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 06:53:20,152 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-11-19 06:53:20,153 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:20,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 06:53:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2024-11-19 06:53:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 90 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-19 06:53:20,166 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 12 [2024-11-19 06:53:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-19 06:53:20,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-19 06:53:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:53:20,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:20,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:20,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:53:20,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1480173690, now seen corresponding path program 1 times [2024-11-19 06:53:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:20,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002238346] [2024-11-19 06:53:20,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:20,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002238346] [2024-11-19 06:53:20,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002238346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:20,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:20,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899227265] [2024-11-19 06:53:20,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:20,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:20,288 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:20,346 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-19 06:53:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:20,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:53:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:20,348 INFO L225 Difference]: With dead ends: 98 [2024-11-19 06:53:20,348 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:53:20,348 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-11-19 06:53:20,349 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 12 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:20,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 148 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:53:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-19 06:53:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-19 06:53:20,361 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 12 [2024-11-19 06:53:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:20,362 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-19 06:53:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-19 06:53:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:53:20,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:20,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:20,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:53:20,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:20,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash -812742458, now seen corresponding path program 1 times [2024-11-19 06:53:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:20,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919570725] [2024-11-19 06:53:20,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:20,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919570725] [2024-11-19 06:53:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919570725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:20,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276644809] [2024-11-19 06:53:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:20,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:20,567 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:20,746 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-11-19 06:53:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:20,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 06:53:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:20,747 INFO L225 Difference]: With dead ends: 93 [2024-11-19 06:53:20,747 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 06:53:20,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:20,748 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:20,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 277 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 06:53:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-11-19 06:53:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-19 06:53:20,761 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 14 [2024-11-19 06:53:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:20,762 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-19 06:53:20,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-19 06:53:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:53:20,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:20,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:53:20,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:20,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash -812742457, now seen corresponding path program 1 times [2024-11-19 06:53:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:20,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470810102] [2024-11-19 06:53:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:21,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470810102] [2024-11-19 06:53:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470810102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:21,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:21,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:21,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532630296] [2024-11-19 06:53:21,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:21,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:21,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:21,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:21,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:21,062 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:21,244 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-19 06:53:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:21,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 06:53:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:21,246 INFO L225 Difference]: With dead ends: 91 [2024-11-19 06:53:21,246 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 06:53:21,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:21,247 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:21,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 06:53:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2024-11-19 06:53:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-19 06:53:21,256 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2024-11-19 06:53:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:21,256 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-19 06:53:21,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-19 06:53:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:53:21,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:21,258 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] [2024-11-19 06:53:21,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:53:21,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:21,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:21,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2081078920, now seen corresponding path program 1 times [2024-11-19 06:53:21,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:21,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105373640] [2024-11-19 06:53:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:21,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:21,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105373640] [2024-11-19 06:53:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105373640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:21,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:21,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:21,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616520967] [2024-11-19 06:53:21,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:21,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:21,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:21,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:21,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:21,371 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:21,525 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-19 06:53:21,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:21,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-19 06:53:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:21,527 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:53:21,527 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:53:21,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:21,528 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 41 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:21,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 241 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:53:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2024-11-19 06:53:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 98 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2024-11-19 06:53:21,533 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 21 [2024-11-19 06:53:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:21,533 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2024-11-19 06:53:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2024-11-19 06:53:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:53:21,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:21,539 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] [2024-11-19 06:53:21,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:53:21,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:21,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2081078919, now seen corresponding path program 1 times [2024-11-19 06:53:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:21,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361624266] [2024-11-19 06:53:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:21,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:21,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361624266] [2024-11-19 06:53:21,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361624266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:21,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:21,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388337651] [2024-11-19 06:53:21,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:21,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:21,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:21,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:21,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:21,751 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:21,917 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2024-11-19 06:53:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-19 06:53:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:21,918 INFO L225 Difference]: With dead ends: 115 [2024-11-19 06:53:21,918 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:53:21,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:53:21,919 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:21,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 466 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:53:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2024-11-19 06:53:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.5897435897435896) internal successors, (124), 106 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2024-11-19 06:53:21,924 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 21 [2024-11-19 06:53:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:21,925 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2024-11-19 06:53:21,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2024-11-19 06:53:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:53:21,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:21,930 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-11-19 06:53:21,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:53:21,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:21,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1537875595, now seen corresponding path program 1 times [2024-11-19 06:53:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:21,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046414377] [2024-11-19 06:53:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:21,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:22,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:22,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046414377] [2024-11-19 06:53:22,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046414377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:22,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:22,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963415567] [2024-11-19 06:53:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:22,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:53:22,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:22,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:53:22,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:22,049 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:22,108 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2024-11-19 06:53:22,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:53:22,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-19 06:53:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:22,110 INFO L225 Difference]: With dead ends: 117 [2024-11-19 06:53:22,110 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 06:53:22,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:22,111 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 25 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:22,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 511 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 06:53:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-11-19 06:53:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 107 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2024-11-19 06:53:22,116 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 23 [2024-11-19 06:53:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:22,117 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2024-11-19 06:53:22,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2024-11-19 06:53:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:53:22,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:22,118 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] [2024-11-19 06:53:22,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:53:22,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:22,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash 918504240, now seen corresponding path program 1 times [2024-11-19 06:53:22,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:22,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240619280] [2024-11-19 06:53:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240619280] [2024-11-19 06:53:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240619280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:22,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:22,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344857972] [2024-11-19 06:53:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:22,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:22,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:22,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:22,261 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:22,431 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-11-19 06:53:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:22,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-19 06:53:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:22,433 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:53:22,433 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:53:22,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:22,436 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 14 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:22,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 236 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:53:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 06:53:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 107 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2024-11-19 06:53:22,441 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 24 [2024-11-19 06:53:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:22,442 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2024-11-19 06:53:22,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2024-11-19 06:53:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:53:22,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:22,444 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] [2024-11-19 06:53:22,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:53:22,445 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 918504241, now seen corresponding path program 1 times [2024-11-19 06:53:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215464710] [2024-11-19 06:53:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:22,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215464710] [2024-11-19 06:53:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215464710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031349453] [2024-11-19 06:53:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:22,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:22,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:22,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:22,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:53:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:22,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:53:22,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:22,962 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-19 06:53:23,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:23,013 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 16 treesize of output 11 [2024-11-19 06:53:23,027 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:23,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:53:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:23,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:53:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031349453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:23,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:53:23,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-19 06:53:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068588789] [2024-11-19 06:53:23,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:23,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:23,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-19 06:53:23,051 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:23,172 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2024-11-19 06:53:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:23,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-19 06:53:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:23,174 INFO L225 Difference]: With dead ends: 116 [2024-11-19 06:53:23,174 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 06:53:23,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-19 06:53:23,175 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:23,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 199 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2024-11-19 06:53:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 06:53:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-19 06:53:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 107 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-19 06:53:23,179 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 24 [2024-11-19 06:53:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:23,179 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-19 06:53:23,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-19 06:53:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:53:23,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:23,180 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] [2024-11-19 06:53:23,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:23,381 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,SelfDestructingSolverStorable12 [2024-11-19 06:53:23,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash -76820004, now seen corresponding path program 1 times [2024-11-19 06:53:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:23,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020147652] [2024-11-19 06:53:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:53:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:23,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020147652] [2024-11-19 06:53:23,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020147652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:23,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:23,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252103547] [2024-11-19 06:53:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:23,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:23,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:23,539 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:23,695 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-19 06:53:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-19 06:53:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:23,697 INFO L225 Difference]: With dead ends: 111 [2024-11-19 06:53:23,697 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 06:53:23,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:23,697 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:23,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 302 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 06:53:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 06:53:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 106 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2024-11-19 06:53:23,703 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 27 [2024-11-19 06:53:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:23,703 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2024-11-19 06:53:23,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2024-11-19 06:53:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:53:23,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:23,705 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] [2024-11-19 06:53:23,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:53:23,709 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:23,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash -76820003, now seen corresponding path program 1 times [2024-11-19 06:53:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:23,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165503110] [2024-11-19 06:53:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:23,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:23,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:23,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165503110] [2024-11-19 06:53:23,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165503110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:23,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:23,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:23,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258790815] [2024-11-19 06:53:23,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:23,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:23,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:23,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:23,971 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:24,107 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-11-19 06:53:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-19 06:53:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:24,108 INFO L225 Difference]: With dead ends: 110 [2024-11-19 06:53:24,108 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 06:53:24,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:24,109 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:24,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 326 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 06:53:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 06:53:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-11-19 06:53:24,116 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 27 [2024-11-19 06:53:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:24,116 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-11-19 06:53:24,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-11-19 06:53:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:53:24,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:24,117 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] [2024-11-19 06:53:24,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:53:24,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:24,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1002444452, now seen corresponding path program 1 times [2024-11-19 06:53:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056667380] [2024-11-19 06:53:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:25,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:25,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056667380] [2024-11-19 06:53:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056667380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496503335] [2024-11-19 06:53:25,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:25,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:25,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:25,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:53:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:25,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-19 06:53:25,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:25,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:53:25,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:53:25,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:53:25,309 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:53:25,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 06:53:25,375 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 18 treesize of output 13 [2024-11-19 06:53:25,386 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 18 treesize of output 13 [2024-11-19 06:53:25,419 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 06:53:25,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 06:53:25,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 06:53:25,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 06:53:25,567 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 25 treesize of output 13 [2024-11-19 06:53:25,575 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 25 treesize of output 13 [2024-11-19 06:53:25,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:25,639 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2024-11-19 06:53:25,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-19 06:53:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:25,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:31,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:31,057 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 25 treesize of output 26 [2024-11-19 06:53:31,062 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 140 treesize of output 122 [2024-11-19 06:53:31,075 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 17 treesize of output 13 [2024-11-19 06:53:31,079 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 28 treesize of output 20 [2024-11-19 06:53:31,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:31,117 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 25 treesize of output 26 [2024-11-19 06:53:31,121 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 70 treesize of output 58 [2024-11-19 06:53:31,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-11-19 06:53:31,133 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 24 treesize of output 20 [2024-11-19 06:53:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:31,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496503335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:31,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:31,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 38 [2024-11-19 06:53:31,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253822535] [2024-11-19 06:53:31,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:31,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 06:53:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:31,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 06:53:31,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1254, Unknown=23, NotChecked=0, Total=1406 [2024-11-19 06:53:31,271 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 35 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:53:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:32,158 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-11-19 06:53:32,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:53:32,159 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 35 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-19 06:53:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:32,159 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:53:32,160 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:53:32,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=195, Invalid=1673, Unknown=24, NotChecked=0, Total=1892 [2024-11-19 06:53:32,161 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 28 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:32,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1216 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:53:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:53:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 06:53:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 107 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-11-19 06:53:32,164 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 28 [2024-11-19 06:53:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:32,165 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-11-19 06:53:32,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 35 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:53:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-11-19 06:53:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:53:32,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:32,166 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] [2024-11-19 06:53:32,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:32,369 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,SelfDestructingSolverStorable15 [2024-11-19 06:53:32,370 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:32,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash 672845527, now seen corresponding path program 1 times [2024-11-19 06:53:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:32,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058125685] [2024-11-19 06:53:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058125685] [2024-11-19 06:53:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058125685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:32,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:53:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638151223] [2024-11-19 06:53:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:53:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:53:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:53:32,602 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:32,812 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2024-11-19 06:53:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:53:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-19 06:53:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:32,813 INFO L225 Difference]: With dead ends: 113 [2024-11-19 06:53:32,813 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 06:53:32,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:53:32,814 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:32,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 489 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 06:53:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-19 06:53:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-19 06:53:32,818 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 30 [2024-11-19 06:53:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-19 06:53:32,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-19 06:53:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:53:32,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:32,821 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] [2024-11-19 06:53:32,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:53:32,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:32,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 672845528, now seen corresponding path program 1 times [2024-11-19 06:53:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:32,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024795387] [2024-11-19 06:53:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:33,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024795387] [2024-11-19 06:53:33,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024795387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:33,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:33,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:53:33,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504061980] [2024-11-19 06:53:33,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:33,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:53:33,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:33,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:53:33,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:53:33,212 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:33,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:33,498 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-19 06:53:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:53:33,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-19 06:53:33,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:33,499 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:53:33,500 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:53:33,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:53:33,500 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:33,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 484 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:53:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 06:53:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-19 06:53:33,505 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 30 [2024-11-19 06:53:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:33,505 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-19 06:53:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-19 06:53:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:53:33,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:33,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:33,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:53:33,506 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1276486289, now seen corresponding path program 1 times [2024-11-19 06:53:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191312127] [2024-11-19 06:53:33,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:33,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191312127] [2024-11-19 06:53:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191312127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:33,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:33,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:53:33,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577162539] [2024-11-19 06:53:33,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:33,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:53:33,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:33,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:53:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:33,610 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:33,772 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2024-11-19 06:53:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:53:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-19 06:53:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:33,773 INFO L225 Difference]: With dead ends: 128 [2024-11-19 06:53:33,773 INFO L226 Difference]: Without dead ends: 128 [2024-11-19 06:53:33,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:33,774 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:33,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 241 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-19 06:53:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-11-19 06:53:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 118 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2024-11-19 06:53:33,778 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 30 [2024-11-19 06:53:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:33,778 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2024-11-19 06:53:33,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2024-11-19 06:53:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:53:33,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:33,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:33,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:53:33,780 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:33,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1276486288, now seen corresponding path program 1 times [2024-11-19 06:53:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:33,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119154194] [2024-11-19 06:53:33,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:33,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119154194] [2024-11-19 06:53:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119154194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387470090] [2024-11-19 06:53:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:34,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:34,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:34,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:34,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:53:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:34,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:53:34,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:34,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:34,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:34,318 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 23 [2024-11-19 06:53:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387470090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:34,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:34,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2024-11-19 06:53:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295593710] [2024-11-19 06:53:34,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:34,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 06:53:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 06:53:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:53:34,419 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:34,798 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2024-11-19 06:53:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:53:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 06:53:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:34,800 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:53:34,800 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:53:34,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:53:34,801 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 105 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:34,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 548 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:53:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:53:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-11-19 06:53:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 141 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2024-11-19 06:53:34,807 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 30 [2024-11-19 06:53:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:34,807 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2024-11-19 06:53:34,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2024-11-19 06:53:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:53:34,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:34,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:34,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:53:35,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:35,013 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:35,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:35,013 INFO L85 PathProgramCache]: Analyzing trace with hash -916369230, now seen corresponding path program 1 times [2024-11-19 06:53:35,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:35,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409639953] [2024-11-19 06:53:35,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:35,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:35,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:35,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409639953] [2024-11-19 06:53:35,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409639953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:35,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157773685] [2024-11-19 06:53:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:35,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:35,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:35,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:35,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:53:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:35,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:53:35,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:35,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:53:35,425 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-11-19 06:53:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:35,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:53:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157773685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:35,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:53:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2024-11-19 06:53:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541602590] [2024-11-19 06:53:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:35,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:35,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:35,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:35,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:53:35,451 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:35,631 INFO L93 Difference]: Finished difference Result 157 states and 185 transitions. [2024-11-19 06:53:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:53:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-19 06:53:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:35,632 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:53:35,632 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:53:35,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:53:35,633 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 33 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:35,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 417 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:53:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-11-19 06:53:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 141 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2024-11-19 06:53:35,637 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 31 [2024-11-19 06:53:35,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:35,638 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2024-11-19 06:53:35,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:35,638 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2024-11-19 06:53:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:53:35,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:35,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:35,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:53:35,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:35,843 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:35,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1657947094, now seen corresponding path program 1 times [2024-11-19 06:53:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:35,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943934747] [2024-11-19 06:53:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943934747] [2024-11-19 06:53:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943934747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:35,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:53:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980910915] [2024-11-19 06:53:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:35,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:35,942 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:36,032 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2024-11-19 06:53:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-19 06:53:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:36,034 INFO L225 Difference]: With dead ends: 149 [2024-11-19 06:53:36,034 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 06:53:36,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:36,035 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 43 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:36,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 466 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 06:53:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2024-11-19 06:53:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.396551724137931) internal successors, (162), 139 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2024-11-19 06:53:36,040 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 32 [2024-11-19 06:53:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:36,040 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2024-11-19 06:53:36,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2024-11-19 06:53:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:53:36,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:36,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:36,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:53:36,041 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:36,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:36,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1657325071, now seen corresponding path program 1 times [2024-11-19 06:53:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738905772] [2024-11-19 06:53:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:36,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738905772] [2024-11-19 06:53:36,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738905772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963907978] [2024-11-19 06:53:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:36,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:36,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:36,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:53:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:36,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:53:36,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:36,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:53:36,481 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 29 treesize of output 13 [2024-11-19 06:53:36,510 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 17 treesize of output 9 [2024-11-19 06:53:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:36,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:53:36,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963907978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:36,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:53:36,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2024-11-19 06:53:36,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288382188] [2024-11-19 06:53:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:36,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:53:36,515 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:36,746 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-11-19 06:53:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:36,747 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-19 06:53:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:36,748 INFO L225 Difference]: With dead ends: 148 [2024-11-19 06:53:36,749 INFO L226 Difference]: Without dead ends: 148 [2024-11-19 06:53:36,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:53:36,749 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 32 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:36,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 336 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-19 06:53:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-11-19 06:53:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 139 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2024-11-19 06:53:36,754 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 32 [2024-11-19 06:53:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:36,754 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2024-11-19 06:53:36,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2024-11-19 06:53:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:53:36,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:36,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:36,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:53:36,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 06:53:36,956 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:36,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:36,957 INFO L85 PathProgramCache]: Analyzing trace with hash -162530220, now seen corresponding path program 1 times [2024-11-19 06:53:36,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:36,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735425740] [2024-11-19 06:53:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:36,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735425740] [2024-11-19 06:53:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735425740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063865018] [2024-11-19 06:53:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:37,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:37,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:37,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:37,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:53:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:37,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:53:37,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:37,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:53:37,521 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:53:37,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:53:37,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:53:37,555 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 29 treesize of output 13 [2024-11-19 06:53:37,582 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 17 treesize of output 9 [2024-11-19 06:53:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:37,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:53:37,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063865018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:37,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:53:37,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 11 [2024-11-19 06:53:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647102262] [2024-11-19 06:53:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:37,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:37,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:37,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:53:37,590 INFO L87 Difference]: Start difference. First operand 144 states and 167 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:37,783 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2024-11-19 06:53:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:53:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-19 06:53:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:37,784 INFO L225 Difference]: With dead ends: 144 [2024-11-19 06:53:37,785 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 06:53:37,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:53:37,785 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 11 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:37,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 338 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 06:53:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-19 06:53:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 139 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 166 transitions. [2024-11-19 06:53:37,789 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 166 transitions. Word has length 33 [2024-11-19 06:53:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 166 transitions. [2024-11-19 06:53:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 166 transitions. [2024-11-19 06:53:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:53:37,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:37,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:37,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:37,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:37,991 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:37,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash -743469390, now seen corresponding path program 1 times [2024-11-19 06:53:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:37,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549497501] [2024-11-19 06:53:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:37,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:38,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549497501] [2024-11-19 06:53:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549497501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185856116] [2024-11-19 06:53:38,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:38,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:38,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:53:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:38,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 06:53:38,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:38,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:53:38,612 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:38,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:53:38,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:53:38,670 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 28 treesize of output 12 [2024-11-19 06:53:38,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 06:53:38,776 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-11-19 06:53:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:38,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:53:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185856116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:53:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2024-11-19 06:53:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335144317] [2024-11-19 06:53:38,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:38,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:53:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:53:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:53:38,780 INFO L87 Difference]: Start difference. First operand 144 states and 166 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:39,065 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-11-19 06:53:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:53:39,065 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-19 06:53:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:39,066 INFO L225 Difference]: With dead ends: 147 [2024-11-19 06:53:39,066 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 06:53:39,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:53:39,067 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:39,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 432 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 06:53:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-19 06:53:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 139 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 165 transitions. [2024-11-19 06:53:39,070 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 165 transitions. Word has length 34 [2024-11-19 06:53:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:39,071 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 165 transitions. [2024-11-19 06:53:39,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2024-11-19 06:53:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:53:39,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:39,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:39,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:39,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:39,272 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1572714536, now seen corresponding path program 1 times [2024-11-19 06:53:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:39,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704131713] [2024-11-19 06:53:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704131713] [2024-11-19 06:53:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704131713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:39,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:39,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:53:39,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374855932] [2024-11-19 06:53:39,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:39,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:53:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:39,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:53:39,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:53:39,648 INFO L87 Difference]: Start difference. First operand 144 states and 165 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:39,822 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2024-11-19 06:53:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:53:39,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-19 06:53:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:39,823 INFO L225 Difference]: With dead ends: 146 [2024-11-19 06:53:39,824 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 06:53:39,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:53:39,824 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 34 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:39,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 531 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 06:53:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-19 06:53:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 139 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2024-11-19 06:53:39,831 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 35 [2024-11-19 06:53:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:39,831 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2024-11-19 06:53:39,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2024-11-19 06:53:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:53:39,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:39,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:39,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 06:53:39,832 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:39,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1509510222, now seen corresponding path program 1 times [2024-11-19 06:53:39,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:39,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149557612] [2024-11-19 06:53:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:40,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:40,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149557612] [2024-11-19 06:53:40,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149557612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:40,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:40,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:53:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715394138] [2024-11-19 06:53:40,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:40,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:53:40,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:40,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:53:40,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:53:40,186 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:40,420 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2024-11-19 06:53:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:53:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-19 06:53:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:40,421 INFO L225 Difference]: With dead ends: 145 [2024-11-19 06:53:40,421 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 06:53:40,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:53:40,422 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:40,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 501 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 06:53:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-19 06:53:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.353448275862069) internal successors, (157), 139 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2024-11-19 06:53:40,425 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 36 [2024-11-19 06:53:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:40,426 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2024-11-19 06:53:40,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2024-11-19 06:53:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:53:40,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:40,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:40,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 06:53:40,427 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash 449823514, now seen corresponding path program 1 times [2024-11-19 06:53:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:40,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950130160] [2024-11-19 06:53:40,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:41,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950130160] [2024-11-19 06:53:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950130160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023907623] [2024-11-19 06:53:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:41,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:41,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:41,030 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:41,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:53:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:41,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 06:53:41,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:41,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:53:41,318 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:53:41,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 06:53:41,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:53:41,450 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 43 treesize of output 23 [2024-11-19 06:53:41,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-11-19 06:53:41,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:41,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2024-11-19 06:53:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:41,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:42,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:42,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 449 treesize of output 409 [2024-11-19 06:53:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:45,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023907623] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:45,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:45,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17, 15] total 39 [2024-11-19 06:53:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562694204] [2024-11-19 06:53:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:45,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:53:45,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:45,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:53:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1432, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 06:53:45,971 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:47,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 06:53:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:52,846 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2024-11-19 06:53:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:53:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-19 06:53:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:52,847 INFO L225 Difference]: With dead ends: 144 [2024-11-19 06:53:52,847 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 06:53:52,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 06:53:52,848 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:52,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 393 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 06:53:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 06:53:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-19 06:53:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 139 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2024-11-19 06:53:52,855 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 37 [2024-11-19 06:53:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:52,855 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2024-11-19 06:53:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2024-11-19 06:53:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:53:52,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:52,856 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] [2024-11-19 06:53:52,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:53,059 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,SelfDestructingSolverStorable27 [2024-11-19 06:53:53,059 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:53,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash 970674154, now seen corresponding path program 1 times [2024-11-19 06:53:53,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:53,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560731874] [2024-11-19 06:53:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:53,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560731874] [2024-11-19 06:53:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560731874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059799489] [2024-11-19 06:53:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:53,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:53,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:53,307 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:53,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:53:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:53,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 06:53:53,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:53,590 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-19 06:53:53,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:53,605 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 16 treesize of output 11 [2024-11-19 06:53:53,612 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:53,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:53:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 06:53:53,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059799489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:53,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:53,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2024-11-19 06:53:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969458493] [2024-11-19 06:53:53,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:53,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 06:53:53,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:53,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 06:53:53,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=490, Unknown=1, NotChecked=44, Total=600 [2024-11-19 06:53:53,851 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 21 states, 20 states have (on average 3.4) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:54,375 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2024-11-19 06:53:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:53:54,375 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.4) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2024-11-19 06:53:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:54,376 INFO L225 Difference]: With dead ends: 173 [2024-11-19 06:53:54,376 INFO L226 Difference]: Without dead ends: 173 [2024-11-19 06:53:54,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=932, Unknown=3, NotChecked=62, Total=1122 [2024-11-19 06:53:54,377 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:54,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 686 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 539 Invalid, 0 Unknown, 131 Unchecked, 0.3s Time] [2024-11-19 06:53:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-19 06:53:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2024-11-19 06:53:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 133 states have (on average 1.3533834586466165) internal successors, (180), 156 states have internal predecessors, (180), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2024-11-19 06:53:54,381 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 39 [2024-11-19 06:53:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:54,382 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2024-11-19 06:53:54,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.4) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2024-11-19 06:53:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:53:54,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:54,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:54,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:54,583 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,SelfDestructingSolverStorable28 [2024-11-19 06:53:54,583 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:54,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1511295107, now seen corresponding path program 1 times [2024-11-19 06:53:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:54,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347320419] [2024-11-19 06:53:54,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:55,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:55,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347320419] [2024-11-19 06:53:55,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347320419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:55,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:55,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 06:53:55,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244635821] [2024-11-19 06:53:55,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:55,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:53:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:53:55,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:53:55,028 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:55,256 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2024-11-19 06:53:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:53:55,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-19 06:53:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:55,257 INFO L225 Difference]: With dead ends: 162 [2024-11-19 06:53:55,257 INFO L226 Difference]: Without dead ends: 162 [2024-11-19 06:53:55,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:53:55,258 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:55,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 502 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-19 06:53:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-19 06:53:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 156 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2024-11-19 06:53:55,262 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 39 [2024-11-19 06:53:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:55,262 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2024-11-19 06:53:55,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2024-11-19 06:53:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:53:55,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:55,263 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-19 06:53:55,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 06:53:55,264 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:55,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash -173419745, now seen corresponding path program 1 times [2024-11-19 06:53:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:55,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076553069] [2024-11-19 06:53:55,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:55,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:53:55,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:55,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076553069] [2024-11-19 06:53:55,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076553069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:55,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442141274] [2024-11-19 06:53:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:55,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:55,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:55,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:55,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:53:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:55,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:53:55,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:55,918 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:55,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:53:55,933 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 19 treesize of output 1 [2024-11-19 06:53:55,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:55,986 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 42 treesize of output 41 [2024-11-19 06:53:56,032 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:56,032 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 42 treesize of output 41 [2024-11-19 06:53:56,042 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 31 treesize of output 13 [2024-11-19 06:53:56,057 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-19 06:53:56,084 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:53:56,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:53:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-19 06:53:56,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442141274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:56,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 21 [2024-11-19 06:53:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660062976] [2024-11-19 06:53:56,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:56,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:53:56,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:56,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:53:56,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2024-11-19 06:53:56,136 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:53:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:56,463 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2024-11-19 06:53:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:53:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-19 06:53:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:56,464 INFO L225 Difference]: With dead ends: 160 [2024-11-19 06:53:56,464 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 06:53:56,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2024-11-19 06:53:56,465 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 13 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:56,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 555 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 374 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2024-11-19 06:53:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 06:53:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-19 06:53:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 133 states have (on average 1.3157894736842106) internal successors, (175), 154 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2024-11-19 06:53:56,470 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 42 [2024-11-19 06:53:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:56,471 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2024-11-19 06:53:56,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:53:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2024-11-19 06:53:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:53:56,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:56,472 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-19 06:53:56,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 06:53:56,672 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,SelfDestructingSolverStorable30 [2024-11-19 06:53:56,673 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -173419744, now seen corresponding path program 1 times [2024-11-19 06:53:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49485929] [2024-11-19 06:53:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:57,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:57,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49485929] [2024-11-19 06:53:57,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49485929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:57,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843466147] [2024-11-19 06:53:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:57,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:57,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:57,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:57,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 06:53:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:57,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 06:53:57,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:57,557 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-11-19 06:53:57,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:57,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:53:57,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:53:57,683 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 19 treesize of output 1 [2024-11-19 06:53:57,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:57,761 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 73 treesize of output 66 [2024-11-19 06:53:57,773 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 30 treesize of output 13 [2024-11-19 06:53:57,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:57,858 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 73 treesize of output 66 [2024-11-19 06:53:57,864 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 30 treesize of output 13 [2024-11-19 06:53:57,878 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 42 treesize of output 18 [2024-11-19 06:53:57,884 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 9 treesize of output 3 [2024-11-19 06:53:57,940 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-19 06:53:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:57,958 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-11-19 06:53:57,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:57,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:53:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 06:53:57,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843466147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:58,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2024-11-19 06:53:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131700355] [2024-11-19 06:53:58,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:58,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 06:53:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 06:53:58,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=781, Unknown=1, NotChecked=56, Total=930 [2024-11-19 06:53:58,069 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:53:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:58,664 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2024-11-19 06:53:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:53:58,664 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-11-19 06:53:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:58,665 INFO L225 Difference]: With dead ends: 156 [2024-11-19 06:53:58,665 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 06:53:58,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=1433, Unknown=1, NotChecked=78, Total=1722 [2024-11-19 06:53:58,666 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 47 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:58,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 784 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 696 Invalid, 0 Unknown, 88 Unchecked, 0.3s Time] [2024-11-19 06:53:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 06:53:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-19 06:53:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.255639097744361) internal successors, (167), 150 states have internal predecessors, (167), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2024-11-19 06:53:58,670 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 42 [2024-11-19 06:53:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:58,670 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2024-11-19 06:53:58,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:53:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2024-11-19 06:53:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:53:58,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:58,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:58,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:58,875 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,SelfDestructingSolverStorable31 [2024-11-19 06:53:58,876 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:58,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1149725730, now seen corresponding path program 1 times [2024-11-19 06:53:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935587392] [2024-11-19 06:53:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:59,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:59,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935587392] [2024-11-19 06:53:59,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935587392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:59,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:59,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:59,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938449746] [2024-11-19 06:53:59,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:59,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:59,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:59,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:59,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:59,021 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:59,145 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2024-11-19 06:53:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:59,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-11-19 06:53:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:59,147 INFO L225 Difference]: With dead ends: 160 [2024-11-19 06:53:59,147 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 06:53:59,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:59,147 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:59,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 364 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 06:53:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2024-11-19 06:53:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 153 states have internal predecessors, (171), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2024-11-19 06:53:59,151 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 42 [2024-11-19 06:53:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:59,152 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2024-11-19 06:53:59,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2024-11-19 06:53:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:53:59,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:59,152 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, 1, 1, 1, 1] [2024-11-19 06:53:59,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 06:53:59,153 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:53:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash -884803614, now seen corresponding path program 1 times [2024-11-19 06:53:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178657251] [2024-11-19 06:53:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:59,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:59,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178657251] [2024-11-19 06:53:59,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178657251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:59,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187090970] [2024-11-19 06:53:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:59,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:59,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:59,912 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-11-19 06:53:59,914 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-11-19 06:54:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:00,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 06:54:00,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:54:00,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:54:00,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:54:00,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:54:00,160 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:54:00,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:54:00,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:54:00,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:54:00,234 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:54:00,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:54:00,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:54:00,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:54:00,299 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 23 treesize of output 11 [2024-11-19 06:54:00,307 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 23 treesize of output 11 [2024-11-19 06:54:00,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:54:00,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-19 06:54:00,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 06:54:00,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:54:00,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:00,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2024-11-19 06:54:00,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:00,613 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 17 treesize of output 15 [2024-11-19 06:54:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:00,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:54:01,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:01,980 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 31 treesize of output 32 [2024-11-19 06:54:01,984 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 188 treesize of output 182 [2024-11-19 06:54:01,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 78 [2024-11-19 06:54:02,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:02,002 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 167 treesize of output 167 [2024-11-19 06:54:02,012 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 118 treesize of output 114 [2024-11-19 06:54:02,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:02,220 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 31 treesize of output 32 [2024-11-19 06:54:02,224 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 94 treesize of output 90 [2024-11-19 06:54:02,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:02,235 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 147 treesize of output 147 [2024-11-19 06:54:02,242 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 180 treesize of output 176 [2024-11-19 06:54:02,250 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 99 treesize of output 97 [2024-11-19 06:54:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:02,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187090970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:54:02,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:54:02,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 47 [2024-11-19 06:54:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330077470] [2024-11-19 06:54:02,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:54:02,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-19 06:54:02,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:02,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-19 06:54:02,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2001, Unknown=4, NotChecked=0, Total=2162 [2024-11-19 06:54:02,712 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 45 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:54:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:03,749 INFO L93 Difference]: Finished difference Result 162 states and 182 transitions. [2024-11-19 06:54:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:54:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 45 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-19 06:54:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:03,751 INFO L225 Difference]: With dead ends: 162 [2024-11-19 06:54:03,751 INFO L226 Difference]: Without dead ends: 162 [2024-11-19 06:54:03,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=260, Invalid=2928, Unknown=4, NotChecked=0, Total=3192 [2024-11-19 06:54:03,752 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 38 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:03,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 876 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:54:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-19 06:54:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-19 06:54:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 156 states have internal predecessors, (174), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:54:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 182 transitions. [2024-11-19 06:54:03,756 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 182 transitions. Word has length 45 [2024-11-19 06:54:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:03,756 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 182 transitions. [2024-11-19 06:54:03,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 45 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:54:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 182 transitions. [2024-11-19 06:54:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:54:03,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:03,757 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:03,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 06:54:03,958 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,SelfDestructingSolverStorable33 [2024-11-19 06:54:03,959 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:54:03,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash -361567797, now seen corresponding path program 1 times [2024-11-19 06:54:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317277986] [2024-11-19 06:54:03,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:04,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:04,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317277986] [2024-11-19 06:54:04,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317277986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:04,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549229473] [2024-11-19 06:54:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:54:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:04,684 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-11-19 06:54:04,685 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-11-19 06:54:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:04,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 06:54:04,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:54:04,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:54:04,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:54:04,980 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 19 treesize of output 1 [2024-11-19 06:54:05,050 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:54:05,051 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 31 treesize of output 32 [2024-11-19 06:54:05,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:54:05,084 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 42 treesize of output 41 [2024-11-19 06:54:05,173 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 31 treesize of output 13 [2024-11-19 06:54:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:05,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:54:05,262 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 06:54:05,262 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 21 treesize of output 20 [2024-11-19 06:54:05,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_1985) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) |c_ULTIMATE.start_create_#t~mem12#1.base|)) is different from false [2024-11-19 06:54:05,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1985) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))))) is different from false [2024-11-19 06:54:05,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1984))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= (select (select (store .cse0 .cse1 v_ArrVal_1985) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) .cse1)))) is different from false [2024-11-19 06:54:05,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:05,321 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 63 treesize of output 44 [2024-11-19 06:54:05,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:05,329 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 420 treesize of output 317 [2024-11-19 06:54:05,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:05,339 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 82 treesize of output 63 [2024-11-19 06:54:05,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2024-11-19 06:54:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549229473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:05,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:54:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 29 [2024-11-19 06:54:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217789961] [2024-11-19 06:54:05,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:54:05,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 06:54:05,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:05,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 06:54:05,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1066, Unknown=13, NotChecked=204, Total=1406 [2024-11-19 06:54:05,463 INFO L87 Difference]: Start difference. First operand 162 states and 182 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:54:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:05,963 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2024-11-19 06:54:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:54:05,963 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-19 06:54:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:05,964 INFO L225 Difference]: With dead ends: 165 [2024-11-19 06:54:05,964 INFO L226 Difference]: Without dead ends: 165 [2024-11-19 06:54:05,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1764, Unknown=14, NotChecked=264, Total=2256 [2024-11-19 06:54:05,965 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:05,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 908 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:54:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-19 06:54:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-19 06:54:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 159 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:54:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2024-11-19 06:54:05,969 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 46 [2024-11-19 06:54:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:05,969 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2024-11-19 06:54:05,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:54:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2024-11-19 06:54:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:54:05,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:05,971 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:05,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 06:54:06,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-19 06:54:06,171 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:54:06,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash -361567796, now seen corresponding path program 1 times [2024-11-19 06:54:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:06,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78382908] [2024-11-19 06:54:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:06,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:07,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78382908] [2024-11-19 06:54:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78382908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831274447] [2024-11-19 06:54:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:07,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:54:07,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:07,066 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-11-19 06:54:07,068 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-11-19 06:54:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:07,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-19 06:54:07,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:54:07,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:54:07,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:54:07,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:54:07,443 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 19 treesize of output 1 [2024-11-19 06:54:07,512 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:54:07,512 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 51 treesize of output 48 [2024-11-19 06:54:07,516 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 30 treesize of output 13 [2024-11-19 06:54:07,561 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:54:07,562 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 62 treesize of output 57 [2024-11-19 06:54:07,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 30 treesize of output 13 [2024-11-19 06:54:07,685 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 31 treesize of output 13 [2024-11-19 06:54:07,687 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 9 treesize of output 3 [2024-11-19 06:54:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:07,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:54:07,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:07,898 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 44 treesize of output 48 [2024-11-19 06:54:07,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2115 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2115) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0))) (forall ((v_prenex_4 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_prenex_4) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2116 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2116) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0))))) is different from false [2024-11-19 06:54:08,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2113 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2113) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2114) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2116) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (forall ((v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2114))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (= (select (select (store .cse2 .cse3 v_ArrVal_2115) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2113 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2113) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2114) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_prenex_4) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 1)))) is different from false [2024-11-19 06:54:08,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:08,183 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 44 treesize of output 45 [2024-11-19 06:54:08,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:08,189 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 34 treesize of output 35 [2024-11-19 06:54:08,193 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 60 treesize of output 48 [2024-11-19 06:54:08,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:08,203 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 200 treesize of output 187 [2024-11-19 06:54:08,212 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-11-19 06:54:08,221 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 76 [2024-11-19 06:54:08,226 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 54 treesize of output 46 [2024-11-19 06:54:08,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:08,277 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 44 treesize of output 45 [2024-11-19 06:54:08,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:08,284 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-11-19 06:54:08,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:54:08,294 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 34 treesize of output 22 [2024-11-19 06:54:08,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:54:08,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:54:08,302 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 22 treesize of output 10 [2024-11-19 06:54:08,313 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-19 06:54:08,315 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 63 treesize of output 1 [2024-11-19 06:54:08,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831274447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:08,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:54:08,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2024-11-19 06:54:08,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674444479] [2024-11-19 06:54:08,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:54:08,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 06:54:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:08,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 06:54:08,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1461, Unknown=40, NotChecked=158, Total=1806 [2024-11-19 06:54:08,405 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 33 states, 32 states have (on average 2.5625) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:54:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:09,064 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2024-11-19 06:54:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:54:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.5625) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-19 06:54:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:09,065 INFO L225 Difference]: With dead ends: 169 [2024-11-19 06:54:09,065 INFO L226 Difference]: Without dead ends: 169 [2024-11-19 06:54:09,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=2081, Unknown=43, NotChecked=190, Total=2550 [2024-11-19 06:54:09,066 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 21 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:09,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1201 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:54:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-19 06:54:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-19 06:54:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.2465753424657535) internal successors, (182), 163 states have internal predecessors, (182), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:54:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2024-11-19 06:54:09,071 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 46 [2024-11-19 06:54:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:09,072 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2024-11-19 06:54:09,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5625) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:54:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2024-11-19 06:54:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:54:09,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:09,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:09,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 06:54:09,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:54:09,278 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:54:09,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1659109671, now seen corresponding path program 1 times [2024-11-19 06:54:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:09,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691668766] [2024-11-19 06:54:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:10,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-11-19 06:54:10,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691668766] [2024-11-19 06:54:10,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691668766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242580267] [2024-11-19 06:54:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:10,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:54:10,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:10,596 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:54:10,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 06:54:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:10,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-19 06:54:10,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:54:10,862 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:54:10,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2024-11-19 06:54:10,921 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-19 06:54:10,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2024-11-19 06:54:10,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:54:11,021 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 36 treesize of output 24 [2024-11-19 06:54:11,357 INFO L349 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2024-11-19 06:54:11,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 80 [2024-11-19 06:54:11,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:54:11,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:11,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 63 [2024-11-19 06:54:19,612 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0) (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_destroy_~l#1.base|)) (.cse61 (= |c_ULTIMATE.start_destroy_~l#1.base| 0)) (.cse26 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 0))) (let ((.cse21 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= |c_#valid| (store .cse26 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (.cse2 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 16))) (.cse8 (not .cse61)) (.cse4 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| .cse3)) (.cse0 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0)))) (or (and .cse0 (let ((.cse13 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (= |c_#valid| (store .cse26 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse26 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (.cse43 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= |c_#valid| (store .cse26 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (.cse41 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= (select .cse54 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse54 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))))) (let ((.cse1 (and .cse41 .cse8)) (.cse23 (and .cse8 .cse43)) (.cse24 (and .cse8 .cse13)) (.cse18 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (or .cse1 (and .cse2 (let ((.cse11 (exists ((v_arrayElimCell_130 Int)) (and (= (select (store .cse18 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0)))) (.cse20 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse46 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse48 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse46))) (let ((.cse47 (store (store .cse48 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0))) (and (= .cse46 (select .cse47 v_arrayElimCell_132)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store (store .cse48 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select .cse47 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_130)))))))) (.cse15 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (let ((.cse45 (store .cse4 v_arrayElimCell_130 0))) (and (= (select .cse45 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse45 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)))))) (.cse12 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (let ((.cse44 (store .cse4 v_arrayElimCell_130 0))) (and (= (select .cse44 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse44 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))))) (.cse9 (exists ((v_arrayElimCell_130 Int)) (and (= (select (store .cse18 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)))))) (or .cse1 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse5 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse7 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse5))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_132 0)) (= .cse5 (select .cse6 v_arrayElimCell_132)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store (store .cse7 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select .cse6 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))))) (and .cse8 .cse9) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse10 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= |c_#valid| (store (store .cse10 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store .cse10 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_133 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (and (or .cse11 .cse12 .cse13) .cse8) (and .cse11 .cse8) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int)) (let ((.cse14 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= |c_#valid| (store (store .cse14 |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= v_arrayElimCell_133 0)) (= (select (store (store .cse14 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (and (or .cse15 .cse13 .cse9) .cse8) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse16 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_132 0)) (= (select .cse16 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store .cse16 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse17 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0))) (and (= (select .cse17 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store .cse17 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (exists ((v_arrayElimCell_130 Int)) (and (= (select (store .cse18 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse19 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0))) (and (= (select .cse19 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (= |c_#valid| (store .cse19 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) (and .cse20 .cse8) .cse21 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse22 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_133 0)) (= (select .cse22 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store .cse22 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) .cse23 .cse24 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse25 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store .cse25 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= (select .cse25 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store .cse26 v_arrayElimCell_132 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 1) |c_ULTIMATE.start_destroy_~l#1.base| 0) v_arrayElimCell_132) 1))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse27 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store .cse27 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store (store (store .cse27 |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) v_arrayElimCell_132 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) v_arrayElimCell_132) 1))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse28 (select |c_#valid| v_arrayElimCell_132))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 .cse28) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse28) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse29 (select |c_#valid| v_arrayElimCell_132))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 .cse29) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse29) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse32 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse30 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 .cse32))) (let ((.cse31 (store (store .cse30 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse30 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select .cse31 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0) (= .cse32 (select .cse31 v_arrayElimCell_132))))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int)) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| 0))) (and (= (select .cse33 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse33 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse34 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= |c_#valid| (store (store .cse34 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store .cse34 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_133 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse35 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_133 0)) (= (select .cse35 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store .cse35 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (let ((.cse36 (store .cse4 v_arrayElimCell_130 0))) (and (= (select .cse36 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse36 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0)))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse37 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse39 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse37))) (let ((.cse38 (store (store .cse39 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0))) (and (= .cse37 (select .cse38 v_arrayElimCell_132)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store (store .cse39 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select .cse38 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse40 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0))) (and (not (= v_arrayElimCell_132 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= (select .cse40 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse40 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (and (or .cse11 .cse41 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse42 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0))) (and (= (select .cse42 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store .cse42 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) .cse20 .cse15 .cse12 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)))) .cse43 .cse13 .cse9) .cse8)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse49 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_133 0))) (and (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (= |c_#valid| (store .cse49 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 0)) (= (select .cse49 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int)) (let ((.cse50 (store .cse4 v_arrayElimCell_133 0))) (and (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store .cse50 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select .cse50 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) .cse23 .cse24 (exists ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse53 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse51 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse53))) (let ((.cse52 (store (store .cse51 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_133 0))) (and (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (= |c_#valid| (store (store .cse51 v_arrayElimCell_133 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select .cse52 v_arrayElimCell_132) .cse53) (not (= v_arrayElimCell_133 0)) (= (select .cse52 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))))) (exists ((v_arrayElimCell_133 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (not (= v_arrayElimCell_133 0)) (= (select (store .cse18 v_arrayElimCell_133 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_133 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_133 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))))) (and (or .cse21 (and (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (exists ((v_arrayElimCell_132 Int)) (let ((.cse55 (select |c_#valid| v_arrayElimCell_132))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 .cse55) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse55) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)))) (and (exists ((v_arrayElimCell_130 Int) (v_DerPreprocessor_5 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_DerPreprocessor_5) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) .cse8) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (exists ((v_arrayElimCell_130 Int)) (and (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (exists ((v_arrayElimCell_130 Int)) (and (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)))))) (and (exists ((v_arrayElimCell_130 Int) (v_DerPreprocessor_5 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_DerPreprocessor_5) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1))) .cse8) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse56 (select |c_#valid| v_arrayElimCell_132))) (and (= (select (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 .cse56) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse56) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))))) (and (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_5 Int)) (let ((.cse57 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= |c_#valid| (store (store .cse57 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= (select (store (store .cse57 |c_ULTIMATE.start_destroy_~l#1.base| v_DerPreprocessor_5) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) .cse8)) .cse0) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (exists ((v_arrayElimCell_130 Int)) (and (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)))) (and (exists ((v_arrayElimCell_130 Int) (v_DerPreprocessor_3 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_DerPreprocessor_3) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) .cse8)) .cse2) (and (let ((.cse70 (exists ((v_arrayElimCell_132 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0)))))) (let ((.cse58 (and .cse8 (exists ((v_arrayElimCell_133 Int)) (and (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_133 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))) (.cse59 (and (exists ((v_arrayElimCell_133 Int)) (and (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) .cse61)) (.cse62 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse60 (and .cse8 .cse70))) (or (and (exists ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_133 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) .cse8) .cse58 .cse59 .cse60 (and (exists ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) v_arrayElimCell_133 0) 0 0)) (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) .cse61) (and .cse62 (or .cse58 .cse59)) (and .cse2 (let ((.cse63 (and .cse61 (exists ((v_arrayElimCell_130 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))))) (.cse66 (and .cse61 (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse76 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= v_DerPreprocessor_22 (select (store (store .cse76 0 v_DerPreprocessor_22) v_arrayElimCell_130 0) 0)) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse76 v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))))) (.cse64 (and (exists ((v_arrayElimCell_130 Int)) (and (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) .cse8)) (.cse69 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))) (.cse68 (exists ((v_arrayElimCell_130 Int)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) 0 0)))) (.cse71 (exists ((v_arrayElimCell_130 Int)) (and (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))))) (or .cse63 (and .cse62 (or .cse63 .cse64)) (and .cse8 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (and .cse62 (or (exists ((v_arrayElimCell_133 Int) (v_DerPreprocessor_21 Int)) (let ((.cse65 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= (select (store (store .cse65 0 v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0) v_DerPreprocessor_21) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= |c_#valid| (store (store .cse65 |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) .cse66 (and .cse8 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_DerPreprocessor_21 Int)) (let ((.cse67 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= |c_#valid| (store (store (store .cse67 |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= v_DerPreprocessor_21 (select (store (store (store .cse67 0 v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))))) (exists ((v_arrayElimCell_133 Int)) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) .cse66 .cse64 (and (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_130)))) .cse8) (and .cse68 .cse8) (and .cse69 .cse8) (and .cse61 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))) (and .cse8 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (and (or .cse69 .cse68 .cse70 (and .cse62 (exists ((v_arrayElimCell_130 Int) (v_DerPreprocessor_21 Int)) (and (= v_DerPreprocessor_21 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) 0)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) 0 0))))) .cse71) .cse8) (and .cse61 (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse72 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= v_DerPreprocessor_22 (select (store (store .cse72 0 v_DerPreprocessor_22) v_arrayElimCell_130 0) 0)) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse72 v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))) .cse60 (and .cse61 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_DerPreprocessor_19 Int)) (let ((.cse73 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse73 v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (= v_DerPreprocessor_19 (select (store (store .cse73 0 v_DerPreprocessor_19) v_arrayElimCell_130 0) 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))) (and (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse74 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)))) (and (not (= v_arrayElimCell_132 0)) (= (select (store (store .cse74 0 v_DerPreprocessor_22) v_arrayElimCell_130 0) 0) v_DerPreprocessor_22) (= |c_#valid| (store (store .cse74 v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))) .cse61) (and .cse8 .cse71) (exists ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) (and .cse61 (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse75 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)))) (and (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= v_DerPreprocessor_22 (select (store (store .cse75 0 v_DerPreprocessor_22) v_arrayElimCell_130 0) 0)) (= |c_#valid| (store (store .cse75 v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))) (and .cse8 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| .cse3) v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((v_arrayElimCell_132 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0))))))) (and (= |c_#valid| (store .cse26 0 0)) .cse8)))) .cse0))))) is different from false [2024-11-19 06:54:27,034 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_destroy_~l#1.base|)) (.cse60 (= |c_ULTIMATE.start_destroy_~l#1.base| 0))) (let ((.cse51 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 16))) (.cse17 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 0)) (.cse14 (not .cse60)) (.cse4 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| .cse2)) (.cse53 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0)))) (or (and (let ((.cse20 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (= |c_#valid| (store .cse17 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse17 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (.cse39 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= |c_#valid| (store .cse17 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (.cse44 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse52 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= (select .cse52 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse52 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))))) (let ((.cse0 (and .cse44 .cse14)) (.cse5 (and .cse14 .cse39)) (.cse6 (and .cse14 .cse20)) (.cse7 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (or .cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse1 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_133 0))) (and (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (= |c_#valid| (store .cse1 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 0)) (= (select .cse1 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int)) (let ((.cse3 (store .cse4 v_arrayElimCell_133 0))) (and (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store .cse3 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select .cse3 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) .cse5 .cse6 (exists ((v_arrayElimCell_133 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store .cse7 v_arrayElimCell_133 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) (exists ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse10 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse8 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse10))) (let ((.cse9 (store (store .cse8 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_133 0))) (and (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (= |c_#valid| (store (store .cse8 v_arrayElimCell_133 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select .cse9 v_arrayElimCell_132) .cse10) (not (= v_arrayElimCell_133 0)) (= (select .cse9 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_133 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_133 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) (and (let ((.cse18 (exists ((v_arrayElimCell_130 Int)) (and (= (select (store .cse7 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0)))) (.cse26 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse48 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse50 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse48))) (let ((.cse49 (store (store .cse50 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0))) (and (= .cse48 (select .cse49 v_arrayElimCell_132)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store (store .cse50 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select .cse49 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_130)))))))) (.cse22 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (let ((.cse47 (store .cse4 v_arrayElimCell_130 0))) (and (= (select .cse47 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse47 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)))))) (.cse19 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (let ((.cse46 (store .cse4 v_arrayElimCell_130 0))) (and (= (select .cse46 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse46 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))))) (.cse15 (exists ((v_arrayElimCell_130 Int)) (and (= (select (store .cse7 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)))))) (or .cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse11 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse13 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse11))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_132 0)) (= .cse11 (select .cse12 v_arrayElimCell_132)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store (store .cse13 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select .cse12 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))))) (and .cse14 .cse15) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse16 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= |c_#valid| (store (store .cse16 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store .cse16 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_133 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((v_arrayElimCell_132 Int)) (and (= |c_#valid| (store .cse17 v_arrayElimCell_132 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 1) |c_ULTIMATE.start_destroy_~l#1.base| 0) v_arrayElimCell_132) 1))) (and (or .cse18 .cse19 .cse20) .cse14) (and .cse18 .cse14) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int)) (let ((.cse21 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= |c_#valid| (store (store .cse21 |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= v_arrayElimCell_133 0)) (= (select (store (store .cse21 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (and (or .cse22 .cse20 .cse15) .cse14) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse23 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_132 0)) (= (select .cse23 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store .cse23 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse24 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0))) (and (= (select .cse24 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) .cse18 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse25 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0))) (and (= (select .cse25 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (= |c_#valid| (store .cse25 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) (and .cse26 .cse14) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse27 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_133 0)) (= (select .cse27 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store .cse27 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) .cse5 .cse6 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse28 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store .cse28 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= (select .cse28 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse29 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store .cse29 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store (store (store .cse29 |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) v_arrayElimCell_132 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) v_arrayElimCell_132) 1))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse30 (select |c_#valid| v_arrayElimCell_132))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 .cse30) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse30) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse31 (select |c_#valid| v_arrayElimCell_132))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 .cse31) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse31) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse34 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse32 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 .cse34))) (let ((.cse33 (store (store .cse32 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse32 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select .cse33 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0) (= .cse34 (select .cse33 v_arrayElimCell_132))))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_133 Int)) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| 0))) (and (= (select .cse35 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse35 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse36 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= |c_#valid| (store (store .cse36 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store .cse36 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_133 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse37 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0))) (and (not (= v_arrayElimCell_133 0)) (= (select .cse37 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store .cse37 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (let ((.cse38 (store .cse4 v_arrayElimCell_130 0))) (and (= (select .cse38 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse38 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0)))) .cse39 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse40 (select |c_#valid| v_arrayElimCell_132))) (let ((.cse42 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse40))) (let ((.cse41 (store (store .cse42 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_130 0))) (and (= .cse40 (select .cse41 v_arrayElimCell_132)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store (store .cse42 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select .cse41 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse43 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0))) (and (not (= v_arrayElimCell_132 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= (select .cse43 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse43 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (and (or .cse18 .cse44 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse45 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0))) (and (= (select .cse45 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store .cse45 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) .cse26 .cse22 .cse19 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_130 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)))) .cse39 .cse20 .cse15) .cse14))) .cse51)))) .cse53) (and (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= |c_#valid| (store .cse17 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1))) (and (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (exists ((v_arrayElimCell_132 Int)) (let ((.cse54 (select |c_#valid| v_arrayElimCell_132))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 .cse54) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse54) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)))) (and (exists ((v_arrayElimCell_130 Int) (v_DerPreprocessor_5 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_DerPreprocessor_5) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) .cse14) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (exists ((v_arrayElimCell_130 Int)) (and (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (exists ((v_arrayElimCell_130 Int)) (and (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)))))) (and (exists ((v_arrayElimCell_130 Int) (v_DerPreprocessor_5 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_DerPreprocessor_5) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1))) .cse14) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse55 (select |c_#valid| v_arrayElimCell_132))) (and (= (select (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 .cse55) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 .cse55) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))))) (and (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_5 Int)) (let ((.cse56 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= |c_#valid| (store (store .cse56 v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= (select (store (store .cse56 |c_ULTIMATE.start_destroy_~l#1.base| v_DerPreprocessor_5) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) .cse14)) .cse53) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int)) (and (exists ((v_arrayElimCell_130 Int)) (and (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)))) (and (exists ((v_arrayElimCell_130 Int) (v_DerPreprocessor_3 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_DerPreprocessor_3) v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) .cse14)) .cse51) (and (let ((.cse69 (exists ((v_arrayElimCell_132 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0)))))) (let ((.cse57 (and .cse14 (exists ((v_arrayElimCell_133 Int)) (and (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_133 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))) (.cse58 (and (exists ((v_arrayElimCell_133 Int)) (and (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) .cse60)) (.cse61 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse59 (and .cse14 .cse69))) (or (and (exists ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_133 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) .cse14) .cse57 .cse58 .cse59 (and (exists ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) v_arrayElimCell_133 0) 0 0)) (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) .cse60) (and .cse61 (or .cse57 .cse58)) (and .cse51 (let ((.cse62 (and .cse60 (exists ((v_arrayElimCell_130 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))))) (.cse65 (and .cse60 (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse75 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= v_DerPreprocessor_22 (select (store (store .cse75 0 v_DerPreprocessor_22) v_arrayElimCell_130 0) 0)) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse75 v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))))) (.cse63 (and (exists ((v_arrayElimCell_130 Int)) (and (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))) .cse14)) (.cse68 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))) (.cse67 (exists ((v_arrayElimCell_130 Int)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) 0 0)))) (.cse70 (exists ((v_arrayElimCell_130 Int)) (and (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0))))) (or .cse62 (and .cse61 (or .cse62 .cse63)) (and .cse14 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (and .cse61 (or (exists ((v_arrayElimCell_133 Int) (v_DerPreprocessor_21 Int)) (let ((.cse64 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= (select (store (store .cse64 0 v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0) v_DerPreprocessor_21) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= |c_#valid| (store (store .cse64 |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) .cse65 (and .cse14 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_DerPreprocessor_21 Int)) (let ((.cse66 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= |c_#valid| (store (store (store .cse66 |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= v_DerPreprocessor_21 (select (store (store (store .cse66 0 v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))))) (exists ((v_arrayElimCell_133 Int)) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) .cse65 .cse63 (and (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_130)))) .cse14) (and .cse67 .cse14) (and .cse68 .cse14) (and .cse60 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_130 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))) (and .cse14 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= |c_#valid| (store (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (and (or .cse68 .cse67 .cse69 (and .cse61 (exists ((v_arrayElimCell_130 Int) (v_DerPreprocessor_21 Int)) (and (= v_DerPreprocessor_21 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) 0)) (= |c_#valid| (store (store .cse4 v_arrayElimCell_130 0) 0 0))))) .cse70) .cse14) (and .cse60 (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (let ((.cse71 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (= v_DerPreprocessor_22 (select (store (store .cse71 0 v_DerPreprocessor_22) v_arrayElimCell_130 0) 0)) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse71 v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))) .cse59 (and .cse60 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_DerPreprocessor_19 Int)) (let ((.cse72 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)))) (and (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store .cse72 v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (= v_DerPreprocessor_19 (select (store (store .cse72 0 v_DerPreprocessor_19) v_arrayElimCell_130 0) 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_130) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))) (and (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_132 Int)) (let ((.cse73 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)))) (and (not (= v_arrayElimCell_132 0)) (= (select (store (store .cse73 0 v_DerPreprocessor_22) v_arrayElimCell_130 0) 0) v_DerPreprocessor_22) (= |c_#valid| (store (store .cse73 v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_130))))) .cse60) (and .cse14 .cse70) (exists ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))) (and .cse60 (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (let ((.cse74 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)))) (and (not (= v_arrayElimCell_132 0)) (not (= v_arrayElimCell_133 v_arrayElimCell_132)) (not (= v_arrayElimCell_133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= v_arrayElimCell_132 v_arrayElimCell_130)) (= v_DerPreprocessor_22 (select (store (store .cse74 0 v_DerPreprocessor_22) v_arrayElimCell_130 0) 0)) (= |c_#valid| (store (store .cse74 v_arrayElimCell_130 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0))))) (and .cse14 (exists ((v_arrayElimCell_130 Int) (v_arrayElimCell_133 Int)) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133 (select |c_#valid| v_arrayElimCell_133)) |c_ULTIMATE.start_destroy_~l#1.base| .cse2) v_arrayElimCell_130 0) 0 0)) (not (= v_arrayElimCell_133 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_130)) (not (= v_arrayElimCell_133 v_arrayElimCell_130)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_133)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_133) 0)))) (exists ((v_arrayElimCell_132 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_132)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 (select |c_#valid| v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base| 0) 0 0))))))) (and (= |c_#valid| (store .cse17 0 0)) .cse14)))) .cse53)))) (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0)) is different from false