/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:04:58,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:04:58,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:04:58,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:04:58,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:04:58,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:04:58,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:04:58,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:04:58,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:04:59,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:04:59,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:04:59,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:04:59,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:04:59,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:04:59,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:04:59,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:04:59,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:04:59,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:04:59,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:04:59,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:04:59,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:04:59,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:04:59,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:04:59,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:04:59,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:04:59,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:04:59,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:04:59,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:04:59,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:04:59,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:04:59,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:04:59,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:04:59,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:04:59,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:04:59,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:04:59,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:04:59,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:04:59,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:04:59,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:04:59,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:04:59,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:04:59,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:04:59,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:04:59,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:04:59,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:04:59,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:04:59,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:04:59,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:04:59,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:04:59,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:04:59,132 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:04:59,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:04:59,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:04:59,134 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:04:59,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:04:59,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:04:59,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:04:59,134 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:04:59,135 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:04:59,135 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:04:59,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:04:59,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:04:59,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:04:59,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:04:59,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:04:59,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:04:59,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:04:59,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:04:59,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:04:59,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:04:59,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:04:59,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:04:59,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-15 17:04:59,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:04:59,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:04:59,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:04:59,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:04:59,553 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:04:59,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2022-10-15 17:04:59,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88232db8d/2e63f382367745f38d9b378988b5035d/FLAGb3bdcf70c [2022-10-15 17:05:00,293 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:05:00,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2022-10-15 17:05:00,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88232db8d/2e63f382367745f38d9b378988b5035d/FLAGb3bdcf70c [2022-10-15 17:05:00,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88232db8d/2e63f382367745f38d9b378988b5035d [2022-10-15 17:05:00,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:05:00,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:05:00,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:05:00,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:05:00,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:05:00,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:00,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755b7054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00, skipping insertion in model container [2022-10-15 17:05:00,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:00,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:05:00,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:05:00,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-10-15 17:05:00,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:05:00,917 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:05:00,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-10-15 17:05:00,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:05:00,956 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:05:00,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00 WrapperNode [2022-10-15 17:05:00,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:05:00,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:05:00,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:05:00,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:05:00,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:00,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,001 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2022-10-15 17:05:01,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:05:01,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:05:01,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:05:01,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:05:01,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:05:01,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:05:01,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:05:01,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:05:01,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (1/1) ... [2022-10-15 17:05:01,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:05:01,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:01,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:05:01,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:05:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:05:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:05:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:05:01,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:05:01,238 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:05:01,241 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:05:01,493 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:05:01,507 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:05:01,507 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:05:01,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:05:01 BoogieIcfgContainer [2022-10-15 17:05:01,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:05:01,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:05:01,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:05:01,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:05:01,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:05:00" (1/3) ... [2022-10-15 17:05:01,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db66766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:05:01, skipping insertion in model container [2022-10-15 17:05:01,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:05:00" (2/3) ... [2022-10-15 17:05:01,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db66766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:05:01, skipping insertion in model container [2022-10-15 17:05:01,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:05:01" (3/3) ... [2022-10-15 17:05:01,538 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2022-10-15 17:05:01,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:05:01,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:05:01,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:05:01,643 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@2f7487df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:05:01,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:05:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 21 states have internal predecessors, (32), 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) [2022-10-15 17:05:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:05:01,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:01,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:01,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:01,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972139, now seen corresponding path program 1 times [2022-10-15 17:05:01,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:01,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31614516] [2022-10-15 17:05:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:01,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:01,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31614516] [2022-10-15 17:05:01,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31614516] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:01,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:05:01,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:05:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308418876] [2022-10-15 17:05:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:01,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-15 17:05:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:01,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-15 17:05:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 17:05:01,915 INFO L87 Difference]: Start difference. First operand has 22 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 21 states have internal predecessors, (32), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:05:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:01,930 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-10-15 17:05:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-15 17:05:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:05:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:01,941 INFO L225 Difference]: With dead ends: 17 [2022-10-15 17:05:01,942 INFO L226 Difference]: Without dead ends: 17 [2022-10-15 17:05:01,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 17:05:01,949 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:01,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:05:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-10-15 17:05:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-10-15 17:05:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) [2022-10-15 17:05:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-10-15 17:05:01,988 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 7 [2022-10-15 17:05:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:01,989 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-10-15 17:05:01,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:05:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-10-15 17:05:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:05:01,990 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:01,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:01,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:05:01,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2059231113, now seen corresponding path program 1 times [2022-10-15 17:05:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:01,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31819724] [2022-10-15 17:05:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:02,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31819724] [2022-10-15 17:05:02,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31819724] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:02,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:05:02,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:05:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416291157] [2022-10-15 17:05:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:02,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:05:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:02,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:05:02,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:05:02,206 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-10-15 17:05:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:02,254 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-10-15 17:05:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:05:02,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-10-15 17:05:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:02,256 INFO L225 Difference]: With dead ends: 21 [2022-10-15 17:05:02,256 INFO L226 Difference]: Without dead ends: 21 [2022-10-15 17:05:02,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:05:02,259 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:02,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:05:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-10-15 17:05:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-10-15 17:05:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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) [2022-10-15 17:05:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-10-15 17:05:02,265 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2022-10-15 17:05:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:02,266 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-10-15 17:05:02,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-10-15 17:05:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-10-15 17:05:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:05:02,267 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:02,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:02,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:05:02,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash 573171571, now seen corresponding path program 1 times [2022-10-15 17:05:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:02,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050168196] [2022-10-15 17:05:02,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:05:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:02,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050168196] [2022-10-15 17:05:02,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050168196] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:02,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:05:02,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:05:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663502404] [2022-10-15 17:05:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:02,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:05:02,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:02,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:05:02,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:05:02,411 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-10-15 17:05:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:02,466 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-10-15 17:05:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:05:02,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 [2022-10-15 17:05:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:02,468 INFO L225 Difference]: With dead ends: 27 [2022-10-15 17:05:02,468 INFO L226 Difference]: Without dead ends: 27 [2022-10-15 17:05:02,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:05:02,470 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:02,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:05:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-15 17:05:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-10-15 17:05:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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) [2022-10-15 17:05:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-10-15 17:05:02,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2022-10-15 17:05:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:02,484 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-10-15 17:05:02,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-10-15 17:05:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-10-15 17:05:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:05:02,486 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:02,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:02,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:05:02,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash 630429873, now seen corresponding path program 1 times [2022-10-15 17:05:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:02,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946981564] [2022-10-15 17:05:02,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:05:02,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:02,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946981564] [2022-10-15 17:05:02,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946981564] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:02,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:05:02,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:05:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197768611] [2022-10-15 17:05:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:02,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:05:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:05:02,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:05:02,693 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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) [2022-10-15 17:05:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:02,719 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-10-15 17:05:02,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:05:02,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 [2022-10-15 17:05:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:02,723 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:05:02,723 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:05:02,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:05:02,725 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:02,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:05:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:05:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-10-15 17:05:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:05:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-10-15 17:05:02,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2022-10-15 17:05:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:02,741 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-10-15 17:05:02,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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) [2022-10-15 17:05:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-10-15 17:05:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:05:02,743 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:02,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:02,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:05:02,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:02,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash 630489455, now seen corresponding path program 1 times [2022-10-15 17:05:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:02,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793292417] [2022-10-15 17:05:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:02,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:02,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:02,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793292417] [2022-10-15 17:05:02,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793292417] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:02,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968370663] [2022-10-15 17:05:02,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:02,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:02,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:02,902 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) [2022-10-15 17:05:02,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:05:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:02,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 17:05:02,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:03,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:05:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:03,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968370663] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:05:03,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:05:03,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-10-15 17:05:03,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557162180] [2022-10-15 17:05:03,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:05:03,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 17:05:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:03,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 17:05:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:05:03,114 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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) [2022-10-15 17:05:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:03,223 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-10-15 17:05:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:05:03,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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 [2022-10-15 17:05:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:03,227 INFO L225 Difference]: With dead ends: 51 [2022-10-15 17:05:03,228 INFO L226 Difference]: Without dead ends: 51 [2022-10-15 17:05:03,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:05:03,232 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:03,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 33 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:05:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-15 17:05:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-10-15 17:05:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 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) [2022-10-15 17:05:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-10-15 17:05:03,250 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2022-10-15 17:05:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:03,252 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-10-15 17:05:03,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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) [2022-10-15 17:05:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-10-15 17:05:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 17:05:03,253 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:03,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:03,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:03,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:03,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -901646477, now seen corresponding path program 2 times [2022-10-15 17:05:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:03,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767597488] [2022-10-15 17:05:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:03,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:03,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767597488] [2022-10-15 17:05:03,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767597488] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109351803] [2022-10-15 17:05:03,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:05:03,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:03,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:03,601 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) [2022-10-15 17:05:03,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:05:03,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:05:03,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:05:03,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 17:05:03,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 17:05:03,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:05:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 17:05:03,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109351803] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:05:03,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:05:03,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2022-10-15 17:05:03,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374378698] [2022-10-15 17:05:03,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:05:03,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 17:05:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:03,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 17:05:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-15 17:05:03,842 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 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) [2022-10-15 17:05:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:04,360 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2022-10-15 17:05:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-15 17:05:04,361 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 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 24 [2022-10-15 17:05:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:04,363 INFO L225 Difference]: With dead ends: 191 [2022-10-15 17:05:04,363 INFO L226 Difference]: Without dead ends: 191 [2022-10-15 17:05:04,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=381, Invalid=951, Unknown=0, NotChecked=0, Total=1332 [2022-10-15 17:05:04,366 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 195 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:04,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 71 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:05:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-10-15 17:05:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2022-10-15 17:05:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 169 states have internal predecessors, (216), 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) [2022-10-15 17:05:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2022-10-15 17:05:04,389 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 24 [2022-10-15 17:05:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:04,389 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2022-10-15 17:05:04,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 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) [2022-10-15 17:05:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2022-10-15 17:05:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 17:05:04,391 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:04,391 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:04,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:04,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 17:05:04,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1843449907, now seen corresponding path program 1 times [2022-10-15 17:05:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:04,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721875940] [2022-10-15 17:05:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-10-15 17:05:04,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:04,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721875940] [2022-10-15 17:05:04,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721875940] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:04,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:05:04,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:05:04,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968815670] [2022-10-15 17:05:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:04,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:05:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:04,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:05:04,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:05:04,682 INFO L87 Difference]: Start difference. First operand 170 states and 216 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-10-15 17:05:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:04,700 INFO L93 Difference]: Finished difference Result 215 states and 269 transitions. [2022-10-15 17:05:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:05:04,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 30 [2022-10-15 17:05:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:04,705 INFO L225 Difference]: With dead ends: 215 [2022-10-15 17:05:04,705 INFO L226 Difference]: Without dead ends: 215 [2022-10-15 17:05:04,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:05:04,712 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:04,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:05:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-10-15 17:05:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2022-10-15 17:05:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 197 states have internal predecessors, (250), 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) [2022-10-15 17:05:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2022-10-15 17:05:04,754 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 30 [2022-10-15 17:05:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:04,754 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2022-10-15 17:05:04,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-10-15 17:05:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-10-15 17:05:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 17:05:04,758 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:04,758 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:04,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:05:04,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:04,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash 399501479, now seen corresponding path program 1 times [2022-10-15 17:05:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:04,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060421097] [2022-10-15 17:05:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:04,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060421097] [2022-10-15 17:05:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060421097] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424814215] [2022-10-15 17:05:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:04,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:04,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:04,953 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) [2022-10-15 17:05:04,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:05:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:05,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 17:05:05,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:05,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:05:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:05,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424814215] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:05:05,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:05:05,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-10-15 17:05:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738394333] [2022-10-15 17:05:05,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:05:05,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 17:05:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 17:05:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2022-10-15 17:05:05,300 INFO L87 Difference]: Start difference. First operand 198 states and 250 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 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) [2022-10-15 17:05:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:05,573 INFO L93 Difference]: Finished difference Result 391 states and 491 transitions. [2022-10-15 17:05:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 17:05:05,574 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 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 31 [2022-10-15 17:05:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:05,577 INFO L225 Difference]: With dead ends: 391 [2022-10-15 17:05:05,577 INFO L226 Difference]: Without dead ends: 391 [2022-10-15 17:05:05,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2022-10-15 17:05:05,579 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 188 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:05,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 17 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:05:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-10-15 17:05:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 390. [2022-10-15 17:05:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.2596401028277635) internal successors, (490), 389 states have internal predecessors, (490), 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) [2022-10-15 17:05:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 490 transitions. [2022-10-15 17:05:05,620 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 490 transitions. Word has length 31 [2022-10-15 17:05:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:05,621 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 490 transitions. [2022-10-15 17:05:05,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 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) [2022-10-15 17:05:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 490 transitions. [2022-10-15 17:05:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:05:05,623 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:05,624 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:05,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:05,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:05,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash -871125337, now seen corresponding path program 2 times [2022-10-15 17:05:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:05,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023656039] [2022-10-15 17:05:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:06,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:06,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023656039] [2022-10-15 17:05:06,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023656039] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:06,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198043429] [2022-10-15 17:05:06,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:05:06,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:06,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:05:06,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:05:06,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:05:06,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:05:06,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 17:05:06,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:06,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:05:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:07,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198043429] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:05:07,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:05:07,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-10-15 17:05:07,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632616887] [2022-10-15 17:05:07,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:05:07,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-15 17:05:07,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-15 17:05:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 17:05:07,017 INFO L87 Difference]: Start difference. First operand 390 states and 490 transitions. Second operand has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 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) [2022-10-15 17:05:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:07,332 INFO L93 Difference]: Finished difference Result 535 states and 671 transitions. [2022-10-15 17:05:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-15 17:05:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 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 55 [2022-10-15 17:05:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:07,336 INFO L225 Difference]: With dead ends: 535 [2022-10-15 17:05:07,336 INFO L226 Difference]: Without dead ends: 535 [2022-10-15 17:05:07,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2022-10-15 17:05:07,339 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 247 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:07,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 37 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:05:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-10-15 17:05:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 534. [2022-10-15 17:05:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.2570356472795496) internal successors, (670), 533 states have internal predecessors, (670), 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) [2022-10-15 17:05:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 670 transitions. [2022-10-15 17:05:07,371 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 670 transitions. Word has length 55 [2022-10-15 17:05:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:07,371 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 670 transitions. [2022-10-15 17:05:07,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 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) [2022-10-15 17:05:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 670 transitions. [2022-10-15 17:05:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-15 17:05:07,375 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:07,375 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:07,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:07,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:07,589 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1639992537, now seen corresponding path program 3 times [2022-10-15 17:05:07,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:07,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071067578] [2022-10-15 17:05:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:08,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071067578] [2022-10-15 17:05:08,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071067578] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:08,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39791677] [2022-10-15 17:05:08,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 17:05:08,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:08,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:08,692 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:05:08,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 17:05:08,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-15 17:05:08,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:05:08,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 17:05:08,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-10-15 17:05:08,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:05:08,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39791677] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:08,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:05:08,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [27] total 31 [2022-10-15 17:05:08,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916252830] [2022-10-15 17:05:08,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:08,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:05:08,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:08,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:05:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2022-10-15 17:05:08,852 INFO L87 Difference]: Start difference. First operand 534 states and 670 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:05:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:08,930 INFO L93 Difference]: Finished difference Result 397 states and 524 transitions. [2022-10-15 17:05:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:05:08,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-10-15 17:05:08,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:08,933 INFO L225 Difference]: With dead ends: 397 [2022-10-15 17:05:08,934 INFO L226 Difference]: Without dead ends: 397 [2022-10-15 17:05:08,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2022-10-15 17:05:08,935 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:08,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:05:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-10-15 17:05:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 396. [2022-10-15 17:05:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 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) [2022-10-15 17:05:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 523 transitions. [2022-10-15 17:05:08,952 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 523 transitions. Word has length 73 [2022-10-15 17:05:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:08,953 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 523 transitions. [2022-10-15 17:05:08,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:05:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-10-15 17:05:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-15 17:05:08,956 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:08,956 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:08,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:09,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-15 17:05:09,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash -336186329, now seen corresponding path program 1 times [2022-10-15 17:05:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:09,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914869125] [2022-10-15 17:05:09,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:09,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:05:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:09,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914869125] [2022-10-15 17:05:09,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914869125] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:09,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:05:09,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-10-15 17:05:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986176683] [2022-10-15 17:05:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:09,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-15 17:05:09,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:09,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-15 17:05:09,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-10-15 17:05:09,627 INFO L87 Difference]: Start difference. First operand 396 states and 523 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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) [2022-10-15 17:05:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:09,907 INFO L93 Difference]: Finished difference Result 1730 states and 1895 transitions. [2022-10-15 17:05:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-15 17:05:09,907 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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 73 [2022-10-15 17:05:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:09,916 INFO L225 Difference]: With dead ends: 1730 [2022-10-15 17:05:09,916 INFO L226 Difference]: Without dead ends: 1730 [2022-10-15 17:05:09,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-10-15 17:05:09,918 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 711 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:09,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 137 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:05:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-10-15 17:05:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 400. [2022-10-15 17:05:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.2355889724310778) internal successors, (493), 399 states have internal predecessors, (493), 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) [2022-10-15 17:05:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 493 transitions. [2022-10-15 17:05:09,936 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 493 transitions. Word has length 73 [2022-10-15 17:05:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:09,937 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 493 transitions. [2022-10-15 17:05:09,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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) [2022-10-15 17:05:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 493 transitions. [2022-10-15 17:05:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-15 17:05:09,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:09,939 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:09,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:05:09,939 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1438821033, now seen corresponding path program 1 times [2022-10-15 17:05:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:09,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070177213] [2022-10-15 17:05:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:10,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070177213] [2022-10-15 17:05:10,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070177213] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:10,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709759605] [2022-10-15 17:05:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:10,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:10,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:10,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:05:10,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 17:05:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:10,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-15 17:05:11,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:12,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:05:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:05:14,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709759605] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:05:14,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:05:14,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2022-10-15 17:05:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129059539] [2022-10-15 17:05:14,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:05:14,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-10-15 17:05:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:14,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-10-15 17:05:14,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1574, Invalid=3828, Unknown=0, NotChecked=0, Total=5402 [2022-10-15 17:05:14,281 INFO L87 Difference]: Start difference. First operand 400 states and 493 transitions. Second operand has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 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) [2022-10-15 17:05:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:19,304 INFO L93 Difference]: Finished difference Result 1252 states and 1551 transitions. [2022-10-15 17:05:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-15 17:05:19,305 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 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 73 [2022-10-15 17:05:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:19,312 INFO L225 Difference]: With dead ends: 1252 [2022-10-15 17:05:19,312 INFO L226 Difference]: Without dead ends: 1252 [2022-10-15 17:05:19,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8218 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4191, Invalid=17565, Unknown=0, NotChecked=0, Total=21756 [2022-10-15 17:05:19,325 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 884 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:19,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 85 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 17:05:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-10-15 17:05:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 765. [2022-10-15 17:05:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.2382198952879582) internal successors, (946), 764 states have internal predecessors, (946), 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) [2022-10-15 17:05:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 946 transitions. [2022-10-15 17:05:19,351 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 946 transitions. Word has length 73 [2022-10-15 17:05:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:19,352 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 946 transitions. [2022-10-15 17:05:19,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 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) [2022-10-15 17:05:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 946 transitions. [2022-10-15 17:05:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-15 17:05:19,354 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:19,355 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:19,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:19,572 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1623737319, now seen corresponding path program 1 times [2022-10-15 17:05:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:19,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744427408] [2022-10-15 17:05:19,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:19,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-10-15 17:05:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:19,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744427408] [2022-10-15 17:05:19,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744427408] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:19,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:05:19,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:05:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950905117] [2022-10-15 17:05:19,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:19,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:05:19,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:19,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:05:19,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:05:19,723 INFO L87 Difference]: Start difference. First operand 765 states and 946 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) [2022-10-15 17:05:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:19,764 INFO L93 Difference]: Finished difference Result 990 states and 1223 transitions. [2022-10-15 17:05:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:05:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 73 [2022-10-15 17:05:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:19,770 INFO L225 Difference]: With dead ends: 990 [2022-10-15 17:05:19,770 INFO L226 Difference]: Without dead ends: 990 [2022-10-15 17:05:19,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:05:19,773 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 88 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:19,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:05:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-10-15 17:05:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 843. [2022-10-15 17:05:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.2458432304038005) internal successors, (1049), 842 states have internal predecessors, (1049), 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) [2022-10-15 17:05:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1049 transitions. [2022-10-15 17:05:19,800 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1049 transitions. Word has length 73 [2022-10-15 17:05:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:19,801 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1049 transitions. [2022-10-15 17:05:19,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) [2022-10-15 17:05:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1049 transitions. [2022-10-15 17:05:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-10-15 17:05:19,810 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:19,811 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:19,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 17:05:19,811 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:19,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2032536794, now seen corresponding path program 1 times [2022-10-15 17:05:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:19,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521908446] [2022-10-15 17:05:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-10-15 17:05:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:20,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521908446] [2022-10-15 17:05:20,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521908446] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:20,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058177909] [2022-10-15 17:05:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:20,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:20,010 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:05:20,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 17:05:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:20,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 17:05:20,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-10-15 17:05:20,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:05:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-10-15 17:05:20,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058177909] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:05:20,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:05:20,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-10-15 17:05:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492457031] [2022-10-15 17:05:20,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:05:20,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 17:05:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 17:05:20,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2022-10-15 17:05:20,757 INFO L87 Difference]: Start difference. First operand 843 states and 1049 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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) [2022-10-15 17:05:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:20,864 INFO L93 Difference]: Finished difference Result 1882 states and 2327 transitions. [2022-10-15 17:05:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:05:20,864 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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 142 [2022-10-15 17:05:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:20,873 INFO L225 Difference]: With dead ends: 1882 [2022-10-15 17:05:20,873 INFO L226 Difference]: Without dead ends: 1882 [2022-10-15 17:05:20,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=140, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:05:20,874 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 257 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:20,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 106 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:05:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-10-15 17:05:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1155. [2022-10-15 17:05:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2660311958405546) internal successors, (1461), 1154 states have internal predecessors, (1461), 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) [2022-10-15 17:05:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1461 transitions. [2022-10-15 17:05:20,906 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1461 transitions. Word has length 142 [2022-10-15 17:05:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:20,906 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1461 transitions. [2022-10-15 17:05:20,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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) [2022-10-15 17:05:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1461 transitions. [2022-10-15 17:05:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-10-15 17:05:20,909 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:20,909 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 39, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:20,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:21,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:21,124 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1816689998, now seen corresponding path program 1 times [2022-10-15 17:05:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:21,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662455142] [2022-10-15 17:05:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 721 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-10-15 17:05:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:21,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662455142] [2022-10-15 17:05:21,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662455142] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:21,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837211532] [2022-10-15 17:05:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:21,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:21,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:21,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:05:21,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 17:05:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:21,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-15 17:05:21,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1959 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-10-15 17:05:22,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:05:22,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837211532] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:05:22,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:05:22,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 44 [2022-10-15 17:05:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100851045] [2022-10-15 17:05:22,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:05:22,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 17:05:22,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 17:05:22,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2022-10-15 17:05:22,822 INFO L87 Difference]: Start difference. First operand 1155 states and 1461 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:05:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:22,989 INFO L93 Difference]: Finished difference Result 1062 states and 1306 transitions. [2022-10-15 17:05:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-15 17:05:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2022-10-15 17:05:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:22,994 INFO L225 Difference]: With dead ends: 1062 [2022-10-15 17:05:22,994 INFO L226 Difference]: Without dead ends: 876 [2022-10-15 17:05:22,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2022-10-15 17:05:22,996 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:22,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 14 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:05:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-10-15 17:05:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 810. [2022-10-15 17:05:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 1.1137206427688504) internal successors, (901), 809 states have internal predecessors, (901), 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) [2022-10-15 17:05:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 901 transitions. [2022-10-15 17:05:23,015 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 901 transitions. Word has length 145 [2022-10-15 17:05:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:23,015 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 901 transitions. [2022-10-15 17:05:23,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:05:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 901 transitions. [2022-10-15 17:05:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-10-15 17:05:23,023 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:23,023 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:23,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:23,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 17:05:23,239 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash 449680486, now seen corresponding path program 2 times [2022-10-15 17:05:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:23,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988115357] [2022-10-15 17:05:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-10-15 17:05:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988115357] [2022-10-15 17:05:23,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988115357] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582980577] [2022-10-15 17:05:23,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:05:23,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:23,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:23,955 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:05:23,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 17:05:24,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:05:24,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:05:24,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 17:05:24,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-10-15 17:05:25,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:05:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-10-15 17:05:26,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582980577] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:05:26,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:05:26,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-10-15 17:05:26,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802811000] [2022-10-15 17:05:26,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:05:26,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 17:05:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 17:05:26,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2022-10-15 17:05:26,160 INFO L87 Difference]: Start difference. First operand 810 states and 901 transitions. Second operand has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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) [2022-10-15 17:05:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:26,404 INFO L93 Difference]: Finished difference Result 2370 states and 2781 transitions. [2022-10-15 17:05:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 17:05:26,405 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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 418 [2022-10-15 17:05:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:26,411 INFO L225 Difference]: With dead ends: 2370 [2022-10-15 17:05:26,411 INFO L226 Difference]: Without dead ends: 1362 [2022-10-15 17:05:26,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2022-10-15 17:05:26,412 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 790 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:26,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 172 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:05:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2022-10-15 17:05:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2022-10-15 17:05:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 1.073475385745775) internal successors, (1461), 1361 states have internal predecessors, (1461), 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) [2022-10-15 17:05:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1461 transitions. [2022-10-15 17:05:26,439 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1461 transitions. Word has length 418 [2022-10-15 17:05:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:26,440 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1461 transitions. [2022-10-15 17:05:26,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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) [2022-10-15 17:05:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1461 transitions. [2022-10-15 17:05:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2022-10-15 17:05:26,472 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:26,473 INFO L195 NwaCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:26,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:26,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 17:05:26,689 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash 133527270, now seen corresponding path program 3 times [2022-10-15 17:05:26,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:26,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527447784] [2022-10-15 17:05:26,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:26,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:05:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-10-15 17:05:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:05:29,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527447784] [2022-10-15 17:05:29,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527447784] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:05:29,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11664256] [2022-10-15 17:05:29,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 17:05:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:05:29,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:05:29,887 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:05:29,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 17:05:30,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2022-10-15 17:05:30,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:05:30,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 17:05:30,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:05:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-10-15 17:05:34,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:05:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-10-15 17:05:35,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11664256] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:05:35,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:05:35,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-10-15 17:05:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054017234] [2022-10-15 17:05:35,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:05:35,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-15 17:05:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:05:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-15 17:05:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 17:05:35,818 INFO L87 Difference]: Start difference. First operand 1362 states and 1461 transitions. Second operand has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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) [2022-10-15 17:05:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:05:36,120 INFO L93 Difference]: Finished difference Result 2532 states and 2871 transitions. [2022-10-15 17:05:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-15 17:05:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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 970 [2022-10-15 17:05:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:05:36,130 INFO L225 Difference]: With dead ends: 2532 [2022-10-15 17:05:36,131 INFO L226 Difference]: Without dead ends: 1776 [2022-10-15 17:05:36,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1960 GetRequests, 1908 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2022-10-15 17:05:36,133 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 811 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:05:36,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 262 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:05:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2022-10-15 17:05:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2022-10-15 17:05:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 1.059718309859155) internal successors, (1881), 1775 states have internal predecessors, (1881), 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) [2022-10-15 17:05:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1881 transitions. [2022-10-15 17:05:36,168 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1881 transitions. Word has length 970 [2022-10-15 17:05:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:05:36,169 INFO L495 AbstractCegarLoop]: Abstraction has 1776 states and 1881 transitions. [2022-10-15 17:05:36,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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) [2022-10-15 17:05:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1881 transitions. [2022-10-15 17:05:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2022-10-15 17:05:36,233 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:05:36,234 INFO L195 NwaCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:36,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 17:05:36,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 17:05:36,451 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:05:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:05:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash 341765318, now seen corresponding path program 4 times [2022-10-15 17:05:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:05:36,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075855450] [2022-10-15 17:05:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:05:36,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:05:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:05:37,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:05:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:05:39,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:05:39,139 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:05:39,140 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:05:39,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:05:39,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 17:05:39,151 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:05:39,160 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:05:39,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:05:39 BoogieIcfgContainer [2022-10-15 17:05:39,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:05:39,666 INFO L158 Benchmark]: Toolchain (without parser) took 39000.33ms. Allocated memory was 151.0MB in the beginning and 413.1MB in the end (delta: 262.1MB). Free memory was 124.9MB in the beginning and 222.3MB in the end (delta: -97.4MB). Peak memory consumption was 210.6MB. Max. memory is 8.0GB. [2022-10-15 17:05:39,666 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 125.8MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:05:39,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.58ms. Allocated memory is still 151.0MB. Free memory was 124.7MB in the beginning and 114.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 17:05:39,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.87ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 112.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:05:39,669 INFO L158 Benchmark]: Boogie Preprocessor took 26.28ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 111.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:05:39,670 INFO L158 Benchmark]: RCFGBuilder took 483.85ms. Allocated memory is still 151.0MB. Free memory was 111.5MB in the beginning and 100.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 17:05:39,671 INFO L158 Benchmark]: TraceAbstraction took 38145.12ms. Allocated memory was 151.0MB in the beginning and 413.1MB in the end (delta: 262.1MB). Free memory was 100.2MB in the beginning and 222.3MB in the end (delta: -122.1MB). Peak memory consumption was 185.4MB. Max. memory is 8.0GB. [2022-10-15 17:05:39,681 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 125.8MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.58ms. Allocated memory is still 151.0MB. Free memory was 124.7MB in the beginning and 114.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.87ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 112.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.28ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 111.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 483.85ms. Allocated memory is still 151.0MB. Free memory was 111.5MB in the beginning and 100.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 38145.12ms. Allocated memory was 151.0MB in the beginning and 413.1MB in the end (delta: 262.1MB). Free memory was 100.2MB in the beginning and 222.3MB in the end (delta: -122.1MB). Peak memory consumption was 185.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) [L6] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L21] RET assume_abort_if_not(last > 0) [L22] int a=0,b=0,c=0,st=0,d=0; VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=0] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=20, d=0, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=40, b=40, c=20, d=20, last=21, SIZE=20, st=1] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [a=0, b=1, c=20, d=20, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, last=21, SIZE=20] [L12] reach_error() VAL [\old(cond)=0, cond=0, last=21, SIZE=20] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 37.5s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4444 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4444 mSDsluCounter, 1139 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 552 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2204 IncrementalHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 552 mSolverCounterUnsat, 278 mSDtfsCounter, 2204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3971 GetRequests, 3495 SyntacticMatches, 23 SemanticMatches, 453 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11796 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1776occurred in iteration=17, InterpolantAutomatonStates: 296, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 2812 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 5501 NumberOfCodeBlocks, 5447 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 5810 ConstructedInterpolants, 0 QuantifiedInterpolants, 34264 SizeOfPredicates, 29 NumberOfNonLiveVariables, 3443 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 35 InterpolantComputations, 9 PerfectInterpolantSequences, 44769/450178 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 17:05:39,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...