./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../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-803cd42-m [2024-11-22 18:52:30,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:52:30,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-22 18:52:30,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:52:30,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:52:30,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:52:30,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:52:30,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:52:30,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:52:30,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:52:30,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:52:30,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:52:30,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:52:30,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:52:30,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:52:30,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:52:30,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:52:30,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:52:30,411 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:52:30,411 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:52:30,411 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:52:30,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:52:30,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:52:30,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:52:30,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:52:30,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:52:30,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:52:30,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:52:30,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:52:30,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:52:30,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:52:30,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:52:30,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:52:30,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:52:30,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:52:30,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:52:30,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:52:30,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:52:30,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:52:30,418 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-22 18:52:30,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:52:30,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:52:30,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:52:30,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:52:30,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:52:30,699 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-22 18:52:32,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:52:32,411 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:52:32,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-22 18:52:32,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf9824628/97dd5940c3c749378bb36f593d09b4c7/FLAGc043e65ae [2024-11-22 18:52:32,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf9824628/97dd5940c3c749378bb36f593d09b4c7 [2024-11-22 18:52:32,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:52:32,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:52:32,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:52:32,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:52:32,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:52:32,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:32,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c115b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32, skipping insertion in model container [2024-11-22 18:52:32,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:32,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:52:32,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:52:32,865 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:52:32,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:52:32,939 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:52:32,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32 WrapperNode [2024-11-22 18:52:32,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:52:32,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:52:32,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:52:32,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:52:32,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:32,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:32,989 INFO L138 Inliner]: procedures = 121, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 95 [2024-11-22 18:52:32,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:52:32,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:52:32,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:52:32,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:52:33,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,030 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-22 18:52:33,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:52:33,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:52:33,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:52:33,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:52:33,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ... [2024-11-22 18:52:33,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:52:33,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:33,086 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-22 18:52:33,088 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-22 18:52:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:52:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-22 18:52:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-22 18:52:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:52:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:52:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:52:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:52:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:52:33,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:52:33,232 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:52:33,235 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:52:33,572 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-22 18:52:33,573 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:52:33,587 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:52:33,587 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 18:52:33,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:52:33 BoogieIcfgContainer [2024-11-22 18:52:33,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:52:33,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:52:33,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:52:33,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:52:33,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:52:32" (1/3) ... [2024-11-22 18:52:33,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a7d27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:52:33, skipping insertion in model container [2024-11-22 18:52:33,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (2/3) ... [2024-11-22 18:52:33,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a7d27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:52:33, skipping insertion in model container [2024-11-22 18:52:33,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:52:33" (3/3) ... [2024-11-22 18:52:33,599 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-shared.i [2024-11-22 18:52:33,614 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:52:33,614 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-22 18:52:33,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:52:33,675 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;@a1f0a92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:52:33,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-22 18:52:33,681 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-22 18:52:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:52:33,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:33,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:52:33,690 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-22 18:52:33,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash 34543147, now seen corresponding path program 1 times [2024-11-22 18:52:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149725284] [2024-11-22 18:52:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:33,923 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-22 18:52:33,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:33,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149725284] [2024-11-22 18:52:33,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149725284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:33,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583981710] [2024-11-22 18:52:33,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:33,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:33,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:33,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:33,965 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-22 18:52:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:34,104 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-22 18:52:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:34,107 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-22 18:52:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:34,114 INFO L225 Difference]: With dead ends: 100 [2024-11-22 18:52:34,115 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 18:52:34,117 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-22 18:52:34,121 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-22 18:52:34,122 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-22 18:52:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 18:52:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-22 18:52:34,161 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-22 18:52:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2024-11-22 18:52:34,165 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 5 [2024-11-22 18:52:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:34,165 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2024-11-22 18:52:34,165 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-22 18:52:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2024-11-22 18:52:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:52:34,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:34,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:52:34,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:52:34,167 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-22 18:52:34,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 34543148, now seen corresponding path program 1 times [2024-11-22 18:52:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:34,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016068640] [2024-11-22 18:52:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:34,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:34,297 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-22 18:52:34,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:34,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016068640] [2024-11-22 18:52:34,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016068640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:34,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:34,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:34,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732043537] [2024-11-22 18:52:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:34,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:34,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:34,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:34,302 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-22 18:52:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:34,382 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-22 18:52:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:34,383 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-22 18:52:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:34,384 INFO L225 Difference]: With dead ends: 97 [2024-11-22 18:52:34,384 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 18:52:34,385 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-22 18:52:34,386 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-22 18:52:34,387 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-22 18:52:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 18:52:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-22 18:52:34,399 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-22 18:52:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-22 18:52:34,403 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 5 [2024-11-22 18:52:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:34,404 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-22 18:52:34,404 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-22 18:52:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-22 18:52:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:52:34,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:34,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:34,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:52:34,405 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-22 18:52:34,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1042879868, now seen corresponding path program 1 times [2024-11-22 18:52:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391180146] [2024-11-22 18:52:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:34,518 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-22 18:52:34,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:34,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391180146] [2024-11-22 18:52:34,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391180146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:34,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:34,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53755386] [2024-11-22 18:52:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:34,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:34,524 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-22 18:52:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:34,617 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2024-11-22 18:52:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:34,617 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-22 18:52:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:34,619 INFO L225 Difference]: With dead ends: 101 [2024-11-22 18:52:34,622 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 18:52:34,622 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-22 18:52:34,623 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-22 18:52:34,625 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-22 18:52:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 18:52:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-11-22 18:52:34,633 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-22 18:52:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-22 18:52:34,634 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 10 [2024-11-22 18:52:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:34,635 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-22 18:52:34,635 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-22 18:52:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-22 18:52:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:52:34,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:34,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:34,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:52:34,636 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-22 18:52:34,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1042879867, now seen corresponding path program 1 times [2024-11-22 18:52:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592641296] [2024-11-22 18:52:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:34,736 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-22 18:52:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592641296] [2024-11-22 18:52:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592641296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:34,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301848758] [2024-11-22 18:52:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:34,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:34,739 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-22 18:52:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:34,799 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-22 18:52:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:34,800 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-22 18:52:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:34,800 INFO L225 Difference]: With dead ends: 100 [2024-11-22 18:52:34,801 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 18:52:34,801 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-22 18:52:34,804 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-22 18:52:34,804 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-22 18:52:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 18:52:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-11-22 18:52:34,811 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-22 18:52:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-22 18:52:34,812 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 10 [2024-11-22 18:52:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:34,813 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-22 18:52:34,813 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-22 18:52:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-22 18:52:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:52:34,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:34,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:34,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:52:34,814 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-22 18:52:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1480173691, now seen corresponding path program 1 times [2024-11-22 18:52:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441239262] [2024-11-22 18:52:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:34,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:34,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441239262] [2024-11-22 18:52:34,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441239262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:34,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:34,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603787542] [2024-11-22 18:52:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:34,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:34,865 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-22 18:52:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:34,929 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-22 18:52:34,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:34,930 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-22 18:52:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:34,931 INFO L225 Difference]: With dead ends: 99 [2024-11-22 18:52:34,931 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 18:52:34,931 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-22 18:52:34,934 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-22 18:52:34,935 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-22 18:52:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 18:52:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2024-11-22 18:52:34,942 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-22 18:52:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-22 18:52:34,943 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 12 [2024-11-22 18:52:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-22 18:52:34,944 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-22 18:52:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-22 18:52:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:52:34,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:34,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:34,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:52:34,945 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-22 18:52:34,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1480173690, now seen corresponding path program 1 times [2024-11-22 18:52:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:34,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195077050] [2024-11-22 18:52:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:35,058 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-22 18:52:35,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195077050] [2024-11-22 18:52:35,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195077050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:35,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:35,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069989060] [2024-11-22 18:52:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:35,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:35,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:35,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:35,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:35,060 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-22 18:52:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:35,118 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-22 18:52:35,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:35,118 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-22 18:52:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:35,119 INFO L225 Difference]: With dead ends: 98 [2024-11-22 18:52:35,119 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 18:52:35,120 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-22 18:52:35,120 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-22 18:52:35,121 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-22 18:52:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 18:52:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-22 18:52:35,128 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-22 18:52:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-22 18:52:35,130 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 12 [2024-11-22 18:52:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:35,131 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-22 18:52:35,131 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-22 18:52:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-22 18:52:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:52:35,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:35,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:35,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:52:35,132 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-22 18:52:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash -812742458, now seen corresponding path program 1 times [2024-11-22 18:52:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827220331] [2024-11-22 18:52:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:35,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-22 18:52:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827220331] [2024-11-22 18:52:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827220331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:35,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:35,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:52:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083248068] [2024-11-22 18:52:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:35,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:52:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:52:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:52:35,371 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-22 18:52:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:35,546 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-11-22 18:52:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:52:35,546 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-22 18:52:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:35,547 INFO L225 Difference]: With dead ends: 93 [2024-11-22 18:52:35,547 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 18:52:35,548 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-22 18:52:35,550 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-22 18:52:35,550 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-22 18:52:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 18:52:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-11-22 18:52:35,557 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-22 18:52:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-22 18:52:35,558 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 14 [2024-11-22 18:52:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:35,558 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-22 18:52:35,558 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-22 18:52:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-22 18:52:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:52:35,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:35,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:35,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:52:35,559 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-22 18:52:35,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash -812742457, now seen corresponding path program 1 times [2024-11-22 18:52:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105462948] [2024-11-22 18:52:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:35,841 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-22 18:52:35,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:35,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105462948] [2024-11-22 18:52:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105462948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:35,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:35,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:52:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584586316] [2024-11-22 18:52:35,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:35,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:52:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:35,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:52:35,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:52:35,843 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-22 18:52:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:36,048 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-22 18:52:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:52:36,049 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-22 18:52:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:36,050 INFO L225 Difference]: With dead ends: 91 [2024-11-22 18:52:36,050 INFO L226 Difference]: Without dead ends: 91 [2024-11-22 18:52:36,050 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-22 18:52:36,051 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 18:52:36,052 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-22 18:52:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-22 18:52:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2024-11-22 18:52:36,057 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-22 18:52:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-22 18:52:36,058 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2024-11-22 18:52:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:36,058 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-22 18:52:36,058 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-22 18:52:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-22 18:52:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:52:36,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:36,059 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-22 18:52:36,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:52:36,060 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-22 18:52:36,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:36,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2081078920, now seen corresponding path program 1 times [2024-11-22 18:52:36,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:36,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642239985] [2024-11-22 18:52:36,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:36,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:36,186 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-22 18:52:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:36,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642239985] [2024-11-22 18:52:36,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642239985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:36,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:36,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:52:36,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761975672] [2024-11-22 18:52:36,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:36,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:52:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:52:36,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:52:36,191 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-22 18:52:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:36,352 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-22 18:52:36,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:52:36,356 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-22 18:52:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:36,356 INFO L225 Difference]: With dead ends: 112 [2024-11-22 18:52:36,356 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 18:52:36,357 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-22 18:52:36,357 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.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:36,357 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.2s Time] [2024-11-22 18:52:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 18:52:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2024-11-22 18:52:36,365 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-22 18:52:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2024-11-22 18:52:36,370 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 21 [2024-11-22 18:52:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2024-11-22 18:52:36,371 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-22 18:52:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2024-11-22 18:52:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:52:36,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:36,372 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-22 18:52:36,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:52:36,372 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-22 18:52:36,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:36,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2081078919, now seen corresponding path program 1 times [2024-11-22 18:52:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519387225] [2024-11-22 18:52:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:36,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:36,633 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-22 18:52:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519387225] [2024-11-22 18:52:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519387225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:52:36,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137177686] [2024-11-22 18:52:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:36,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:52:36,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:36,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:52:36,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:52:36,637 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-22 18:52:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:36,811 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2024-11-22 18:52:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:52:36,812 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-22 18:52:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:36,825 INFO L225 Difference]: With dead ends: 115 [2024-11-22 18:52:36,826 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 18:52:36,826 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-22 18:52:36,827 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-22 18:52:36,828 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-22 18:52:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 18:52:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2024-11-22 18:52:36,832 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-22 18:52:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2024-11-22 18:52:36,833 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 21 [2024-11-22 18:52:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:36,834 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2024-11-22 18:52:36,834 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-22 18:52:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2024-11-22 18:52:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:52:36,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:36,835 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-22 18:52:36,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:52:36,835 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-22 18:52:36,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1537875595, now seen corresponding path program 1 times [2024-11-22 18:52:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:36,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184344252] [2024-11-22 18:52:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:36,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:36,947 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-22 18:52:36,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:36,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184344252] [2024-11-22 18:52:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184344252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:36,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:52:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919073897] [2024-11-22 18:52:36,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:36,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:52:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:36,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:52:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:52:36,950 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-22 18:52:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:37,015 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2024-11-22 18:52:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:52:37,016 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-22 18:52:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:37,017 INFO L225 Difference]: With dead ends: 117 [2024-11-22 18:52:37,017 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 18:52:37,017 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-22 18:52:37,018 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-22 18:52:37,018 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-22 18:52:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 18:52:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-11-22 18:52:37,021 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-22 18:52:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2024-11-22 18:52:37,022 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 23 [2024-11-22 18:52:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:37,022 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2024-11-22 18:52:37,022 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-22 18:52:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2024-11-22 18:52:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:52:37,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:37,023 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-22 18:52:37,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:52:37,023 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-22 18:52:37,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash 918504240, now seen corresponding path program 1 times [2024-11-22 18:52:37,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:37,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905295272] [2024-11-22 18:52:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:37,201 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-22 18:52:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:37,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905295272] [2024-11-22 18:52:37,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905295272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:37,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:37,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:52:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390256998] [2024-11-22 18:52:37,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:37,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:52:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:37,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:52:37,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:52:37,204 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-22 18:52:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:37,361 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-11-22 18:52:37,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:52:37,362 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-22 18:52:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:37,363 INFO L225 Difference]: With dead ends: 112 [2024-11-22 18:52:37,364 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 18:52:37,364 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-22 18:52:37,365 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:37,365 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.1s Time] [2024-11-22 18:52:37,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 18:52:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-22 18:52:37,370 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-22 18:52:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2024-11-22 18:52:37,371 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 24 [2024-11-22 18:52:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:37,372 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2024-11-22 18:52:37,372 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-22 18:52:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2024-11-22 18:52:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:52:37,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:37,373 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-22 18:52:37,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:52:37,374 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-22 18:52:37,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash 918504241, now seen corresponding path program 1 times [2024-11-22 18:52:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547206338] [2024-11-22 18:52:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:37,652 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-22 18:52:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:37,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547206338] [2024-11-22 18:52:37,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547206338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198529677] [2024-11-22 18:52:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:37,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:37,656 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-22 18:52:37,657 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-22 18:52:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:37,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:52:37,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:37,927 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-22 18:52:37,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:52:37,999 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-22 18:52:38,012 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:52:38,013 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-22 18:52:38,032 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-22 18:52:38,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:52:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198529677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:38,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:52:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-22 18:52:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792136909] [2024-11-22 18:52:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:38,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:52:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:52:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-22 18:52:38,036 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-22 18:52:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:38,161 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2024-11-22 18:52:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:52:38,162 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-22 18:52:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:38,163 INFO L225 Difference]: With dead ends: 116 [2024-11-22 18:52:38,163 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 18:52:38,163 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-22 18:52:38,164 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-22 18:52:38,164 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-22 18:52:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 18:52:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-22 18:52:38,167 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-22 18:52:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-22 18:52:38,168 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 24 [2024-11-22 18:52:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:38,168 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-22 18:52:38,168 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-22 18:52:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-22 18:52:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:52:38,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:38,170 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-22 18:52:38,182 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-22 18:52:38,372 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-22 18:52:38,372 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-22 18:52:38,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash -76820004, now seen corresponding path program 1 times [2024-11-22 18:52:38,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:38,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423392135] [2024-11-22 18:52:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:38,505 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-22 18:52:38,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423392135] [2024-11-22 18:52:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423392135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:38,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:52:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654855415] [2024-11-22 18:52:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:38,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:52:38,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:38,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:52:38,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:52:38,507 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-22 18:52:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:38,661 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-22 18:52:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:52:38,661 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-22 18:52:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:38,662 INFO L225 Difference]: With dead ends: 111 [2024-11-22 18:52:38,662 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 18:52:38,662 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-22 18:52:38,663 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-22 18:52:38,663 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-22 18:52:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 18:52:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-22 18:52:38,666 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-22 18:52:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2024-11-22 18:52:38,667 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 27 [2024-11-22 18:52:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:38,669 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2024-11-22 18:52:38,669 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-22 18:52:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2024-11-22 18:52:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:52:38,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:38,671 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-22 18:52:38,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:52:38,671 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-22 18:52:38,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash -76820003, now seen corresponding path program 1 times [2024-11-22 18:52:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:38,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458304597] [2024-11-22 18:52:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:38,945 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-22 18:52:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458304597] [2024-11-22 18:52:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458304597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:38,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:38,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:52:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957419474] [2024-11-22 18:52:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:38,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:52:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:52:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:52:38,948 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-22 18:52:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:39,104 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-11-22 18:52:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:52:39,105 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-22 18:52:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:39,106 INFO L225 Difference]: With dead ends: 110 [2024-11-22 18:52:39,106 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 18:52:39,106 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-22 18:52:39,106 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-22 18:52:39,107 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-22 18:52:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 18:52:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-22 18:52:39,110 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-22 18:52:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-11-22 18:52:39,112 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 27 [2024-11-22 18:52:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:39,113 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-11-22 18:52:39,113 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-22 18:52:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-11-22 18:52:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:52:39,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:39,114 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-22 18:52:39,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:52:39,114 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-22 18:52:39,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1002444452, now seen corresponding path program 1 times [2024-11-22 18:52:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122488373] [2024-11-22 18:52:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:39,996 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-22 18:52:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122488373] [2024-11-22 18:52:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122488373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603972604] [2024-11-22 18:52:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:39,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:40,000 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-22 18:52:40,001 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-22 18:52:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:40,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-22 18:52:40,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:40,118 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-22 18:52:40,147 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-22 18:52:40,153 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-22 18:52:40,294 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 18:52:40,294 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-22 18:52:40,355 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-22 18:52:40,365 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-22 18:52:40,400 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-22 18:52:40,401 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-22 18:52:40,495 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-22 18:52:40,503 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-22 18:52:40,585 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-22 18:52:40,594 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-22 18:52:40,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:52:40,650 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-22 18:52:40,658 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-22 18:52:40,844 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-22 18:52:40,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:41,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_528 (Array Int Int)) (v_ArrVal_535 Int)) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_528))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |c_ULTIMATE.start_create_~data1~0#1.base|) .cse1 v_ArrVal_535))) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (forall ((v_ArrVal_531 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_534 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_529))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_531) .cse1 v_ArrVal_534))) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 0)))) is different from false [2024-11-22 18:52:42,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:52:42,086 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-22 18:52:42,092 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-22 18:52:42,103 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-22 18:52:42,108 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-22 18:52:42,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:52:42,154 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-22 18:52:42,159 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-22 18:52:42,166 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-22 18:52:42,172 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-22 18:52:42,287 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-22 18:52:42,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603972604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:52:42,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:52:42,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 38 [2024-11-22 18:52:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367431357] [2024-11-22 18:52:42,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:52:42,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-22 18:52:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-22 18:52:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1205, Unknown=3, NotChecked=70, Total=1406 [2024-11-22 18:52:42,290 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-22 18:52:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:43,296 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-11-22 18:52:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:52:43,297 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-22 18:52:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:43,297 INFO L225 Difference]: With dead ends: 112 [2024-11-22 18:52:43,297 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 18:52:43,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=1615, Unknown=3, NotChecked=82, Total=1892 [2024-11-22 18:52:43,299 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:43,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1219 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 748 Invalid, 0 Unknown, 47 Unchecked, 0.7s Time] [2024-11-22 18:52:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 18:52:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-22 18:52:43,301 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-22 18:52:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-11-22 18:52:43,302 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 28 [2024-11-22 18:52:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:43,302 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-11-22 18:52:43,302 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-22 18:52:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-11-22 18:52:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:52:43,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:43,303 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-22 18:52:43,312 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-22 18:52:43,504 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-22 18:52:43,504 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-22 18:52:43,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 672845527, now seen corresponding path program 1 times [2024-11-22 18:52:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941956881] [2024-11-22 18:52:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:43,779 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-22 18:52:43,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:43,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941956881] [2024-11-22 18:52:43,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941956881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:43,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:43,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:52:43,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029442013] [2024-11-22 18:52:43,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:43,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:52:43,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:52:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:52:43,782 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-22 18:52:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:43,998 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2024-11-22 18:52:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:52:43,999 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-22 18:52:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:44,000 INFO L225 Difference]: With dead ends: 113 [2024-11-22 18:52:44,000 INFO L226 Difference]: Without dead ends: 113 [2024-11-22 18:52:44,000 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-22 18:52:44,001 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:44,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 542 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:52:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-22 18:52:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-22 18:52:44,004 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-22 18:52:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-22 18:52:44,005 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 30 [2024-11-22 18:52:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:44,006 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-22 18:52:44,006 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-22 18:52:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-22 18:52:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:52:44,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:44,006 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-22 18:52:44,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 18:52:44,007 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-22 18:52:44,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash 672845528, now seen corresponding path program 1 times [2024-11-22 18:52:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:44,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95276737] [2024-11-22 18:52:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:44,385 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-22 18:52:44,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95276737] [2024-11-22 18:52:44,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95276737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:44,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:52:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803765748] [2024-11-22 18:52:44,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:52:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:44,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:52:44,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:52:44,388 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-22 18:52:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:44,622 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-22 18:52:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:52:44,623 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-22 18:52:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:44,623 INFO L225 Difference]: With dead ends: 112 [2024-11-22 18:52:44,623 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 18:52:44,624 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-22 18:52:44,624 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:44,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 392 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:52:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 18:52:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-22 18:52:44,627 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-22 18:52:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-22 18:52:44,628 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 30 [2024-11-22 18:52:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:44,628 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-22 18:52:44,628 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-22 18:52:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-22 18:52:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:52:44,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:44,630 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-22 18:52:44,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 18:52:44,630 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-22 18:52:44,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:44,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1276486289, now seen corresponding path program 1 times [2024-11-22 18:52:44,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:44,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113574821] [2024-11-22 18:52:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:44,719 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-22 18:52:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113574821] [2024-11-22 18:52:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113574821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:44,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:44,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:52:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53313630] [2024-11-22 18:52:44,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:44,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:52:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:44,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:52:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:52:44,721 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-22 18:52:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:44,925 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2024-11-22 18:52:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:52:44,926 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-22 18:52:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:44,927 INFO L225 Difference]: With dead ends: 128 [2024-11-22 18:52:44,927 INFO L226 Difference]: Without dead ends: 128 [2024-11-22 18:52:44,927 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-22 18:52:44,927 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:44,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 274 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:52:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-22 18:52:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-11-22 18:52:44,932 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-22 18:52:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2024-11-22 18:52:44,933 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 30 [2024-11-22 18:52:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:44,933 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2024-11-22 18:52:44,934 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-22 18:52:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2024-11-22 18:52:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:52:44,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:44,935 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-22 18:52:44,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 18:52:44,935 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-22 18:52:44,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1276486288, now seen corresponding path program 1 times [2024-11-22 18:52:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:44,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286740486] [2024-11-22 18:52:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:45,165 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-22 18:52:45,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286740486] [2024-11-22 18:52:45,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286740486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676354083] [2024-11-22 18:52:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:45,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:45,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:45,169 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-22 18:52:45,171 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-22 18:52:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:45,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 18:52:45,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:45,394 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-22 18:52:45,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:45,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:52:45,475 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-22 18:52:45,555 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-22 18:52:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676354083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:52:45,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:52:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2024-11-22 18:52:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71664686] [2024-11-22 18:52:45,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:52:45,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 18:52:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:45,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 18:52:45,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-22 18:52:45,558 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-22 18:52:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:45,943 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2024-11-22 18:52:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 18:52:45,943 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-22 18:52:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:45,945 INFO L225 Difference]: With dead ends: 157 [2024-11-22 18:52:45,945 INFO L226 Difference]: Without dead ends: 157 [2024-11-22 18:52:45,945 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-22 18:52:45,945 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 79 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:45,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 507 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:52:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-22 18:52:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-11-22 18:52:45,949 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-22 18:52:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2024-11-22 18:52:45,950 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 30 [2024-11-22 18:52:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:45,950 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2024-11-22 18:52:45,951 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-22 18:52:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2024-11-22 18:52:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 18:52:45,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:45,951 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-22 18:52:45,963 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-22 18:52:46,155 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-22 18:52:46,156 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-22 18:52:46,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:46,156 INFO L85 PathProgramCache]: Analyzing trace with hash -916369230, now seen corresponding path program 1 times [2024-11-22 18:52:46,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:46,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099988687] [2024-11-22 18:52:46,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:46,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:46,407 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-22 18:52:46,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:46,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099988687] [2024-11-22 18:52:46,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099988687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:46,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856074640] [2024-11-22 18:52:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:46,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:46,410 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-22 18:52:46,413 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-22 18:52:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:46,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 18:52:46,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:46,567 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-22 18:52:46,577 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-22 18:52:46,600 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-22 18:52:46,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:52:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856074640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:52:46,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2024-11-22 18:52:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118075332] [2024-11-22 18:52:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:46,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:52:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:52:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:52:46,602 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-22 18:52:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:46,780 INFO L93 Difference]: Finished difference Result 157 states and 185 transitions. [2024-11-22 18:52:46,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:52:46,780 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-22 18:52:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:46,781 INFO L225 Difference]: With dead ends: 157 [2024-11-22 18:52:46,781 INFO L226 Difference]: Without dead ends: 157 [2024-11-22 18:52:46,781 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-22 18:52:46,782 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-22 18:52:46,782 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-22 18:52:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-22 18:52:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-11-22 18:52:46,786 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-22 18:52:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2024-11-22 18:52:46,786 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 31 [2024-11-22 18:52:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:46,787 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2024-11-22 18:52:46,787 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-22 18:52:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2024-11-22 18:52:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 18:52:46,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:46,787 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-22 18:52:46,797 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-22 18:52:46,991 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-22 18:52:46,992 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-22 18:52:46,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1657947094, now seen corresponding path program 1 times [2024-11-22 18:52:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:46,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896385344] [2024-11-22 18:52:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:46,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:47,090 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-22 18:52:47,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:47,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896385344] [2024-11-22 18:52:47,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896385344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:47,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:47,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:52:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368423689] [2024-11-22 18:52:47,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:47,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:52:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:47,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:52:47,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:52:47,092 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-22 18:52:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:47,166 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2024-11-22 18:52:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:52:47,167 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-22 18:52:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:47,168 INFO L225 Difference]: With dead ends: 149 [2024-11-22 18:52:47,168 INFO L226 Difference]: Without dead ends: 149 [2024-11-22 18:52:47,169 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-22 18:52:47,169 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-22 18:52:47,169 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-22 18:52:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-22 18:52:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2024-11-22 18:52:47,172 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-22 18:52:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2024-11-22 18:52:47,173 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 32 [2024-11-22 18:52:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:47,174 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2024-11-22 18:52:47,174 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-22 18:52:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2024-11-22 18:52:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 18:52:47,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:47,175 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-22 18:52:47,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 18:52:47,175 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-22 18:52:47,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1657325071, now seen corresponding path program 1 times [2024-11-22 18:52:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186662948] [2024-11-22 18:52:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:47,465 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-22 18:52:47,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:47,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186662948] [2024-11-22 18:52:47,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186662948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:47,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424046469] [2024-11-22 18:52:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:47,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:47,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:47,468 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-22 18:52:47,469 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-22 18:52:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:47,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:52:47,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:47,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:52:47,669 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-22 18:52:47,697 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-22 18:52:47,700 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-22 18:52:47,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:52:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424046469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:47,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:52:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2024-11-22 18:52:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140135977] [2024-11-22 18:52:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:52:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:52:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:52:47,702 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-22 18:52:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:47,929 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-11-22 18:52:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:52:47,930 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-22 18:52:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:47,931 INFO L225 Difference]: With dead ends: 148 [2024-11-22 18:52:47,932 INFO L226 Difference]: Without dead ends: 148 [2024-11-22 18:52:47,932 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-22 18:52:47,932 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-22 18:52:47,933 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-22 18:52:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-22 18:52:47,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-11-22 18:52:47,935 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-22 18:52:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2024-11-22 18:52:47,936 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 32 [2024-11-22 18:52:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:47,936 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2024-11-22 18:52:47,936 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-22 18:52:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2024-11-22 18:52:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 18:52:47,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:47,937 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-22 18:52:47,946 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-22 18:52:48,137 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-22 18:52:48,138 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-22 18:52:48,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash -162530220, now seen corresponding path program 1 times [2024-11-22 18:52:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:48,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438081957] [2024-11-22 18:52:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:48,454 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-22 18:52:48,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438081957] [2024-11-22 18:52:48,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438081957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39080014] [2024-11-22 18:52:48,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:48,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:48,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:48,458 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-22 18:52:48,460 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-22 18:52:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:48,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-22 18:52:48,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:48,607 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-22 18:52:48,633 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:52:48,634 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-22 18:52:48,653 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-22 18:52:48,662 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-22 18:52:48,691 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-22 18:52:48,695 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-22 18:52:48,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:52:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39080014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:52:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 11 [2024-11-22 18:52:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232819729] [2024-11-22 18:52:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:48,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:52:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:48,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:52:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:52:48,698 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-22 18:52:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:48,885 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2024-11-22 18:52:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:52:48,885 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-22 18:52:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:48,886 INFO L225 Difference]: With dead ends: 144 [2024-11-22 18:52:48,886 INFO L226 Difference]: Without dead ends: 144 [2024-11-22 18:52:48,886 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-22 18:52:48,887 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:48,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 302 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:52:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-22 18:52:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-22 18:52:48,890 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-22 18:52:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 166 transitions. [2024-11-22 18:52:48,891 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 166 transitions. Word has length 33 [2024-11-22 18:52:48,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:48,891 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 166 transitions. [2024-11-22 18:52:48,891 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-22 18:52:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 166 transitions. [2024-11-22 18:52:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 18:52:48,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:48,892 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-22 18:52:48,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 18:52:49,092 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-22 18:52:49,093 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-22 18:52:49,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash -743469390, now seen corresponding path program 1 times [2024-11-22 18:52:49,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:49,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816622336] [2024-11-22 18:52:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:49,503 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-22 18:52:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816622336] [2024-11-22 18:52:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816622336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215925018] [2024-11-22 18:52:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:49,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:49,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:49,507 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-22 18:52:49,508 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-22 18:52:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:49,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 18:52:49,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:49,666 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-22 18:52:49,683 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:52:49,683 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-22 18:52:49,716 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-22 18:52:49,740 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-22 18:52:49,826 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-22 18:52:49,839 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-22 18:52:49,842 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-22 18:52:49,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:52:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215925018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:49,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:52:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2024-11-22 18:52:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036667797] [2024-11-22 18:52:49,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:49,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:52:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:52:49,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-22 18:52:49,845 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-22 18:52:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:50,098 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-11-22 18:52:50,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:52:50,098 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-22 18:52:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:50,099 INFO L225 Difference]: With dead ends: 147 [2024-11-22 18:52:50,099 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 18:52:50,100 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-22 18:52:50,100 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 52 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:50,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 471 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:52:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 18:52:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-22 18:52:50,108 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-22 18:52:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 165 transitions. [2024-11-22 18:52:50,109 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 165 transitions. Word has length 34 [2024-11-22 18:52:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:50,109 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 165 transitions. [2024-11-22 18:52:50,110 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-22 18:52:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2024-11-22 18:52:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 18:52:50,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:50,110 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-22 18:52:50,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 18:52:50,314 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-22 18:52:50,315 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-22 18:52:50,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1572714536, now seen corresponding path program 1 times [2024-11-22 18:52:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446209575] [2024-11-22 18:52:50,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:50,620 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-22 18:52:50,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:50,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446209575] [2024-11-22 18:52:50,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446209575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:50,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:52:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177714557] [2024-11-22 18:52:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:52:50,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:52:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:52:50,622 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-22 18:52:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:50,827 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2024-11-22 18:52:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:52:50,828 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-22 18:52:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:50,829 INFO L225 Difference]: With dead ends: 146 [2024-11-22 18:52:50,829 INFO L226 Difference]: Without dead ends: 146 [2024-11-22 18:52:50,829 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-22 18:52:50,829 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:50,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 578 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:52:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-22 18:52:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-22 18:52:50,834 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-22 18:52:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2024-11-22 18:52:50,835 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 35 [2024-11-22 18:52:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:50,835 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2024-11-22 18:52:50,836 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-22 18:52:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2024-11-22 18:52:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 18:52:50,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:50,836 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-22 18:52:50,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 18:52:50,837 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-22 18:52:50,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1509510222, now seen corresponding path program 1 times [2024-11-22 18:52:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953230398] [2024-11-22 18:52:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:50,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:51,160 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-22 18:52:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953230398] [2024-11-22 18:52:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953230398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:51,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:51,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:52:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237759983] [2024-11-22 18:52:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:51,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:52:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:51,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:52:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:52:51,163 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-22 18:52:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:51,386 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2024-11-22 18:52:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:52:51,387 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-22 18:52:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:51,387 INFO L225 Difference]: With dead ends: 145 [2024-11-22 18:52:51,387 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 18:52:51,388 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-22 18:52:51,388 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 34 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:51,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 464 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:52:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 18:52:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-22 18:52:51,391 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-22 18:52:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2024-11-22 18:52:51,392 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 36 [2024-11-22 18:52:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:51,392 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2024-11-22 18:52:51,392 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-22 18:52:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2024-11-22 18:52:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 18:52:51,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:51,393 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-22 18:52:51,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 18:52:51,393 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-22 18:52:51,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 449823514, now seen corresponding path program 1 times [2024-11-22 18:52:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631782054] [2024-11-22 18:52:51,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:51,953 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-22 18:52:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631782054] [2024-11-22 18:52:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631782054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696992497] [2024-11-22 18:52:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:51,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:51,955 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-22 18:52:51,956 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-22 18:52:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:52,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-22 18:52:52,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:52,170 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-22 18:52:52,224 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 18:52:52,225 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-22 18:52:52,298 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-22 18:52:52,335 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-22 18:52:52,618 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-22 18:52:52,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:52:52,628 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-22 18:52:52,633 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-22 18:52:52,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:52,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:52:52,986 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-22 18:52:56,669 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-22 18:52:56,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696992497] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:56,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:52:56,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17, 15] total 39 [2024-11-22 18:52:56,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479563837] [2024-11-22 18:52:56,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:56,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:52:56,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:56,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:52:56,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1432, Unknown=0, NotChecked=0, Total=1560 [2024-11-22 18:52:56,671 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-22 18:52:59,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 18:53:06,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:06,346 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2024-11-22 18:53:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:53:06,347 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-22 18:53:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:06,348 INFO L225 Difference]: With dead ends: 144 [2024-11-22 18:53:06,348 INFO L226 Difference]: Without dead ends: 144 [2024-11-22 18:53:06,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2024-11-22 18:53:06,349 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:06,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 465 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-22 18:53:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-22 18:53:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-22 18:53:06,353 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-22 18:53:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2024-11-22 18:53:06,354 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 37 [2024-11-22 18:53:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:06,354 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2024-11-22 18:53:06,355 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-22 18:53:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2024-11-22 18:53:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 18:53:06,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:06,355 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-22 18:53:06,366 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-22 18:53:06,556 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-22 18:53:06,556 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-22 18:53:06,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash 970674154, now seen corresponding path program 1 times [2024-11-22 18:53:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:06,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017590473] [2024-11-22 18:53:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:06,800 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-22 18:53:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:06,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017590473] [2024-11-22 18:53:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017590473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:06,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950572638] [2024-11-22 18:53:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:06,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:06,803 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-22 18:53:06,805 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-22 18:53:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:06,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-22 18:53:06,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:07,072 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-22 18:53:07,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:07,089 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-22 18:53:07,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:53:07,094 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-22 18:53:07,183 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-22 18:53:07,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:07,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950572638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:07,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:07,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2024-11-22 18:53:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926358902] [2024-11-22 18:53:07,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:07,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 18:53:07,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:07,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 18:53:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=490, Unknown=1, NotChecked=44, Total=600 [2024-11-22 18:53:07,345 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-22 18:53:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:07,786 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2024-11-22 18:53:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:53:07,786 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-22 18:53:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:07,787 INFO L225 Difference]: With dead ends: 173 [2024-11-22 18:53:07,787 INFO L226 Difference]: Without dead ends: 173 [2024-11-22 18:53:07,787 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-22 18:53:07,788 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:07,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 695 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 530 Invalid, 0 Unknown, 131 Unchecked, 0.3s Time] [2024-11-22 18:53:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-22 18:53:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2024-11-22 18:53:07,791 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-22 18:53:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2024-11-22 18:53:07,792 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 39 [2024-11-22 18:53:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2024-11-22 18:53:07,792 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-22 18:53:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2024-11-22 18:53:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 18:53:07,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:07,793 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-22 18:53:07,802 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-22 18:53:07,993 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-22 18:53:07,994 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-22 18:53:07,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1511295107, now seen corresponding path program 1 times [2024-11-22 18:53:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:07,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693488748] [2024-11-22 18:53:07,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:08,432 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-22 18:53:08,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693488748] [2024-11-22 18:53:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693488748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:53:08,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:53:08,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 18:53:08,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732669415] [2024-11-22 18:53:08,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:53:08,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:53:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:08,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:53:08,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:53:08,435 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-22 18:53:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:08,754 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2024-11-22 18:53:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:53:08,755 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-22 18:53:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:08,755 INFO L225 Difference]: With dead ends: 162 [2024-11-22 18:53:08,756 INFO L226 Difference]: Without dead ends: 162 [2024-11-22 18:53:08,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:53:08,757 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:08,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 495 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:53:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-22 18:53:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-22 18:53:08,761 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-22 18:53:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2024-11-22 18:53:08,761 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 39 [2024-11-22 18:53:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:08,762 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2024-11-22 18:53:08,762 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-22 18:53:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2024-11-22 18:53:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:53:08,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:08,762 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-22 18:53:08,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-22 18:53:08,763 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-22 18:53:08,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash -173419745, now seen corresponding path program 1 times [2024-11-22 18:53:08,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:08,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066963116] [2024-11-22 18:53:08,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:09,215 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-22 18:53:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066963116] [2024-11-22 18:53:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066963116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509730028] [2024-11-22 18:53:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:09,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:09,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:09,218 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-22 18:53:09,220 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-22 18:53:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:09,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 18:53:09,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:09,396 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:53:09,397 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-22 18:53:09,414 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-22 18:53:09,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:53:09,460 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-22 18:53:09,500 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:53:09,500 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-22 18:53:09,511 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-22 18:53:09,526 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-22 18:53:09,556 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:53:09,557 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-22 18:53:09,560 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-22 18:53:09,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509730028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:09,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:09,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 21 [2024-11-22 18:53:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108488664] [2024-11-22 18:53:09,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:09,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 18:53:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 18:53:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2024-11-22 18:53:09,614 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-22 18:53:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:10,075 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2024-11-22 18:53:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:53:10,075 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-22 18:53:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:10,076 INFO L225 Difference]: With dead ends: 160 [2024-11-22 18:53:10,076 INFO L226 Difference]: Without dead ends: 160 [2024-11-22 18:53:10,077 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-22 18:53:10,077 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 12 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:10,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 805 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 651 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time] [2024-11-22 18:53:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-22 18:53:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-22 18:53:10,080 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-22 18:53:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2024-11-22 18:53:10,081 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 42 [2024-11-22 18:53:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:10,081 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2024-11-22 18:53:10,081 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-22 18:53:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2024-11-22 18:53:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:53:10,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:10,082 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-22 18:53:10,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-22 18:53:10,282 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-22 18:53:10,283 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-22 18:53:10,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -173419744, now seen corresponding path program 1 times [2024-11-22 18:53:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283848495] [2024-11-22 18:53:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:10,964 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-22 18:53:10,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283848495] [2024-11-22 18:53:10,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283848495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118367206] [2024-11-22 18:53:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:10,968 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-22 18:53:10,970 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-22 18:53:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:11,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-22 18:53:11,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:11,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:53:11,204 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:53:11,205 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-22 18:53:11,229 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-22 18:53:11,233 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-22 18:53:11,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:53:11,300 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-22 18:53:11,305 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-22 18:53:11,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:53:11,408 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-22 18:53:11,415 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-22 18:53:11,436 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-22 18:53:11,443 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-22 18:53:11,520 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-22 18:53:11,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:11,540 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-22 18:53:11,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:53:11,547 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-22 18:53:11,573 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-22 18:53:11,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118367206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:11,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2024-11-22 18:53:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91153879] [2024-11-22 18:53:11,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:11,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-22 18:53:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-22 18:53:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=781, Unknown=1, NotChecked=56, Total=930 [2024-11-22 18:53:11,659 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-22 18:53:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:12,388 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2024-11-22 18:53:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 18:53:12,389 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-22 18:53:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:12,390 INFO L225 Difference]: With dead ends: 156 [2024-11-22 18:53:12,390 INFO L226 Difference]: Without dead ends: 156 [2024-11-22 18:53:12,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1433, Unknown=1, NotChecked=78, Total=1722 [2024-11-22 18:53:12,391 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 27 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:12,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 857 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 695 Invalid, 0 Unknown, 88 Unchecked, 0.4s Time] [2024-11-22 18:53:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-22 18:53:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-22 18:53:12,396 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-22 18:53:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2024-11-22 18:53:12,397 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 42 [2024-11-22 18:53:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2024-11-22 18:53:12,398 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-22 18:53:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2024-11-22 18:53:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:53:12,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:12,398 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-22 18:53:12,408 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-22 18:53:12,599 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-22 18:53:12,599 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-22 18:53:12,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1149725730, now seen corresponding path program 1 times [2024-11-22 18:53:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:12,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831313563] [2024-11-22 18:53:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:12,732 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-22 18:53:12,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831313563] [2024-11-22 18:53:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831313563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:53:12,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:53:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:53:12,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663452731] [2024-11-22 18:53:12,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:53:12,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:53:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:12,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:53:12,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:53:12,734 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-22 18:53:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:12,889 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2024-11-22 18:53:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:53:12,889 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-22 18:53:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:12,890 INFO L225 Difference]: With dead ends: 160 [2024-11-22 18:53:12,890 INFO L226 Difference]: Without dead ends: 160 [2024-11-22 18:53:12,891 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-22 18:53:12,891 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-22 18:53:12,891 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-22 18:53:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-22 18:53:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2024-11-22 18:53:12,895 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-22 18:53:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2024-11-22 18:53:12,896 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 42 [2024-11-22 18:53:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2024-11-22 18:53:12,896 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-22 18:53:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2024-11-22 18:53:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 18:53:12,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:12,897 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-22 18:53:12,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-22 18:53:12,897 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-22 18:53:12,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash -884803614, now seen corresponding path program 1 times [2024-11-22 18:53:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276871484] [2024-11-22 18:53:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:12,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:13,813 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-22 18:53:13,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276871484] [2024-11-22 18:53:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276871484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138994226] [2024-11-22 18:53:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:13,817 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-22 18:53:13,818 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-22 18:53:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:14,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-22 18:53:14,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:14,010 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-22 18:53:14,036 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-22 18:53:14,043 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-22 18:53:14,091 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:53:14,091 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-22 18:53:14,145 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-22 18:53:14,153 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-22 18:53:14,186 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:53:14,186 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-22 18:53:14,244 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-22 18:53:14,249 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-22 18:53:14,280 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-22 18:53:14,286 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-22 18:53:14,319 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-22 18:53:14,325 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-22 18:53:14,437 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-22 18:53:14,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:14,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:14,606 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-22 18:53:14,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:14,615 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-22 18:53:14,690 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-22 18:53:14,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:16,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:16,051 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-22 18:53:16,056 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-22 18:53:16,064 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-22 18:53:16,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:16,078 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-22 18:53:16,090 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-22 18:53:16,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:16,307 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-22 18:53:16,312 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-22 18:53:16,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:16,324 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-22 18:53:16,337 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-22 18:53:16,345 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-22 18:53:16,818 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-22 18:53:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138994226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:53:16,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:53:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 47 [2024-11-22 18:53:16,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227611489] [2024-11-22 18:53:16,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:16,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-22 18:53:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:16,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-22 18:53:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2001, Unknown=4, NotChecked=0, Total=2162 [2024-11-22 18:53:16,820 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-22 18:53:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:17,997 INFO L93 Difference]: Finished difference Result 162 states and 182 transitions. [2024-11-22 18:53:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 18:53:17,998 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-22 18:53:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:17,998 INFO L225 Difference]: With dead ends: 162 [2024-11-22 18:53:17,998 INFO L226 Difference]: Without dead ends: 162 [2024-11-22 18:53:17,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=260, Invalid=2928, Unknown=4, NotChecked=0, Total=3192 [2024-11-22 18:53:17,999 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 44 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:18,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1110 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 18:53:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-22 18:53:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-22 18:53:18,002 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-22 18:53:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 182 transitions. [2024-11-22 18:53:18,003 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 182 transitions. Word has length 45 [2024-11-22 18:53:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:18,003 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 182 transitions. [2024-11-22 18:53:18,004 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-22 18:53:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 182 transitions. [2024-11-22 18:53:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:53:18,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:18,004 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-22 18:53:18,014 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-22 18:53:18,208 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-22 18:53:18,209 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-22 18:53:18,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash -361567797, now seen corresponding path program 1 times [2024-11-22 18:53:18,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:18,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023391752] [2024-11-22 18:53:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:18,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:18,928 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-22 18:53:18,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023391752] [2024-11-22 18:53:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023391752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142269325] [2024-11-22 18:53:18,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:18,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:18,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:18,929 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-22 18:53:18,930 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-22 18:53:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:19,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-22 18:53:19,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:19,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:53:19,177 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-22 18:53:19,204 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-22 18:53:19,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:53:19,266 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-22 18:53:19,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:53:19,299 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-22 18:53:19,403 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-22 18:53:19,407 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-22 18:53:19,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:19,487 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-22 18:53:19,487 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-22 18:53:19,491 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-22 18:53:19,543 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-22 18:53:19,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1984))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .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-22 18:53:19,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:19,560 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-22 18:53:19,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:19,570 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-22 18:53:19,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:19,581 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-22 18:53:19,586 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-22 18:53:19,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142269325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:19,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:19,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 29 [2024-11-22 18:53:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478477438] [2024-11-22 18:53:19,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:19,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-22 18:53:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-22 18:53:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1068, Unknown=11, NotChecked=204, Total=1406 [2024-11-22 18:53:19,716 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-22 18:53:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:20,354 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2024-11-22 18:53:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:53:20,355 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-22 18:53:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:20,356 INFO L225 Difference]: With dead ends: 165 [2024-11-22 18:53:20,356 INFO L226 Difference]: Without dead ends: 165 [2024-11-22 18:53:20,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1767, Unknown=11, NotChecked=264, Total=2256 [2024-11-22 18:53:20,357 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 20 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:20,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1062 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:53:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-22 18:53:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-22 18:53:20,360 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-22 18:53:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2024-11-22 18:53:20,363 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 46 [2024-11-22 18:53:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:20,364 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2024-11-22 18:53:20,364 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-22 18:53:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2024-11-22 18:53:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:53:20,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:20,364 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-22 18:53:20,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-22 18:53:20,565 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-22 18:53:20,565 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-22 18:53:20,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:20,565 INFO L85 PathProgramCache]: Analyzing trace with hash -361567796, now seen corresponding path program 1 times [2024-11-22 18:53:20,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112271164] [2024-11-22 18:53:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:20,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:21,480 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-22 18:53:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:21,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112271164] [2024-11-22 18:53:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112271164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124165109] [2024-11-22 18:53:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:21,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:21,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:21,485 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-22 18:53:21,487 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-22 18:53:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:21,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-22 18:53:21,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:21,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:53:21,858 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-22 18:53:21,893 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-22 18:53:21,899 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-22 18:53:21,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:53:21,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-22 18:53:21,979 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-22 18:53:22,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:53:22,023 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-22 18:53:22,028 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-22 18:53:22,170 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-22 18:53:22,173 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-22 18:53:22,218 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-22 18:53:22,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:22,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:22,388 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-22 18:53:22,494 WARN L851 $PredicateComparison]: unable to prove that (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|))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_prenex_4 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_4) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_2116 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2116) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (forall ((v_ArrVal_2115 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2115) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))))) is different from false [2024-11-22 18:53:22,511 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-22 18:53:22,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse2 (+ |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| .cse0 v_ArrVal_2113) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2114) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2116) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (forall ((v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2114))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_2115) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))))) (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| .cse0 v_ArrVal_2113) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2114) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_prenex_4) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 1))))) is different from false [2024-11-22 18:53:22,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:22,546 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-22 18:53:22,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:22,550 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-22 18:53:22,552 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-22 18:53:22,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:22,563 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-22 18:53:22,568 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-22 18:53:22,571 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-22 18:53:22,576 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-22 18:53:22,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:22,613 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-22 18:53:22,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:22,618 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-22 18:53:22,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:53:22,625 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-22 18:53:22,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:53:22,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:22,631 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-22 18:53:22,638 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 18:53:22,638 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-22 18:53:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124165109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:22,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:22,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2024-11-22 18:53:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424943330] [2024-11-22 18:53:22,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:22,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-22 18:53:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-22 18:53:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1414, Unknown=18, NotChecked=234, Total=1806 [2024-11-22 18:53:22,717 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-22 18:53:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:23,267 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2024-11-22 18:53:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:53:23,268 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-22 18:53:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:23,268 INFO L225 Difference]: With dead ends: 169 [2024-11-22 18:53:23,269 INFO L226 Difference]: Without dead ends: 169 [2024-11-22 18:53:23,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=2026, Unknown=18, NotChecked=282, Total=2550 [2024-11-22 18:53:23,270 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 26 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:23,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1044 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:53:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-22 18:53:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-22 18:53:23,273 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-22 18:53:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2024-11-22 18:53:23,273 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 46 [2024-11-22 18:53:23,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:23,273 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2024-11-22 18:53:23,273 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-22 18:53:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2024-11-22 18:53:23,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:53:23,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:23,274 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-22 18:53:23,284 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-22 18:53:23,475 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-22 18:53:23,476 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-22 18:53:23,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1659109671, now seen corresponding path program 1 times [2024-11-22 18:53:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:23,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313429466] [2024-11-22 18:53:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:24,859 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-22 18:53:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313429466] [2024-11-22 18:53:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313429466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367208905] [2024-11-22 18:53:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:24,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:24,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:24,863 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-22 18:53:24,867 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-22 18:53:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:25,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-22 18:53:25,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:25,132 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:53:25,133 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-22 18:53:25,194 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-22 18:53:25,194 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-22 18:53:25,267 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-22 18:53:25,308 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-22 18:53:25,561 INFO L349 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2024-11-22 18:53:25,561 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-22 18:53:25,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:25,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:25,641 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-22 18:53:36,467 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-22 18:53:43,948 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