./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:55:03,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:55:03,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:55:03,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:55:03,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:55:03,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:55:03,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:55:03,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:55:03,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:55:03,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:55:03,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:55:03,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:55:03,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:55:03,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:55:03,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:55:03,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:55:03,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:55:03,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:55:03,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:55:03,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:55:03,706 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:55:03,706 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:55:03,707 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:55:03,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:55:03,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:55:03,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:55:03,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:55:03,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:55:03,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:55:03,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:55:03,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:55:03,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:55:03,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:55:03,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:55:03,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:55:03,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:55:03,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:55:03,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:55:03,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:55:03,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:55:03,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:55:03,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:55:03,714 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2024-10-14 17:55:03,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:55:03,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:55:03,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:55:03,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:55:03,948 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:55:03,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2024-10-14 17:55:05,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:55:05,674 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:55:05,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2024-10-14 17:55:05,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eabdd859/c89fe056c27a45dd953e05dd88ed2dd5/FLAGe2ead1266 [2024-10-14 17:55:05,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eabdd859/c89fe056c27a45dd953e05dd88ed2dd5 [2024-10-14 17:55:05,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:55:05,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:55:05,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:55:05,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:55:05,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:55:05,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:55:05" (1/1) ... [2024-10-14 17:55:05,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c2d2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:05, skipping insertion in model container [2024-10-14 17:55:05,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:55:05" (1/1) ... [2024-10-14 17:55:06,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:55:06,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:55:06,350 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:55:06,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:55:06,454 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:55:06,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06 WrapperNode [2024-10-14 17:55:06,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:55:06,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:55:06,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:55:06,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:55:06,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,518 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2024-10-14 17:55:06,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:55:06,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:55:06,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:55:06,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:55:06,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,553 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 13, 9]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2024-10-14 17:55:06,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:55:06,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:55:06,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:55:06,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:55:06,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (1/1) ... [2024-10-14 17:55:06,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:55:06,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:55:06,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:55:06,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:55:06,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:55:06,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:55:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:55:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:55:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:55:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:55:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:55:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:55:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:55:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:55:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 17:55:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 17:55:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 17:55:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:55:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:55:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 17:55:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:55:06,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:55:06,820 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:55:06,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:55:07,206 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-14 17:55:07,206 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:55:07,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:55:07,250 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:55:07,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:55:07 BoogieIcfgContainer [2024-10-14 17:55:07,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:55:07,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:55:07,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:55:07,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:55:07,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:55:05" (1/3) ... [2024-10-14 17:55:07,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b38aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:55:07, skipping insertion in model container [2024-10-14 17:55:07,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:55:06" (2/3) ... [2024-10-14 17:55:07,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b38aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:55:07, skipping insertion in model container [2024-10-14 17:55:07,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:55:07" (3/3) ... [2024-10-14 17:55:07,265 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2024-10-14 17:55:07,281 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:55:07,281 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-10-14 17:55:07,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:55:07,342 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;@551a1a75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:55:07,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-14 17:55:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:55:07,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:07,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:55:07,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:07,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 177979, now seen corresponding path program 1 times [2024-10-14 17:55:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:07,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705247233] [2024-10-14 17:55:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:07,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:07,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:07,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705247233] [2024-10-14 17:55:07,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705247233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:07,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:07,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:55:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091323691] [2024-10-14 17:55:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:07,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:55:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:55:07,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:55:07,708 INFO L87 Difference]: Start difference. First operand has 98 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:07,923 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-10-14 17:55:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:55:07,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:55:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:07,932 INFO L225 Difference]: With dead ends: 91 [2024-10-14 17:55:07,932 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 17:55:07,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:55:07,937 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 84 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:07,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 74 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:55:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 17:55:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 17:55:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-10-14 17:55:07,972 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 3 [2024-10-14 17:55:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:07,973 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-10-14 17:55:07,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-10-14 17:55:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:55:07,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:07,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:55:07,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:55:07,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:07,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 177980, now seen corresponding path program 1 times [2024-10-14 17:55:07,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:07,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821650880] [2024-10-14 17:55:07,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:07,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821650880] [2024-10-14 17:55:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821650880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:55:08,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403271417] [2024-10-14 17:55:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:08,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:55:08,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:08,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:55:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:55:08,179 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:08,336 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-14 17:55:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:55:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:55:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:08,358 INFO L225 Difference]: With dead ends: 110 [2024-10-14 17:55:08,358 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 17:55:08,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:55:08,359 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:08,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 87 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 17:55:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-10-14 17:55:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 2.02) internal successors, (101), 91 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-14 17:55:08,367 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 3 [2024-10-14 17:55:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:08,367 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-14 17:55:08,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-14 17:55:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:55:08,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:08,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:55:08,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:55:08,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash 5517329, now seen corresponding path program 1 times [2024-10-14 17:55:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117418432] [2024-10-14 17:55:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:08,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117418432] [2024-10-14 17:55:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117418432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:08,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:55:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057676993] [2024-10-14 17:55:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:08,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:55:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:55:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:55:08,417 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:08,501 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-10-14 17:55:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:55:08,502 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:55:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:08,503 INFO L225 Difference]: With dead ends: 88 [2024-10-14 17:55:08,503 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 17:55:08,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:55:08,504 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:08,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 101 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 17:55:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 17:55:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.94) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-10-14 17:55:08,514 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 4 [2024-10-14 17:55:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-10-14 17:55:08,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-10-14 17:55:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:55:08,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:08,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:55:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:55:08,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 5517330, now seen corresponding path program 1 times [2024-10-14 17:55:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503381588] [2024-10-14 17:55:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:08,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503381588] [2024-10-14 17:55:08,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503381588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:08,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:08,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:55:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107517314] [2024-10-14 17:55:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:08,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:55:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:08,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:55:08,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:55:08,613 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:08,683 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-10-14 17:55:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:55:08,683 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:55:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:08,684 INFO L225 Difference]: With dead ends: 84 [2024-10-14 17:55:08,684 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 17:55:08,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:55:08,687 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:08,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 17:55:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 17:55:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.86) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-10-14 17:55:08,699 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 4 [2024-10-14 17:55:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:08,699 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-10-14 17:55:08,699 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-10-14 17:55:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:55:08,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:08,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:08,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:55:08,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:08,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1664017186, now seen corresponding path program 1 times [2024-10-14 17:55:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:08,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109149062] [2024-10-14 17:55:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:08,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109149062] [2024-10-14 17:55:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109149062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:08,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:08,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:55:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432818310] [2024-10-14 17:55:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:08,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:55:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:08,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:55:08,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:55:08,933 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:09,116 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-10-14 17:55:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:55:09,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:55:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:09,118 INFO L225 Difference]: With dead ends: 91 [2024-10-14 17:55:09,118 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 17:55:09,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:55:09,119 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:09,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 375 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 17:55:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-10-14 17:55:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-14 17:55:09,131 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 8 [2024-10-14 17:55:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:09,131 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-14 17:55:09,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-14 17:55:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:55:09,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:09,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:09,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:55:09,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1645649802, now seen corresponding path program 1 times [2024-10-14 17:55:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580393240] [2024-10-14 17:55:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:09,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580393240] [2024-10-14 17:55:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580393240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:09,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:09,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:55:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761091212] [2024-10-14 17:55:09,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:09,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:55:09,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:09,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:55:09,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:55:09,309 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:09,508 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2024-10-14 17:55:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:55:09,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:55:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:09,510 INFO L225 Difference]: With dead ends: 108 [2024-10-14 17:55:09,510 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 17:55:09,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:55:09,512 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:09,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 156 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:55:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 17:55:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2024-10-14 17:55:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-10-14 17:55:09,518 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 13 [2024-10-14 17:55:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:09,518 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-10-14 17:55:09,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-10-14 17:55:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:55:09,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:09,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:09,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:55:09,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:09,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1645649803, now seen corresponding path program 1 times [2024-10-14 17:55:09,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:09,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395859024] [2024-10-14 17:55:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:09,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:09,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395859024] [2024-10-14 17:55:09,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395859024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:09,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:09,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:55:09,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85157788] [2024-10-14 17:55:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:09,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:55:09,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:55:09,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:55:09,853 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:10,005 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2024-10-14 17:55:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:55:10,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:55:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:10,006 INFO L225 Difference]: With dead ends: 109 [2024-10-14 17:55:10,006 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 17:55:10,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:55:10,011 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 69 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:10,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 135 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 17:55:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2024-10-14 17:55:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-10-14 17:55:10,017 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 13 [2024-10-14 17:55:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:10,017 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-10-14 17:55:10,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-10-14 17:55:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:55:10,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:10,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:10,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:55:10,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:10,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash 921589038, now seen corresponding path program 1 times [2024-10-14 17:55:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:10,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305425262] [2024-10-14 17:55:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305425262] [2024-10-14 17:55:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305425262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:10,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:55:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209556386] [2024-10-14 17:55:10,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:10,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:55:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:55:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:55:10,100 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:10,206 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-10-14 17:55:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:55:10,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:55:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:10,208 INFO L225 Difference]: With dead ends: 86 [2024-10-14 17:55:10,208 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 17:55:10,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:55:10,209 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:10,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 164 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 17:55:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 17:55:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-10-14 17:55:10,220 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 15 [2024-10-14 17:55:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:10,220 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-10-14 17:55:10,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-10-14 17:55:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:55:10,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:10,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:10,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:55:10,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:10,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash 921589039, now seen corresponding path program 1 times [2024-10-14 17:55:10,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:10,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484833725] [2024-10-14 17:55:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:10,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:10,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484833725] [2024-10-14 17:55:10,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484833725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:10,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:10,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:55:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92762924] [2024-10-14 17:55:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:10,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:55:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:10,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:55:10,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:55:10,528 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:10,733 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2024-10-14 17:55:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:55:10,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:55:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:10,734 INFO L225 Difference]: With dead ends: 107 [2024-10-14 17:55:10,734 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 17:55:10,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:55:10,735 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 61 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:10,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:55:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 17:55:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2024-10-14 17:55:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.709090909090909) internal successors, (94), 84 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-10-14 17:55:10,744 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 15 [2024-10-14 17:55:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-10-14 17:55:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-10-14 17:55:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:55:10,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:10,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:55:10,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash 954068591, now seen corresponding path program 1 times [2024-10-14 17:55:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446000982] [2024-10-14 17:55:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:10,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:10,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446000982] [2024-10-14 17:55:10,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446000982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:10,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:10,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:55:10,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146023406] [2024-10-14 17:55:10,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:10,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:55:10,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:55:10,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:55:10,857 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:10,958 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-14 17:55:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:55:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:55:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:10,959 INFO L225 Difference]: With dead ends: 80 [2024-10-14 17:55:10,959 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 17:55:10,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:55:10,960 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:10,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 170 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 17:55:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-10-14 17:55:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-14 17:55:10,963 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 15 [2024-10-14 17:55:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:10,964 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-14 17:55:10,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-14 17:55:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:55:10,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:10,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:10,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:55:10,965 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:10,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1495510857, now seen corresponding path program 1 times [2024-10-14 17:55:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164192425] [2024-10-14 17:55:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164192425] [2024-10-14 17:55:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164192425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:55:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103552360] [2024-10-14 17:55:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:55:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:55:11,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:55:11,331 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:11,560 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-10-14 17:55:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:55:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:55:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:11,562 INFO L225 Difference]: With dead ends: 112 [2024-10-14 17:55:11,562 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 17:55:11,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:55:11,562 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:11,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 313 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:55:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 17:55:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2024-10-14 17:55:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-10-14 17:55:11,569 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 16 [2024-10-14 17:55:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:11,570 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-10-14 17:55:11,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-10-14 17:55:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:55:11,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:11,570 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:55:11,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1217307736, now seen corresponding path program 1 times [2024-10-14 17:55:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:11,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264655293] [2024-10-14 17:55:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:11,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264655293] [2024-10-14 17:55:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264655293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:55:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958802470] [2024-10-14 17:55:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:55:11,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:55:11,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:55:11,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:55:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:11,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 17:55:11,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:55:12,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:55:12,111 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-14 17:55:12,112 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 23 treesize of output 24 [2024-10-14 17:55:12,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 17:55:12,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:55:12,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 17:55:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:12,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:55:12,331 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 38 treesize of output 34 [2024-10-14 17:55:12,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:12,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-10-14 17:55:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958802470] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:55:13,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:55:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-14 17:55:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183099304] [2024-10-14 17:55:13,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:55:13,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:55:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:55:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:55:13,226 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:13,607 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-10-14 17:55:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:55:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:55:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:13,608 INFO L225 Difference]: With dead ends: 89 [2024-10-14 17:55:13,608 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 17:55:13,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:55:13,609 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 80 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:13,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 294 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:55:13,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 17:55:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-10-14 17:55:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-14 17:55:13,614 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 16 [2024-10-14 17:55:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:13,615 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-14 17:55:13,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-14 17:55:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:55:13,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:13,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:13,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:55:13,820 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,SelfDestructingSolverStorable11 [2024-10-14 17:55:13,821 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:13,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:13,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1217307737, now seen corresponding path program 1 times [2024-10-14 17:55:13,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:13,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258192196] [2024-10-14 17:55:13,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:13,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258192196] [2024-10-14 17:55:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258192196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:55:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344616688] [2024-10-14 17:55:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:14,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:55:14,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:55:14,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:55:14,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:55:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:14,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 17:55:14,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:55:14,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 17:55:14,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:55:14,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:55:14,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:55:14,416 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:55:14,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 17:55:14,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:55:14,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:55:14,493 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:55:14,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:55:14,499 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 18 treesize of output 13 [2024-10-14 17:55:14,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 17:55:14,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:55:14,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:55:14,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 17:55:14,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 17:55:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:14,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:55:14,807 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 32 treesize of output 28 [2024-10-14 17:55:14,824 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 66 treesize of output 62 [2024-10-14 17:55:14,828 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 102 treesize of output 94 [2024-10-14 17:55:14,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:14,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-10-14 17:55:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344616688] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:55:15,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:55:15,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-14 17:55:15,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465330752] [2024-10-14 17:55:15,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:55:15,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:55:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:15,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:55:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:55:15,283 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:15,846 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-10-14 17:55:15,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:55:15,846 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:55:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:15,847 INFO L225 Difference]: With dead ends: 88 [2024-10-14 17:55:15,847 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 17:55:15,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-10-14 17:55:15,848 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 52 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:15,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 482 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:55:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 17:55:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-14 17:55:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-10-14 17:55:15,850 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 16 [2024-10-14 17:55:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:15,850 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-10-14 17:55:15,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-10-14 17:55:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:55:15,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:15,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:15,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:55:16,059 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,SelfDestructingSolverStorable12 [2024-10-14 17:55:16,060 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 883803790, now seen corresponding path program 1 times [2024-10-14 17:55:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175455450] [2024-10-14 17:55:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175455450] [2024-10-14 17:55:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175455450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:16,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:16,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:55:16,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277638096] [2024-10-14 17:55:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:16,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:55:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:55:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:55:16,356 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:16,580 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-10-14 17:55:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:55:16,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 17:55:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:16,581 INFO L225 Difference]: With dead ends: 107 [2024-10-14 17:55:16,581 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 17:55:16,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:55:16,582 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 30 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:16,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 187 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:55:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 17:55:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2024-10-14 17:55:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-14 17:55:16,585 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 17 [2024-10-14 17:55:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:16,585 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-14 17:55:16,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-14 17:55:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:55:16,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:16,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:16,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:55:16,586 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:16,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1628113817, now seen corresponding path program 1 times [2024-10-14 17:55:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864447885] [2024-10-14 17:55:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:16,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864447885] [2024-10-14 17:55:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864447885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:16,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:16,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:55:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56377738] [2024-10-14 17:55:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:16,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:55:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:55:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:55:16,879 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:17,139 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-10-14 17:55:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:55:17,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 17:55:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:17,140 INFO L225 Difference]: With dead ends: 98 [2024-10-14 17:55:17,140 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 17:55:17,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:55:17,141 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 18 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:17,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 229 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:55:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 17:55:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-10-14 17:55:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.55) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-10-14 17:55:17,143 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 18 [2024-10-14 17:55:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:17,143 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-10-14 17:55:17,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-10-14 17:55:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:55:17,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:17,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:17,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:55:17,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:17,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1068079119, now seen corresponding path program 1 times [2024-10-14 17:55:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718771165] [2024-10-14 17:55:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:17,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:17,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718771165] [2024-10-14 17:55:17,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718771165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:55:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971686915] [2024-10-14 17:55:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:17,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:55:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:55:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:55:17,258 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:17,396 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-10-14 17:55:17,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:55:17,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:55:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:17,397 INFO L225 Difference]: With dead ends: 87 [2024-10-14 17:55:17,397 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 17:55:17,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:55:17,398 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 131 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:17,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 56 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 17:55:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 17:55:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-14 17:55:17,400 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2024-10-14 17:55:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:17,400 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-14 17:55:17,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-14 17:55:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:55:17,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:17,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:17,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:55:17,401 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1068079118, now seen corresponding path program 1 times [2024-10-14 17:55:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:17,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418648750] [2024-10-14 17:55:17,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:17,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418648750] [2024-10-14 17:55:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418648750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:17,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:55:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644257069] [2024-10-14 17:55:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:17,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:55:17,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:17,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:55:17,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:55:17,451 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:17,500 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-14 17:55:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:55:17,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:55:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:17,501 INFO L225 Difference]: With dead ends: 80 [2024-10-14 17:55:17,501 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 17:55:17,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:55:17,501 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 93 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:17,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 36 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:55:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 17:55:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 17:55:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.4) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-10-14 17:55:17,504 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 19 [2024-10-14 17:55:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:17,504 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-10-14 17:55:17,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-10-14 17:55:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:55:17,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:17,505 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] [2024-10-14 17:55:17,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:55:17,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:17,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:17,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1249285725, now seen corresponding path program 1 times [2024-10-14 17:55:17,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:17,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852077399] [2024-10-14 17:55:17,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:17,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:17,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:17,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852077399] [2024-10-14 17:55:17,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852077399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:17,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:17,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:55:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636051656] [2024-10-14 17:55:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:17,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:55:17,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:55:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:55:17,603 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:17,671 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-14 17:55:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:55:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-14 17:55:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:17,672 INFO L225 Difference]: With dead ends: 79 [2024-10-14 17:55:17,672 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 17:55:17,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:55:17,673 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:17,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 147 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 17:55:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 17:55:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-14 17:55:17,676 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 20 [2024-10-14 17:55:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:17,676 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-14 17:55:17,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-14 17:55:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:55:17,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:17,677 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-10-14 17:55:17,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:55:17,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 73151921, now seen corresponding path program 1 times [2024-10-14 17:55:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831790166] [2024-10-14 17:55:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:17,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:17,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831790166] [2024-10-14 17:55:17,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831790166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:17,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:17,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:55:17,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859764419] [2024-10-14 17:55:17,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:17,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:55:17,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:17,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:55:17,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:55:17,777 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:17,868 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-10-14 17:55:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:55:17,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:55:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:17,869 INFO L225 Difference]: With dead ends: 78 [2024-10-14 17:55:17,869 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 17:55:17,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:55:17,870 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:17,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 118 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 17:55:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 17:55:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-14 17:55:17,873 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 21 [2024-10-14 17:55:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:17,873 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-14 17:55:17,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-14 17:55:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 17:55:17,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:17,874 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] [2024-10-14 17:55:17,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:55:17,874 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:17,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:17,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2027257633, now seen corresponding path program 1 times [2024-10-14 17:55:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:17,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135886955] [2024-10-14 17:55:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:18,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:18,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135886955] [2024-10-14 17:55:18,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135886955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:18,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:18,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 17:55:18,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044446205] [2024-10-14 17:55:18,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:18,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:55:18,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:18,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:55:18,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:55:18,236 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:18,624 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-10-14 17:55:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:55:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-14 17:55:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:18,626 INFO L225 Difference]: With dead ends: 94 [2024-10-14 17:55:18,626 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 17:55:18,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 17:55:18,627 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 44 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:18,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 184 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:55:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 17:55:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-10-14 17:55:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.34375) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-10-14 17:55:18,630 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 22 [2024-10-14 17:55:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:18,631 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-10-14 17:55:18,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-10-14 17:55:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 17:55:18,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:18,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:18,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:55:18,633 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:18,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1579522932, now seen corresponding path program 1 times [2024-10-14 17:55:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028282219] [2024-10-14 17:55:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:18,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:18,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028282219] [2024-10-14 17:55:18,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028282219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:18,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:18,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:55:18,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783068425] [2024-10-14 17:55:18,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:18,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:55:18,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:18,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:55:18,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:55:18,773 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:18,891 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-14 17:55:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:55:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 17:55:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:18,892 INFO L225 Difference]: With dead ends: 81 [2024-10-14 17:55:18,892 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 17:55:18,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:55:18,893 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:18,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 86 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 17:55:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 17:55:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.328125) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-10-14 17:55:18,895 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 23 [2024-10-14 17:55:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:18,896 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-10-14 17:55:18,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-10-14 17:55:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 17:55:18,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:18,896 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] [2024-10-14 17:55:18,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:55:18,897 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-14 17:55:18,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1343592089, now seen corresponding path program 1 times [2024-10-14 17:55:18,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:18,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514355440] [2024-10-14 17:55:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:55:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514355440] [2024-10-14 17:55:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514355440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:55:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194109668] [2024-10-14 17:55:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:19,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:55:19,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:55:19,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:55:19,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:55:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:19,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-14 17:55:19,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:55:19,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:55:19,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:55:19,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:55:20,004 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:55:20,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:55:20,143 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 11 [2024-10-14 17:55:20,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 27 treesize of output 26 [2024-10-14 17:55:20,295 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 19 treesize of output 11 [2024-10-14 17:55:20,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:20,420 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 17:55:20,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-10-14 17:55:20,509 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:20,510 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-10-14 17:55:20,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:20,516 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 31 [2024-10-14 17:55:20,710 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:20,711 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-10-14 17:55:20,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:20,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:20,717 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 15 treesize of output 10 [2024-10-14 17:55:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:20,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:55:21,279 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-14 17:55:21,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 180 [2024-10-14 17:55:21,349 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-14 17:55:21,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 286 treesize of output 272 [2024-10-14 17:55:21,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:21,371 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 196 treesize of output 194 [2024-10-14 17:55:21,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:21,392 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 190 treesize of output 188 [2024-10-14 17:55:21,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-14 17:55:21,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-14 17:55:21,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:21,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 315 treesize of output 329 [2024-10-14 17:55:22,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:22,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1836 treesize of output 1808 [2024-10-14 17:55:34,550 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse231 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse140 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse181 (forall ((v_prenex_27 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse264 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_27))) (store .cse264 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse264) v_arrayElimCell_54) (+ v_prenex_27 4))))) v_arrayElimCell_54) (+ v_prenex_23 4)) 0)))) (.cse92 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse262 (+ v_prenex_12 4))) (let ((.cse261 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse263 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse263 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse263) v_arrayElimCell_44) .cse262)))) v_arrayElimCell_54))) (or (= (select .cse261 4) 0) (= 0 (select .cse261 .cse262))))))))) (.cse95 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (= (let ((.cse260 (+ v_prenex_13 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse259 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_13))) (store .cse259 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse259) v_arrayElimCell_44) .cse260)))) v_arrayElimCell_54) .cse260)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse99 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse256 (+ v_prenex_12 4))) (let ((.cse255 (let ((.cse258 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse258 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse258) v_arrayElimCell_44) .cse256))))) (let ((.cse257 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse255) v_arrayElimCell_54))) (or (= (select .cse255 .cse256) 0) (= (select .cse257 4) 0) (= 0 (select .cse257 .cse256)))))))))) (.cse109 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse254 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse251 (+ v_prenex_12 4))) (let ((.cse253 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse254) v_arrayElimCell_44) .cse251))) (let ((.cse250 (store .cse254 4 .cse253))) (let ((.cse252 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse250) v_arrayElimCell_54))) (or (= (select .cse250 .cse251) 0) (= (select .cse252 4) 0) (= .cse253 0) (= 0 (select .cse252 .cse251)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse141 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse247 (+ v_prenex_22 4))) (let ((.cse248 (let ((.cse249 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse249 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse249) v_arrayElimCell_54) .cse247))))) (let ((.cse246 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse248) v_arrayElimCell_54))) (or (= (select .cse246 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse246 .cse247) 0) (= (select .cse248 .cse247) 0))))))) (.cse180 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int) (v_arrayElimCell_54 Int)) (or (= (let ((.cse245 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse244 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_24))) (store .cse244 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse244) v_arrayElimCell_54) .cse245)))) v_arrayElimCell_54) .cse245)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse9 (and (or .cse231 .cse140) (or .cse140 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))))) (.cse163 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse242 (+ v_prenex_22 4))) (let ((.cse241 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse243 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse243 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse243) v_arrayElimCell_54) .cse242)))) v_arrayElimCell_54))) (or (= (select .cse241 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse241 .cse242) 0)))))) (.cse183 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse239 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse240 (+ v_prenex_22 4))) (let ((.cse238 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse239) v_arrayElimCell_54) .cse240))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse238 0) (= (select (store .cse239 4 .cse238) .cse240) 0)))))) (.cse185 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_26)) v_arrayElimCell_54) (+ v_prenex_26 4)))))) (.cse184 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse237 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse236 (+ v_prenex_22 4))) (let ((.cse235 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse237) v_arrayElimCell_54) .cse236))) (let ((.cse234 (store .cse237 4 .cse235))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse234) v_arrayElimCell_54) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse235 0) (= (select .cse234 .cse236) 0))))))) (.cse4 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse31 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse21 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse12 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21) 0)))) (.cse29 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_17 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse233 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse233 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse233) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_17 4))))))) (.cse34 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_54) .cse21) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse38 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_17 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_54) (+ v_prenex_17 4)) 0))))) (.cse22 (not .cse31)) (.cse111 (or .cse184 .cse4)) (.cse98 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse232 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse232 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse232) v_arrayElimCell_44) .cse21)))) v_arrayElimCell_54) (+ v_prenex_15 4)) 0)))) (.cse112 (or .cse4 .cse185)) (.cse113 (or .cse183 .cse4)) (.cse138 (and (or .cse231 .cse4) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ |c_ULTIMATE.start_append_~plist#1.offset| 1)) .cse4))) (.cse114 (or .cse9 .cse163)) (.cse115 (or .cse180 .cse9)) (.cse81 (or (forall ((v_arrayElimCell_51 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_51)) v_arrayElimCell_54) (+ 4 v_arrayElimCell_51)) 0))) .cse4)) (.cse89 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse230 (+ v_prenex_13 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse229 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_13))) (store .cse229 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse229) v_arrayElimCell_54) .cse230)))) v_arrayElimCell_54) .cse230)) 0))) .cse9)) (.cse110 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_arrayElimCell_54) .cse21) 0))) .cse4)) (.cse118 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse228 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse226 (+ v_prenex_12 4))) (let ((.cse227 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse228) v_arrayElimCell_54) .cse226))) (let ((.cse225 (store .cse228 4 .cse227))) (or (= (select .cse225 .cse226) 0) (= .cse227 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse225) v_arrayElimCell_54) 4) 0)))))) .cse4)) (.cse119 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse222 (+ v_prenex_12 4))) (let ((.cse221 (let ((.cse224 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse224 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse224) v_arrayElimCell_54) .cse222))))) (let ((.cse223 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse221) v_arrayElimCell_54))) (or (= (select .cse221 .cse222) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse223 .cse222) 0) (= (select .cse223 4) 0)))))) .cse4)) (.cse120 (or .cse4 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse218 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse220 (+ v_prenex_12 4))) (let ((.cse219 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse218) v_arrayElimCell_54) .cse220))) (or (= (select (store .cse218 4 .cse219) .cse220) 0) (= .cse219 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))))))) (.cse121 (or .cse9 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse216 (+ v_prenex_12 4))) (let ((.cse215 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse217 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse217 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse217) v_arrayElimCell_54) .cse216)))) v_arrayElimCell_54))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse215 .cse216) 0) (= (select .cse215 4) 0))))))) (.cse116 (or .cse9 .cse141)) (.cse82 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_prenex_21 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse214 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse214 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse214) v_arrayElimCell_54) (+ v_prenex_21 4))))) v_arrayElimCell_54) .cse21) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse87 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse213 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse213 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse213) v_arrayElimCell_54) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_54) (+ v_prenex_16 4)) 0))))) (.cse100 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse210 (+ v_prenex_22 4))) (let ((.cse209 (let ((.cse212 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse212 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse212) v_arrayElimCell_44) .cse210))))) (let ((.cse211 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse209) v_arrayElimCell_54))) (or (= (select .cse209 .cse210) 0) (= (select .cse211 4) 0) (= (select .cse211 .cse210) 0))))))))) (.cse90 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_21 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse208 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse208 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse208) v_arrayElimCell_44) (+ v_prenex_21 4))))) v_arrayElimCell_54) .cse21) 0))))) (.cse101 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_24 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (= (let ((.cse207 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse206 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_24))) (store .cse206 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse206) v_arrayElimCell_44) .cse207)))) v_arrayElimCell_54) .cse207)) 0))))) (.cse102 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse205 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse202 (+ v_prenex_22 4))) (let ((.cse204 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse205) v_arrayElimCell_44) .cse202))) (let ((.cse201 (store .cse205 4 .cse204))) (let ((.cse203 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse201) v_arrayElimCell_54))) (or (= (select .cse201 .cse202) 0) (= (select .cse203 4) 0) (= (select .cse203 .cse202) 0) (= .cse204 0)))))))))) (.cse143 (and .cse92 .cse95 .cse99 .cse109)) (.cse93 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse200 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse200 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse200) v_arrayElimCell_44) .cse21)))) v_arrayElimCell_54) .cse21) 0))))) (.cse103 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse198 (+ v_prenex_22 4))) (let ((.cse197 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse199 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse199 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse199) v_arrayElimCell_44) .cse198)))) v_arrayElimCell_54))) (or (= (select .cse197 4) 0) (= (select .cse197 .cse198) 0)))))))) (.cse0 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse91 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_17 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse194 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse195 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse194)) (.cse196 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse194 4 (select (select .cse195 v_arrayElimCell_44) .cse21))) v_arrayElimCell_54) .cse196) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse194 4 (select (select .cse195 |c_ULTIMATE.start_append_~item~0#1.base|) .cse21))) v_arrayElimCell_54) .cse196) 0)))))))) (.cse96 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_25 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse193 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse193 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse193) v_arrayElimCell_44) .cse21)))) v_arrayElimCell_54) (+ v_prenex_25 4)) 0))))) (.cse97 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse192 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse192 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse192) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_54) (+ v_prenex_16 4)) 0))))) (.cse104 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_27 Int) (v_prenex_23 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse191 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_27))) (store .cse191 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse191) v_arrayElimCell_44) (+ v_prenex_27 4))))) v_arrayElimCell_54) (+ v_prenex_23 4)) 0))))) (.cse117 (or .cse9 .cse181))) (and (or .cse0 (and (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse3 (+ v_prenex_12 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse1) |c_ULTIMATE.start_append_~item~0#1.base|) .cse3))) (or (= (select (store .cse1 4 .cse2) .cse3) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse2 0))))) .cse4) (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse8 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse6 (+ v_prenex_12 4))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse8) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6))) (let ((.cse5 (store .cse8 4 .cse7))) (or (= (select .cse5 .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse7 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse5) |c_ULTIMATE.start_append_~item~0#1.base|) 4))))))) .cse4) (or .cse9 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse11 (+ v_prenex_13 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse10 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_13))) (store .cse10 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse10) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)) 0)))) (or .cse4 (forall ((v_arrayElimCell_51 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_51)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_51)) 0)))) (or .cse4 .cse12) (or .cse9 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse14 (+ v_prenex_12 4))) (let ((.cse13 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse15 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse15 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse15) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= 0 (select .cse13 4)) (= 0 (select .cse13 .cse14))))))) (or .cse4 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse17 (+ v_prenex_12 4))) (let ((.cse16 (let ((.cse19 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse19 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse19) |c_ULTIMATE.start_append_~item~0#1.base|) .cse17))))) (let ((.cse18 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse16) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse16 .cse17) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= 0 (select .cse18 4)) (= 0 (select .cse18 .cse17)))))))))) (or (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse20 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_20))) (store .cse20 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse20) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_20 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21) 0))) .cse22) (or .cse0 (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_prenex_19 Int)) (let ((.cse24 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse25 (+ v_prenex_14 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse23 (store .cse24 0 v_prenex_19))) (store .cse23 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse23) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_19 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse25) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse26 (store .cse24 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse26 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse26) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse25) 0)))) .cse22) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_25 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse27 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse27 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse27) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_25 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse28 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse28 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse28) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4)) 0)))) .cse29 (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse30 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse30 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse30) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_15 4)) 0))) .cse31))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse32 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse32 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse32) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21) 0))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_21 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse33 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse33 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse33) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_21 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21) 0))))) .cse9) (or (< |c_ULTIMATE.start_append_~plist#1.offset| 0) (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|) (and (or (and .cse34 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_54 Int) (v_prenex_19 Int) (v_arrayElimCell_44 Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse36 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store .cse35 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_54) .cse36) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse37 (store .cse35 0 v_prenex_19))) (store .cse37 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse37) v_arrayElimCell_44) (+ v_prenex_19 4))))) v_arrayElimCell_54) .cse36) 0)))))) .cse38 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_18 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_54) (+ v_prenex_18 4)) 0))))) .cse0) (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_17 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_17 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_18 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_18 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_14 Int) (v_prenex_19 Int) (v_arrayElimCell_44 Int)) (let ((.cse39 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse40 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store .cse39 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse40) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse41 (store .cse39 0 v_prenex_19))) (store .cse41 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse41) v_arrayElimCell_44) (+ v_prenex_19 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse40) 0)))))))) .cse12) .cse22) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse42 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse42 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse42) v_arrayElimCell_44) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21) 0)))) (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse43 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse43 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse43) v_arrayElimCell_44) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_25 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse44 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse44 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse44) v_arrayElimCell_44) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_15 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse31) .cse29 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse45 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse45 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse45) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4)) 0)))) (or .cse22 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_prenex_19 Int) (v_arrayElimCell_44 Int)) (let ((.cse47 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse48 (+ v_prenex_14 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse46 (store .cse47 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse46 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse46) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse48) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse49 (store .cse47 0 v_prenex_19))) (store .cse49 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse49) v_arrayElimCell_44) (+ v_prenex_19 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse48) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_21 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse50 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse50 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse50) v_arrayElimCell_44) (+ v_prenex_21 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21) 0)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_44 Int)) (let ((.cse55 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse53 (+ v_prenex_12 4))) (let ((.cse54 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse55) v_arrayElimCell_44) .cse53))) (let ((.cse52 (store .cse55 4 .cse54))) (let ((.cse51 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse52) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse51 4) 0) (= (select .cse52 .cse53) 0) (= (select .cse51 .cse53) 0) (= .cse54 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_44 Int)) (let ((.cse58 (+ v_prenex_12 4))) (let ((.cse57 (let ((.cse59 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse59 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse59) v_arrayElimCell_44) .cse58))))) (let ((.cse56 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse57) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse56 4) 0) (= (select .cse57 .cse58) 0) (= (select .cse56 .cse58) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_13 Int) (v_arrayElimCell_44 Int)) (= (let ((.cse61 (+ v_prenex_13 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse60 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_13))) (store .cse60 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse60) v_arrayElimCell_44) .cse61)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse61)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_44 Int)) (let ((.cse63 (+ v_prenex_12 4))) (let ((.cse62 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse64 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse64 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse64) v_arrayElimCell_44) .cse63)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse62 4) 0) (= (select .cse62 .cse63) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) .cse0) (or .cse22 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse65 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_20))) (store .cse65 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse65) v_arrayElimCell_44) (+ v_prenex_20 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21) 0)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_27 Int) (v_prenex_23 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse66 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_27))) (store .cse66 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse66) v_arrayElimCell_44) (+ v_prenex_27 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_23 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_44 Int)) (let ((.cse71 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse68 (+ v_prenex_22 4))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse71) v_arrayElimCell_44) .cse68))) (let ((.cse69 (store .cse71 4 .cse70))) (let ((.cse67 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse69) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse67 .cse68) 0) (= (select .cse69 .cse68) 0) (= (select .cse67 4) 0) (= .cse70 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_24 Int) (v_arrayElimCell_44 Int)) (= (let ((.cse73 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse72 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_24))) (store .cse72 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse72) v_arrayElimCell_44) .cse73)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse73)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_44 Int)) (let ((.cse75 (+ v_prenex_22 4))) (let ((.cse76 (let ((.cse77 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse77 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse77) v_arrayElimCell_44) .cse75))))) (let ((.cse74 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse76) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse74 .cse75) 0) (= (select .cse76 .cse75) 0) (= (select .cse74 4) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_44 Int)) (let ((.cse79 (+ v_prenex_22 4))) (let ((.cse78 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse80 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse80 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse80) v_arrayElimCell_44) .cse79)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse78 .cse79) 0) (= (select .cse78 4) 0)))))))) .cse31)) .cse9) (or .cse0 (and .cse81 (or .cse9 (and .cse34 .cse82 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_25 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_54) (+ v_prenex_25 4)) 0)))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_arrayElimCell_54 Int) (v_prenex_19 Int)) (let ((.cse84 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse85 (+ v_prenex_14 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse83 (store .cse84 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse83 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse83) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) v_arrayElimCell_54) .cse85) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse86 (store .cse84 0 v_prenex_19))) (store .cse86 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse86) v_arrayElimCell_54) (+ v_prenex_19 4))))) v_arrayElimCell_54) .cse85))))) .cse22) .cse87 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse88 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_20))) (store .cse88 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse88) v_arrayElimCell_54) (+ v_prenex_20 4))))) v_arrayElimCell_54) .cse21) 0))) .cse22) (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_54) (+ v_prenex_15 4)) 0))) .cse31) .cse38)) .cse89 (or (and .cse90 .cse91 .cse92 .cse93 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse94 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_20))) (store .cse94 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse94) v_arrayElimCell_44) (+ v_prenex_20 4))))) v_arrayElimCell_54) .cse21) 0))) .cse22) .cse95 .cse96 .cse97 (or .cse98 .cse31) .cse99 (or (and .cse100 .cse101 .cse102 .cse103 .cse104) .cse31) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_arrayElimCell_54 Int) (v_prenex_19 Int) (v_arrayElimCell_44 Int)) (let ((.cse106 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse107 (+ v_prenex_14 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse105 (store .cse106 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse105 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse105) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) v_arrayElimCell_54) .cse107) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse108 (store .cse106 0 v_prenex_19))) (store .cse108 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse108) v_arrayElimCell_44) (+ v_prenex_19 4))))) v_arrayElimCell_54) .cse107) 0)))) .cse22) .cse109) .cse9) .cse110 (or (and .cse111 .cse112 .cse113 .cse114 .cse115 .cse116 .cse117) .cse31) .cse118 .cse119 .cse120 .cse121)) (or (and (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse123 (+ v_prenex_22 4))) (let ((.cse122 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse124 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse124 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse124) |c_ULTIMATE.start_append_~item~0#1.base|) .cse123)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse122 .cse123) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse122 4) 0))))) .cse9) (or .cse9 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse126 (+ v_prenex_22 4))) (let ((.cse127 (let ((.cse128 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse128 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse128) |c_ULTIMATE.start_append_~item~0#1.base|) .cse126))))) (let ((.cse125 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse127) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse125 .cse126) 0) (= (select .cse127 .cse126) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse125 4) 0))))))) (or .cse9 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse130 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse129 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_24))) (store .cse129 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse129) |c_ULTIMATE.start_append_~item~0#1.base|) .cse130)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse130)) 0)))) (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse131 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse133 (+ v_prenex_22 4))) (let ((.cse132 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse131) |c_ULTIMATE.start_append_~item~0#1.base|) .cse133))) (or (= (select (store .cse131 4 .cse132) .cse133) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= 0 .cse132))))) .cse0 .cse4) (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse137 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse135 (+ v_prenex_22 4))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse137) |c_ULTIMATE.start_append_~item~0#1.base|) .cse135))) (let ((.cse134 (store .cse137 4 .cse136))) (or (= (select .cse134 .cse135) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse134) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= 0 .cse136)))))) .cse138) (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_26)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_26 4)) 0))) .cse0 .cse4) (or (forall ((v_prenex_27 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse139 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_27))) (store .cse139 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse139) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_27 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_23 4)) 0))) .cse9)) .cse31) (or (and .cse111 (or .cse140 .cse141) (or (and (or .cse9 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse142 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse142 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse142) v_arrayElimCell_44) .cse21)))) v_arrayElimCell_54) (+ v_prenex_25 4)) 0)))) (or .cse143 .cse9) (or .cse9 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_21 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse144 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse144 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse144) v_arrayElimCell_44) (+ v_prenex_21 4))))) v_arrayElimCell_54) .cse21) 0)))) (or (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse145 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse145 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse145) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_54) (+ v_prenex_16 4)) 0))) .cse9) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse146 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse146 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse146) v_arrayElimCell_44) .cse21)))) v_arrayElimCell_54) .cse21) 0))) .cse140) (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse148 (+ v_prenex_22 4))) (let ((.cse147 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse149 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse149 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse149) v_arrayElimCell_44) .cse148)))) v_arrayElimCell_54))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse147 4) 0) (= (select .cse147 .cse148) 0))))) .cse140) (or .cse140 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse154 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse151 (+ v_prenex_22 4))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse154) v_arrayElimCell_44) .cse151))) (let ((.cse150 (store .cse154 4 .cse153))) (let ((.cse152 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse150) v_arrayElimCell_54))) (or (= (select .cse150 .cse151) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse152 4) 0) (= (select .cse152 .cse151) 0) (= .cse153 0)))))))) (or (forall ((v_prenex_27 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse155 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_27))) (store .cse155 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse155) v_arrayElimCell_44) (+ v_prenex_27 4))))) v_arrayElimCell_54) (+ v_prenex_23 4)) 0))) .cse140) (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse156 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse156 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse156) |c_ULTIMATE.start_append_~item~0#1.base|) .cse21)))) v_arrayElimCell_54) (+ v_prenex_17 4)) 0))) .cse140) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (or (= (let ((.cse158 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse157 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_24))) (store .cse157 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse157) v_arrayElimCell_44) .cse158)))) v_arrayElimCell_54) .cse158)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse140) (or .cse98 .cse140) (or .cse140 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (let ((.cse160 (+ v_prenex_22 4))) (let ((.cse159 (let ((.cse162 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse162 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse162) v_arrayElimCell_44) .cse160))))) (let ((.cse161 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse159) v_arrayElimCell_54))) (or (= (select .cse159 .cse160) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse161 4) 0) (= (select .cse161 .cse160) 0)))))))) .cse0) .cse112 (or .cse140 .cse163) .cse113 .cse110 (or .cse9 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_21 Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse164 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse164 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse164) v_arrayElimCell_54) (+ v_prenex_21 4))))) v_arrayElimCell_54) .cse21) 0)))) (or (and (or .cse9 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse165 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse165 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse165) v_arrayElimCell_54) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_54) (+ v_prenex_16 4)) 0)))) (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse166 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse166 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse166) v_arrayElimCell_54) .cse21)))) v_arrayElimCell_54) (+ v_prenex_15 4)) 0))) .cse140) (or .cse140 (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (let ((.cse167 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse168 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse167)) (.cse169 (+ v_prenex_17 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse167 4 (select (select .cse168 |c_ULTIMATE.start_append_~item~0#1.base|) .cse21))) v_arrayElimCell_54) .cse169) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse167 4 (select (select .cse168 v_arrayElimCell_54) .cse21))) v_arrayElimCell_54) .cse169))))))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse170 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse170 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse170) v_arrayElimCell_54) .cse21)))) v_arrayElimCell_54) (+ v_prenex_25 4)) 0))) .cse9)) .cse0) (or .cse9 .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_54 Int)) (let ((.cse172 (+ v_prenex_12 4))) (let ((.cse171 (let ((.cse174 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse174 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse174) v_arrayElimCell_54) .cse172))))) (let ((.cse173 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse171) v_arrayElimCell_54))) (or (= (select .cse171 .cse172) 0) (= (select .cse173 .cse172) 0) (= (select .cse173 4) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_54 Int)) (let ((.cse176 (+ v_prenex_12 4))) (let ((.cse175 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse177 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse177 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse177) v_arrayElimCell_54) .cse176)))) v_arrayElimCell_54))) (or (= (select .cse175 .cse176) 0) (= (select .cse175 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_13 Int) (v_arrayElimCell_54 Int)) (= (let ((.cse179 (+ v_prenex_13 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse178 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_13))) (store .cse178 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse178) v_arrayElimCell_54) .cse179)))) v_arrayElimCell_54) .cse179)) 0)))))) (or .cse180 .cse140) (or .cse181 .cse140) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse182 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse182 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse182) v_arrayElimCell_54) .cse21)))) v_arrayElimCell_54) .cse21) 0))) .cse140) (or .cse0 (and .cse81 .cse89 .cse118 .cse119 .cse120 .cse121))) .cse31) (or (and (or .cse183 .cse0 .cse4) (or .cse184 .cse138) .cse114 .cse115 (or .cse0 (and .cse81 .cse89 .cse110 .cse118 .cse119 .cse120 .cse121)) .cse116 (or .cse0 .cse4 .cse185) (or .cse9 (and .cse82 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse186 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse186 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse186) v_arrayElimCell_54) .cse21)))) v_arrayElimCell_54) .cse21) 0)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_25 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse187 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse187 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse187) v_arrayElimCell_54) .cse21)))) v_arrayElimCell_54) (+ v_prenex_25 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_17 Int) (v_arrayElimCell_54 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse188 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse188 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse188) v_arrayElimCell_54) .cse21)))) v_arrayElimCell_54) (+ v_prenex_17 4)))))) .cse87 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_15 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse189 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse189 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse189) v_arrayElimCell_54) .cse21)))) v_arrayElimCell_54) (+ v_prenex_15 4)) 0))))) .cse0))) (or .cse9 (and .cse100 .cse90 .cse101 .cse102 (or .cse143 .cse0) .cse93 .cse103 (or .cse0 (and .cse91 .cse96 .cse97 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_15 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse190 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse190 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse190) v_arrayElimCell_44) .cse21)))) v_arrayElimCell_54) (+ v_prenex_15 4)) 0)))))) .cse104)) .cse117) .cse31))))) is different from true