/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-23 16:47:45,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-23 16:47:45,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-23 16:47:45,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-23 16:47:45,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-23 16:47:45,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-23 16:47:45,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-23 16:47:45,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-23 16:47:45,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-23 16:47:45,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-23 16:47:45,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-23 16:47:45,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-23 16:47:45,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-23 16:47:45,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-23 16:47:45,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-23 16:47:45,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-23 16:47:45,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-23 16:47:45,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-23 16:47:45,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-23 16:47:45,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-23 16:47:45,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-23 16:47:45,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-23 16:47:45,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-23 16:47:45,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-23 16:47:45,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-23 16:47:45,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-23 16:47:45,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-23 16:47:45,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-23 16:47:45,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-23 16:47:45,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-23 16:47:45,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-23 16:47:45,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-23 16:47:45,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-23 16:47:45,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-23 16:47:45,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-23 16:47:45,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-23 16:47:45,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-23 16:47:45,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-23 16:47:45,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-23 16:47:45,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-23 16:47:45,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-23 16:47:45,767 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-23 16:47:45,775 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-23 16:47:45,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-23 16:47:45,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-23 16:47:45,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-23 16:47:45,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-23 16:47:45,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-23 16:47:45,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-23 16:47:45,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-23 16:47:45,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-23 16:47:45,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 16:47:45,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-23 16:47:45,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-23 16:47:45,779 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-23 16:47:45,779 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-23 16:47:45,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-23 16:47:45,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-23 16:47:45,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-23 16:47:45,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-23 16:47:45,977 INFO L275 PluginConnector]: CDTParser initialized [2022-02-23 16:47:45,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-02-23 16:47:46,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae770b754/7ec7ea74249b4d2ea362585a5d1c7008/FLAGf186bf7da [2022-02-23 16:47:46,382 INFO L306 CDTParser]: Found 1 translation units. [2022-02-23 16:47:46,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-02-23 16:47:46,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae770b754/7ec7ea74249b4d2ea362585a5d1c7008/FLAGf186bf7da [2022-02-23 16:47:46,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae770b754/7ec7ea74249b4d2ea362585a5d1c7008 [2022-02-23 16:47:46,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-23 16:47:46,414 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-23 16:47:46,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-23 16:47:46,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-23 16:47:46,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-23 16:47:46,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d8975a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46, skipping insertion in model container [2022-02-23 16:47:46,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-23 16:47:46,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-23 16:47:46,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-02-23 16:47:46,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 16:47:46,571 INFO L203 MainTranslator]: Completed pre-run [2022-02-23 16:47:46,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-02-23 16:47:46,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 16:47:46,595 INFO L208 MainTranslator]: Completed translation [2022-02-23 16:47:46,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46 WrapperNode [2022-02-23 16:47:46,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-23 16:47:46,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-23 16:47:46,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-23 16:47:46,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-23 16:47:46,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-23 16:47:46,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-23 16:47:46,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-23 16:47:46,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-23 16:47:46,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 16:47:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:47:46,645 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-02-23 16:47:46,647 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-02-23 16:47:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-23 16:47:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-23 16:47:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-23 16:47:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-23 16:47:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-23 16:47:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-23 16:47:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-23 16:47:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-23 16:47:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-23 16:47:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-23 16:47:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-23 16:47:46,710 INFO L234 CfgBuilder]: Building ICFG [2022-02-23 16:47:46,711 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-23 16:47:46,801 INFO L275 CfgBuilder]: Performing block encoding [2022-02-23 16:47:46,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-23 16:47:46,806 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-23 16:47:46,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:47:46 BoogieIcfgContainer [2022-02-23 16:47:46,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-23 16:47:46,807 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-23 16:47:46,808 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-23 16:47:46,808 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-23 16:47:46,811 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:47:46" (1/1) ... [2022-02-23 16:47:46,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 04:47:46 BasicIcfg [2022-02-23 16:47:46,822 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-23 16:47:46,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-23 16:47:46,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-23 16:47:46,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-23 16:47:46,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 04:47:46" (1/4) ... [2022-02-23 16:47:46,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5678ec6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 04:47:46, skipping insertion in model container [2022-02-23 16:47:46,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:47:46" (2/4) ... [2022-02-23 16:47:46,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5678ec6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 04:47:46, skipping insertion in model container [2022-02-23 16:47:46,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:47:46" (3/4) ... [2022-02-23 16:47:46,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5678ec6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 04:47:46, skipping insertion in model container [2022-02-23 16:47:46,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 04:47:46" (4/4) ... [2022-02-23 16:47:46,827 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.cJordan [2022-02-23 16:47:46,831 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-23 16:47:46,831 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-23 16:47:46,874 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-23 16:47:46,879 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-23 16:47:46,879 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-23 16:47:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-23 16:47:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-23 16:47:46,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:46,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:46,893 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:46,897 INFO L85 PathProgramCache]: Analyzing trace with hash -414317756, now seen corresponding path program 1 times [2022-02-23 16:47:46,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:46,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89018376] [2022-02-23 16:47:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:47,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:47,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89018376] [2022-02-23 16:47:47,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89018376] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:47:47,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:47:47,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-23 16:47:47,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902797888] [2022-02-23 16:47:47,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:47:47,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-23 16:47:47,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:47,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-23 16:47:47,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-23 16:47:47,163 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-23 16:47:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:47,218 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-23 16:47:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-23 16:47:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-23 16:47:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:47,227 INFO L225 Difference]: With dead ends: 27 [2022-02-23 16:47:47,227 INFO L226 Difference]: Without dead ends: 27 [2022-02-23 16:47:47,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-02-23 16:47:47,237 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:47,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 16:47:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-23 16:47:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-23 16:47:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:47:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-23 16:47:47,265 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2022-02-23 16:47:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:47,266 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-23 16:47:47,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-23 16:47:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-23 16:47:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-23 16:47:47,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:47,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:47,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-23 16:47:47,268 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:47,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:47,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1035089572, now seen corresponding path program 1 times [2022-02-23 16:47:47,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:47,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478287740] [2022-02-23 16:47:47,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:47,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:47,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478287740] [2022-02-23 16:47:47,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478287740] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:47:47,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:47:47,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 16:47:47,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277659145] [2022-02-23 16:47:47,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:47:47,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 16:47:47,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:47,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 16:47:47,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-23 16:47:47,428 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 16:47:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:47,512 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-23 16:47:47,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-23 16:47:47,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-02-23 16:47:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:47,514 INFO L225 Difference]: With dead ends: 31 [2022-02-23 16:47:47,514 INFO L226 Difference]: Without dead ends: 31 [2022-02-23 16:47:47,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-23 16:47:47,518 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:47,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 16:47:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-23 16:47:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-02-23 16:47:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:47:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-23 16:47:47,527 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2022-02-23 16:47:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:47,529 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-23 16:47:47,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 16:47:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-23 16:47:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-23 16:47:47,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:47,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:47,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-23 16:47:47,534 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:47,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2124918270, now seen corresponding path program 1 times [2022-02-23 16:47:47,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:47,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760340539] [2022-02-23 16:47:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 16:47:47,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:47,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760340539] [2022-02-23 16:47:47,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760340539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:47:47,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:47:47,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-23 16:47:47,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268278564] [2022-02-23 16:47:47,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:47:47,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-23 16:47:47,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:47,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-23 16:47:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 16:47:47,603 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-23 16:47:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:47,676 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-23 16:47:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-23 16:47:47,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-23 16:47:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:47,681 INFO L225 Difference]: With dead ends: 33 [2022-02-23 16:47:47,681 INFO L226 Difference]: Without dead ends: 33 [2022-02-23 16:47:47,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 16:47:47,686 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:47,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 16:47:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-23 16:47:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-02-23 16:47:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:47:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-23 16:47:47,698 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-02-23 16:47:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:47,699 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-23 16:47:47,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-23 16:47:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-23 16:47:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-23 16:47:47,700 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:47,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:47,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-23 16:47:47,700 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:47,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1237414589, now seen corresponding path program 1 times [2022-02-23 16:47:47,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:47,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258677439] [2022-02-23 16:47:47,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 16:47:47,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:47,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258677439] [2022-02-23 16:47:47,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258677439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:47:47,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:47:47,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-23 16:47:47,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221439358] [2022-02-23 16:47:47,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:47:47,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-23 16:47:47,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:47,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-23 16:47:47,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-23 16:47:47,792 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 16:47:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:47,872 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-02-23 16:47:47,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-23 16:47:47,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-23 16:47:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:47,874 INFO L225 Difference]: With dead ends: 40 [2022-02-23 16:47:47,874 INFO L226 Difference]: Without dead ends: 40 [2022-02-23 16:47:47,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-23 16:47:47,878 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 89 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:47,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 36 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 16:47:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-23 16:47:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-23 16:47:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-23 16:47:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-02-23 16:47:47,890 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2022-02-23 16:47:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:47,891 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-02-23 16:47:47,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 16:47:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-02-23 16:47:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-23 16:47:47,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:47,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:47,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-23 16:47:47,892 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1236491068, now seen corresponding path program 1 times [2022-02-23 16:47:47,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:47,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157612114] [2022-02-23 16:47:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:47,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:47,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:47,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157612114] [2022-02-23 16:47:47,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157612114] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:47:47,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227982639] [2022-02-23 16:47:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:47,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:47:47,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:47:47,954 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-02-23 16:47:47,955 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-02-23 16:47:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:47,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-23 16:47:47,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:47:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:48,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:47:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:48,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227982639] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:47:48,182 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:47:48,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-23 16:47:48,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364656528] [2022-02-23 16:47:48,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:47:48,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-23 16:47:48,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-23 16:47:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-23 16:47:48,185 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 16:47:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:48,299 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-02-23 16:47:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-23 16:47:48,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2022-02-23 16:47:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:48,308 INFO L225 Difference]: With dead ends: 59 [2022-02-23 16:47:48,308 INFO L226 Difference]: Without dead ends: 59 [2022-02-23 16:47:48,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-02-23 16:47:48,309 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 69 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:48,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 28 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 16:47:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-23 16:47:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-02-23 16:47:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-23 16:47:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-02-23 16:47:48,312 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 24 [2022-02-23 16:47:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:48,313 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-23 16:47:48,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 16:47:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-02-23 16:47:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-23 16:47:48,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:48,313 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:48,332 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-02-23 16:47:48,529 WARN L452 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-02-23 16:47:48,530 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 575066086, now seen corresponding path program 2 times [2022-02-23 16:47:48,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:48,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210017152] [2022-02-23 16:47:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:48,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:48,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:48,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:48,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210017152] [2022-02-23 16:47:48,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210017152] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:47:48,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955838237] [2022-02-23 16:47:48,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 16:47:48,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:47:48,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:47:48,631 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-02-23 16:47:48,651 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-02-23 16:47:48,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 16:47:48,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:47:48,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-23 16:47:48,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:47:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-23 16:47:48,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:47:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-23 16:47:48,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955838237] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:47:48,842 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:47:48,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-02-23 16:47:48,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086175378] [2022-02-23 16:47:48,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:47:48,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-23 16:47:48,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-23 16:47:48,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-23 16:47:48,843 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-23 16:47:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:49,141 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2022-02-23 16:47:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-23 16:47:49,141 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-02-23 16:47:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:49,144 INFO L225 Difference]: With dead ends: 137 [2022-02-23 16:47:49,144 INFO L226 Difference]: Without dead ends: 137 [2022-02-23 16:47:49,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2022-02-23 16:47:49,145 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 148 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:49,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 41 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 16:47:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-23 16:47:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2022-02-23 16:47:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 113 states have internal predecessors, (152), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-23 16:47:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2022-02-23 16:47:49,164 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 33 [2022-02-23 16:47:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:49,164 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-02-23 16:47:49,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-23 16:47:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2022-02-23 16:47:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-23 16:47:49,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:49,165 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:49,182 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-02-23 16:47:49,367 WARN L452 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-02-23 16:47:49,368 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1861776890, now seen corresponding path program 1 times [2022-02-23 16:47:49,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:49,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797469014] [2022-02-23 16:47:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:49,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:49,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-23 16:47:49,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:49,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797469014] [2022-02-23 16:47:49,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797469014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:47:49,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:47:49,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-23 16:47:49,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67687278] [2022-02-23 16:47:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:47:49,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-23 16:47:49,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-23 16:47:49,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 16:47:49,428 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-23 16:47:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:49,464 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2022-02-23 16:47:49,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-23 16:47:49,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-02-23 16:47:49,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:49,466 INFO L225 Difference]: With dead ends: 169 [2022-02-23 16:47:49,466 INFO L226 Difference]: Without dead ends: 169 [2022-02-23 16:47:49,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 16:47:49,467 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:49,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 53 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 16:47:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-23 16:47:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2022-02-23 16:47:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 147 states have internal predecessors, (194), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-23 16:47:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 207 transitions. [2022-02-23 16:47:49,481 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 207 transitions. Word has length 39 [2022-02-23 16:47:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:49,481 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 207 transitions. [2022-02-23 16:47:49,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-23 16:47:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 207 transitions. [2022-02-23 16:47:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-23 16:47:49,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:49,482 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:49,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-23 16:47:49,482 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:49,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1695849177, now seen corresponding path program 1 times [2022-02-23 16:47:49,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:49,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721124409] [2022-02-23 16:47:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:49,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:49,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721124409] [2022-02-23 16:47:49,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721124409] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:47:49,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412997857] [2022-02-23 16:47:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:49,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:47:49,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:47:49,565 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-02-23 16:47:49,566 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-02-23 16:47:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:49,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-23 16:47:49,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:47:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:49,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:47:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:49,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412997857] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:47:49,953 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:47:49,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-02-23 16:47:49,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687099244] [2022-02-23 16:47:49,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:47:49,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-23 16:47:49,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:49,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-23 16:47:49,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2022-02-23 16:47:49,954 INFO L87 Difference]: Start difference. First operand 158 states and 207 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 16:47:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:50,193 INFO L93 Difference]: Finished difference Result 303 states and 400 transitions. [2022-02-23 16:47:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-23 16:47:50,194 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-02-23 16:47:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:50,195 INFO L225 Difference]: With dead ends: 303 [2022-02-23 16:47:50,195 INFO L226 Difference]: Without dead ends: 303 [2022-02-23 16:47:50,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=723, Unknown=0, NotChecked=0, Total=1122 [2022-02-23 16:47:50,196 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 121 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:50,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 36 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 16:47:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-02-23 16:47:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2022-02-23 16:47:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 290 states have (on average 1.3310344827586207) internal successors, (386), 291 states have internal predecessors, (386), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-23 16:47:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2022-02-23 16:47:50,203 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 40 [2022-02-23 16:47:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:50,203 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2022-02-23 16:47:50,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 16:47:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2022-02-23 16:47:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-23 16:47:50,205 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:50,205 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:50,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-23 16:47:50,416 WARN L452 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-02-23 16:47:50,416 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash 150253017, now seen corresponding path program 2 times [2022-02-23 16:47:50,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:50,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810377696] [2022-02-23 16:47:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:50,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:50,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:50,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:50,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810377696] [2022-02-23 16:47:50,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810377696] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:47:50,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431875670] [2022-02-23 16:47:50,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 16:47:50,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:47:50,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:47:50,625 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-02-23 16:47:50,626 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-02-23 16:47:50,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 16:47:50,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:47:50,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 16:47:50,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:47:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-02-23 16:47:50,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:47:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-02-23 16:47:51,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431875670] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:47:51,030 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:47:51,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 26 [2022-02-23 16:47:51,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714045271] [2022-02-23 16:47:51,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:47:51,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-23 16:47:51,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-23 16:47:51,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2022-02-23 16:47:51,032 INFO L87 Difference]: Start difference. First operand 302 states and 399 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 16:47:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:51,953 INFO L93 Difference]: Finished difference Result 1111 states and 1458 transitions. [2022-02-23 16:47:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-23 16:47:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 64 [2022-02-23 16:47:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:51,957 INFO L225 Difference]: With dead ends: 1111 [2022-02-23 16:47:51,957 INFO L226 Difference]: Without dead ends: 1111 [2022-02-23 16:47:51,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1752, Invalid=4568, Unknown=0, NotChecked=0, Total=6320 [2022-02-23 16:47:51,959 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 616 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:51,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 38 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-23 16:47:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-02-23 16:47:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 482. [2022-02-23 16:47:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 464 states have (on average 1.331896551724138) internal successors, (618), 465 states have internal predecessors, (618), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-23 16:47:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 639 transitions. [2022-02-23 16:47:51,969 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 639 transitions. Word has length 64 [2022-02-23 16:47:51,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:51,969 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 639 transitions. [2022-02-23 16:47:51,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 16:47:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 639 transitions. [2022-02-23 16:47:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-23 16:47:51,970 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:51,970 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:51,988 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-02-23 16:47:52,178 WARN L452 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-02-23 16:47:52,179 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash -110856328, now seen corresponding path program 1 times [2022-02-23 16:47:52,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:52,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601177109] [2022-02-23 16:47:52,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:52,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:52,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601177109] [2022-02-23 16:47:52,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601177109] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:47:52,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826002264] [2022-02-23 16:47:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:52,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:47:52,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:47:52,376 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-02-23 16:47:52,377 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-02-23 16:47:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:52,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-23 16:47:52,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:47:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:52,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:47:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:53,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826002264] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:47:53,032 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:47:53,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-02-23 16:47:53,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740400534] [2022-02-23 16:47:53,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:47:53,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-23 16:47:53,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:53,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-23 16:47:53,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=1058, Unknown=0, NotChecked=0, Total=1722 [2022-02-23 16:47:53,034 INFO L87 Difference]: Start difference. First operand 482 states and 639 transitions. Second operand has 42 states, 42 states have (on average 3.1666666666666665) internal successors, (133), 41 states have internal predecessors, (133), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 16:47:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:53,259 INFO L93 Difference]: Finished difference Result 1633 states and 2144 transitions. [2022-02-23 16:47:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-23 16:47:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.1666666666666665) internal successors, (133), 41 states have internal predecessors, (133), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 70 [2022-02-23 16:47:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:53,263 INFO L225 Difference]: With dead ends: 1633 [2022-02-23 16:47:53,263 INFO L226 Difference]: Without dead ends: 1633 [2022-02-23 16:47:53,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=744, Invalid=1326, Unknown=0, NotChecked=0, Total=2070 [2022-02-23 16:47:53,264 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 212 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:53,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 32 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 16:47:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-02-23 16:47:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 590. [2022-02-23 16:47:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 572 states have (on average 1.3251748251748252) internal successors, (758), 573 states have internal predecessors, (758), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-23 16:47:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 779 transitions. [2022-02-23 16:47:53,277 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 779 transitions. Word has length 70 [2022-02-23 16:47:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:53,277 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 779 transitions. [2022-02-23 16:47:53,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.1666666666666665) internal successors, (133), 41 states have internal predecessors, (133), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 16:47:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 779 transitions. [2022-02-23 16:47:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-23 16:47:53,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:53,278 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:53,296 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-02-23 16:47:53,487 WARN L452 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-02-23 16:47:53,487 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash 906232056, now seen corresponding path program 2 times [2022-02-23 16:47:53,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:53,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952821947] [2022-02-23 16:47:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:53,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:53,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952821947] [2022-02-23 16:47:53,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952821947] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:47:53,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302340999] [2022-02-23 16:47:53,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 16:47:53,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:47:53,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:47:53,974 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-02-23 16:47:53,975 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-02-23 16:47:54,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 16:47:54,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:47:54,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 16:47:54,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:47:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-02-23 16:47:54,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 16:47:54,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302340999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:47:54,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-23 16:47:54,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [30] total 34 [2022-02-23 16:47:54,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276974313] [2022-02-23 16:47:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:47:54,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-23 16:47:54,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-23 16:47:54,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=841, Unknown=0, NotChecked=0, Total=1122 [2022-02-23 16:47:54,174 INFO L87 Difference]: Start difference. First operand 590 states and 779 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-23 16:47:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:54,215 INFO L93 Difference]: Finished difference Result 453 states and 593 transitions. [2022-02-23 16:47:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-23 16:47:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2022-02-23 16:47:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:54,217 INFO L225 Difference]: With dead ends: 453 [2022-02-23 16:47:54,217 INFO L226 Difference]: Without dead ends: 453 [2022-02-23 16:47:54,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2022-02-23 16:47:54,218 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:54,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 71 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 16:47:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-02-23 16:47:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2022-02-23 16:47:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 437 states have (on average 1.3157894736842106) internal successors, (575), 438 states have internal predecessors, (575), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-23 16:47:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 592 transitions. [2022-02-23 16:47:54,229 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 592 transitions. Word has length 82 [2022-02-23 16:47:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:54,230 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 592 transitions. [2022-02-23 16:47:54,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-23 16:47:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 592 transitions. [2022-02-23 16:47:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-23 16:47:54,230 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:54,230 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:54,259 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-02-23 16:47:54,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:47:54,452 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:47:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:47:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash -764281513, now seen corresponding path program 1 times [2022-02-23 16:47:54,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:47:54,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796259981] [2022-02-23 16:47:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:47:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:47:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:47:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:54,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:47:54,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796259981] [2022-02-23 16:47:54,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796259981] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:47:54,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081373476] [2022-02-23 16:47:54,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:47:54,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:47:54,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:47:54,919 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-02-23 16:47:54,934 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-02-23 16:47:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:47:54,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-23 16:47:54,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:47:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:55,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:47:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:47:57,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081373476] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:47:57,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:47:57,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 77 [2022-02-23 16:47:57,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388043113] [2022-02-23 16:47:57,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:47:57,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-02-23 16:47:57,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:47:57,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-02-23 16:47:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1581, Invalid=4271, Unknown=0, NotChecked=0, Total=5852 [2022-02-23 16:47:57,650 INFO L87 Difference]: Start difference. First operand 452 states and 592 transitions. Second operand has 77 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 74 states have internal predecessors, (212), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 16:47:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:47:59,819 INFO L93 Difference]: Finished difference Result 907 states and 1205 transitions. [2022-02-23 16:47:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-02-23 16:47:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 74 states have internal predecessors, (212), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 82 [2022-02-23 16:47:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:47:59,822 INFO L225 Difference]: With dead ends: 907 [2022-02-23 16:47:59,822 INFO L226 Difference]: Without dead ends: 907 [2022-02-23 16:47:59,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6247 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3458, Invalid=12544, Unknown=0, NotChecked=0, Total=16002 [2022-02-23 16:47:59,826 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 650 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-23 16:47:59,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 69 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-23 16:47:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-02-23 16:47:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 862. [2022-02-23 16:47:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 835 states have (on average 1.3269461077844311) internal successors, (1108), 841 states have internal predecessors, (1108), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (17), 11 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-23 16:47:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1143 transitions. [2022-02-23 16:47:59,841 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1143 transitions. Word has length 82 [2022-02-23 16:47:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:47:59,842 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1143 transitions. [2022-02-23 16:47:59,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 74 states have internal predecessors, (212), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 16:47:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1143 transitions. [2022-02-23 16:47:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-23 16:47:59,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:47:59,842 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:47:59,861 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-02-23 16:48:00,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:48:00,061 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:48:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:48:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2101920920, now seen corresponding path program 1 times [2022-02-23 16:48:00,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:48:00,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139716420] [2022-02-23 16:48:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:48:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:48:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:00,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:48:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:00,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:48:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-02-23 16:48:00,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:48:00,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139716420] [2022-02-23 16:48:00,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139716420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:48:00,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:48:00,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-23 16:48:00,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533507828] [2022-02-23 16:48:00,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:48:00,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-23 16:48:00,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:48:00,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-23 16:48:00,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-23 16:48:00,124 INFO L87 Difference]: Start difference. First operand 862 states and 1143 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 16:48:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:48:00,183 INFO L93 Difference]: Finished difference Result 1103 states and 1466 transitions. [2022-02-23 16:48:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-23 16:48:00,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2022-02-23 16:48:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:48:00,189 INFO L225 Difference]: With dead ends: 1103 [2022-02-23 16:48:00,189 INFO L226 Difference]: Without dead ends: 1103 [2022-02-23 16:48:00,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-23 16:48:00,190 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 80 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:48:00,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 42 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 16:48:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-02-23 16:48:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 937. [2022-02-23 16:48:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 908 states have (on average 1.327092511013216) internal successors, (1205), 915 states have internal predecessors, (1205), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (19), 12 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-23 16:48:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1244 transitions. [2022-02-23 16:48:00,212 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1244 transitions. Word has length 82 [2022-02-23 16:48:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:48:00,212 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1244 transitions. [2022-02-23 16:48:00,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 16:48:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1244 transitions. [2022-02-23 16:48:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-02-23 16:48:00,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:48:00,214 INFO L514 BasicCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:48:00,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-23 16:48:00,214 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:48:00,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:48:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1670302378, now seen corresponding path program 1 times [2022-02-23 16:48:00,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:48:00,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547127600] [2022-02-23 16:48:00,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:48:00,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:48:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:00,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:48:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:48:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-23 16:48:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-02-23 16:48:00,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:48:00,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547127600] [2022-02-23 16:48:00,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547127600] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:48:00,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665891621] [2022-02-23 16:48:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:48:00,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:48:00,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:48:00,328 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-02-23 16:48:00,359 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-02-23 16:48:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:00,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 16:48:00,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:48:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-02-23 16:48:00,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:48:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-02-23 16:48:01,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665891621] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:48:01,242 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:48:01,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-02-23 16:48:01,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188136322] [2022-02-23 16:48:01,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:48:01,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-23 16:48:01,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:48:01,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-23 16:48:01,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-02-23 16:48:01,243 INFO L87 Difference]: Start difference. First operand 937 states and 1244 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-23 16:48:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:48:01,368 INFO L93 Difference]: Finished difference Result 2067 states and 2758 transitions. [2022-02-23 16:48:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-23 16:48:01,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 153 [2022-02-23 16:48:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:48:01,376 INFO L225 Difference]: With dead ends: 2067 [2022-02-23 16:48:01,376 INFO L226 Difference]: Without dead ends: 2067 [2022-02-23 16:48:01,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2022-02-23 16:48:01,377 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 208 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:48:01,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 73 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 16:48:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-02-23 16:48:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1237. [2022-02-23 16:48:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1200 states have (on average 1.3275) internal successors, (1593), 1211 states have internal predecessors, (1593), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (27), 16 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-23 16:48:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2022-02-23 16:48:01,400 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 153 [2022-02-23 16:48:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:48:01,401 INFO L470 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2022-02-23 16:48:01,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-23 16:48:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2022-02-23 16:48:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-23 16:48:01,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:48:01,402 INFO L514 BasicCegarLoop]: trace histogram [41, 41, 39, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:48:01,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-23 16:48:01,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-23 16:48:01,615 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:48:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:48:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1910464549, now seen corresponding path program 1 times [2022-02-23 16:48:01,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:48:01,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189253925] [2022-02-23 16:48:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:48:01,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:48:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:01,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:48:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:48:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-23 16:48:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 722 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-02-23 16:48:01,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:48:01,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189253925] [2022-02-23 16:48:01,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189253925] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:48:01,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121673641] [2022-02-23 16:48:01,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:48:01,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:48:01,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:48:01,870 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-02-23 16:48:01,872 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-02-23 16:48:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:01,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-23 16:48:01,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:48:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 1960 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-02-23 16:48:02,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 16:48:02,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121673641] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:48:02,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-23 16:48:02,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [25] total 46 [2022-02-23 16:48:02,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960742096] [2022-02-23 16:48:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:48:02,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-23 16:48:02,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:48:02,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-23 16:48:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=1348, Unknown=0, NotChecked=0, Total=2070 [2022-02-23 16:48:02,692 INFO L87 Difference]: Start difference. First operand 1237 states and 1648 transitions. Second operand has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 16:48:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:48:02,873 INFO L93 Difference]: Finished difference Result 1141 states and 1483 transitions. [2022-02-23 16:48:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-23 16:48:02,873 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 156 [2022-02-23 16:48:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:48:02,876 INFO L225 Difference]: With dead ends: 1141 [2022-02-23 16:48:02,876 INFO L226 Difference]: Without dead ends: 928 [2022-02-23 16:48:02,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=722, Invalid=1348, Unknown=0, NotChecked=0, Total=2070 [2022-02-23 16:48:02,879 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-23 16:48:02,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 54 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-23 16:48:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-02-23 16:48:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 866. [2022-02-23 16:48:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 842 states have (on average 1.165083135391924) internal successors, (981), 843 states have internal predecessors, (981), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-23 16:48:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1010 transitions. [2022-02-23 16:48:02,894 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1010 transitions. Word has length 156 [2022-02-23 16:48:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:48:02,896 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1010 transitions. [2022-02-23 16:48:02,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 16:48:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1010 transitions. [2022-02-23 16:48:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-02-23 16:48:02,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:48:02,902 INFO L514 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:48:02,942 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-02-23 16:48:03,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-23 16:48:03,119 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:48:03,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:48:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1004247254, now seen corresponding path program 2 times [2022-02-23 16:48:03,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:48:03,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110755220] [2022-02-23 16:48:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:48:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:48:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:03,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:48:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:48:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-23 16:48:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-02-23 16:48:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:03,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-02-23 16:48:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-02-23 16:48:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-02-23 16:48:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-02-23 16:48:03,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:48:03,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110755220] [2022-02-23 16:48:03,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110755220] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:48:03,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666518323] [2022-02-23 16:48:03,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 16:48:03,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:48:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:48:03,307 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-02-23 16:48:03,308 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-02-23 16:48:03,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 16:48:03,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:48:03,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-23 16:48:03,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:48:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-02-23 16:48:04,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:48:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-02-23 16:48:05,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666518323] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:48:05,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:48:05,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-02-23 16:48:05,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211656617] [2022-02-23 16:48:05,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:48:05,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-23 16:48:05,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:48:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-23 16:48:05,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2022-02-23 16:48:05,590 INFO L87 Difference]: Start difference. First operand 866 states and 1010 transitions. Second operand has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 19 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 17 states have call predecessors, (20), 18 states have call successors, (20) [2022-02-23 16:48:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:48:05,866 INFO L93 Difference]: Finished difference Result 2570 states and 3234 transitions. [2022-02-23 16:48:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-23 16:48:05,867 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 19 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 17 states have call predecessors, (20), 18 states have call successors, (20) Word has length 437 [2022-02-23 16:48:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:48:05,870 INFO L225 Difference]: With dead ends: 2570 [2022-02-23 16:48:05,870 INFO L226 Difference]: Without dead ends: 1402 [2022-02-23 16:48:05,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=723, Unknown=0, NotChecked=0, Total=1122 [2022-02-23 16:48:05,871 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 411 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-23 16:48:05,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 146 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-23 16:48:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-02-23 16:48:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2022-02-23 16:48:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1370 states have (on average 1.1072992700729927) internal successors, (1517), 1371 states have internal predecessors, (1517), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-23 16:48:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1562 transitions. [2022-02-23 16:48:05,889 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1562 transitions. Word has length 437 [2022-02-23 16:48:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:48:05,890 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 1562 transitions. [2022-02-23 16:48:05,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 19 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 17 states have call predecessors, (20), 18 states have call successors, (20) [2022-02-23 16:48:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1562 transitions. [2022-02-23 16:48:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2022-02-23 16:48:05,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:48:05,905 INFO L514 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:48:05,933 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-02-23 16:48:06,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-23 16:48:06,112 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:48:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:48:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1775263786, now seen corresponding path program 3 times [2022-02-23 16:48:06,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:48:06,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897322916] [2022-02-23 16:48:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:48:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:48:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:48:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 16:48:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-23 16:48:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-02-23 16:48:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-02-23 16:48:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-02-23 16:48:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-02-23 16:48:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-02-23 16:48:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2022-02-23 16:48:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2022-02-23 16:48:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2022-02-23 16:48:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2022-02-23 16:48:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2022-02-23 16:48:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2022-02-23 16:48:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2022-02-23 16:48:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:48:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-02-23 16:48:06,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:48:06,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897322916] [2022-02-23 16:48:06,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897322916] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:48:06,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269118983] [2022-02-23 16:48:06,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 16:48:06,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:48:06,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:48:06,582 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 16:48:06,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-23 16:48:06,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2022-02-23 16:48:06,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:48:06,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-23 16:48:06,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:48:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-02-23 16:48:09,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:48:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-02-23 16:48:11,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269118983] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:48:11,325 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:48:11,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 40 [2022-02-23 16:48:11,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331499318] [2022-02-23 16:48:11,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:48:11,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-23 16:48:11,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:48:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-23 16:48:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=946, Unknown=0, NotChecked=0, Total=1560 [2022-02-23 16:48:11,328 INFO L87 Difference]: Start difference. First operand 1402 states and 1562 transitions. Second operand has 40 states, 40 states have (on average 8.075) internal successors, (323), 39 states have internal predecessors, (323), 35 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 34 states have call successors, (36) [2022-02-23 16:48:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:48:11,653 INFO L93 Difference]: Finished difference Result 2680 states and 3230 transitions. [2022-02-23 16:48:11,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-23 16:48:11,653 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 8.075) internal successors, (323), 39 states have internal predecessors, (323), 35 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 34 states have call successors, (36) Word has length 1005 [2022-02-23 16:48:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:48:11,658 INFO L225 Difference]: With dead ends: 2680 [2022-02-23 16:48:11,659 INFO L226 Difference]: Without dead ends: 1804 [2022-02-23 16:48:11,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2063 GetRequests, 2018 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=744, Invalid=1326, Unknown=0, NotChecked=0, Total=2070 [2022-02-23 16:48:11,659 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 580 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-23 16:48:11,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 207 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-23 16:48:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-02-23 16:48:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2022-02-23 16:48:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1766 states have (on average 1.0866364665911665) internal successors, (1919), 1767 states have internal predecessors, (1919), 29 states have call successors, (29), 9 states have call predecessors, (29), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-23 16:48:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 1976 transitions. [2022-02-23 16:48:11,679 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 1976 transitions. Word has length 1005 [2022-02-23 16:48:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:48:11,680 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 1976 transitions. [2022-02-23 16:48:11,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.075) internal successors, (323), 39 states have internal predecessors, (323), 35 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 34 states have call successors, (36) [2022-02-23 16:48:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 1976 transitions. [2022-02-23 16:48:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2022-02-23 16:48:11,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:48:11,733 INFO L514 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:48:11,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-23 16:48:11,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-23 16:48:11,945 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:48:11,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:48:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 942669078, now seen corresponding path program 4 times [2022-02-23 16:48:11,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:48:11,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809596789] [2022-02-23 16:48:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:48:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:48:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-23 16:48:12,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-23 16:48:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-23 16:48:12,899 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-23 16:48:12,899 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-23 16:48:12,899 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-23 16:48:12,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-23 16:48:12,902 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:48:12,905 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-23 16:48:13,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 04:48:13 BasicIcfg [2022-02-23 16:48:13,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-23 16:48:13,061 INFO L158 Benchmark]: Toolchain (without parser) took 26646.82ms. Allocated memory was 201.3MB in the beginning and 355.5MB in the end (delta: 154.1MB). Free memory was 146.0MB in the beginning and 224.5MB in the end (delta: -78.5MB). Peak memory consumption was 193.4MB. Max. memory is 8.0GB. [2022-02-23 16:48:13,061 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-23 16:48:13,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.30ms. Allocated memory is still 201.3MB. Free memory was 145.7MB in the beginning and 170.7MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-23 16:48:13,061 INFO L158 Benchmark]: Boogie Preprocessor took 23.18ms. Allocated memory is still 201.3MB. Free memory was 170.7MB in the beginning and 169.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-23 16:48:13,061 INFO L158 Benchmark]: RCFGBuilder took 186.87ms. Allocated memory is still 201.3MB. Free memory was 169.5MB in the beginning and 158.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-23 16:48:13,061 INFO L158 Benchmark]: IcfgTransformer took 14.65ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 157.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-23 16:48:13,062 INFO L158 Benchmark]: TraceAbstraction took 26237.20ms. Allocated memory was 201.3MB in the beginning and 355.5MB in the end (delta: 154.1MB). Free memory was 157.1MB in the beginning and 224.5MB in the end (delta: -67.4MB). Peak memory consumption was 205.1MB. Max. memory is 8.0GB. [2022-02-23 16:48:13,062 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.10ms. Allocated memory is still 201.3MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.30ms. Allocated memory is still 201.3MB. Free memory was 145.7MB in the beginning and 170.7MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.18ms. Allocated memory is still 201.3MB. Free memory was 170.7MB in the beginning and 169.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 186.87ms. Allocated memory is still 201.3MB. Free memory was 169.5MB in the beginning and 158.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 14.65ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 157.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 26237.20ms. Allocated memory was 201.3MB in the beginning and 355.5MB in the end (delta: 154.1MB). Free memory was 157.1MB in the beginning and 224.5MB in the end (delta: -67.4MB). Peak memory consumption was 205.1MB. 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 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [\old(last)=50, \old(SIZE)=51, last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L6] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L21] RET assume_abort_if_not(last > 0) VAL [\old(last)=0, last=21, SIZE=20] [L22] int a=0,b=0,c=0,st=0,d=0; VAL [\old(last)=0, 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 [\old(last)=0, a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=20, d=0, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, 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 [\old(last)=0, a=0, b=1, c=20, d=20, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=0, \old(last)=0, last=21, SIZE=20] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(last)=0, cond=0, last=21, SIZE=20] [L12] reach_error() VAL [\old(cond)=0, \old(last)=0, cond=0, last=21, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3346 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3321 mSDsluCounter, 1030 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 612 mSDsCounter, 814 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3120 IncrementalHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 814 mSolverCounterUnsat, 418 mSDtfsCounter, 3120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4521 GetRequests, 4008 SyntacticMatches, 6 SemanticMatches, 507 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10995 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1804occurred in iteration=17, InterpolantAutomatonStates: 327, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2809 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 5934 NumberOfCodeBlocks, 5469 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 6374 ConstructedInterpolants, 0 QuantifiedInterpolants, 35321 SizeOfPredicates, 29 NumberOfNonLiveVariables, 3501 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 37 InterpolantComputations, 8 PerfectInterpolantSequences, 45824/451303 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 proved your program to be incorrect! [2022-02-23 16:48:13,088 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...