/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-6c470ae [2022-02-14 21:30:37,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:30:37,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:30:37,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:30:37,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:30:37,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:30:37,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:30:37,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:30:37,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:30:37,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:30:37,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:30:37,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:30:37,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:30:37,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:30:37,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:30:37,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:30:37,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:30:37,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:30:37,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:30:37,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:30:37,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:30:37,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:30:37,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:30:37,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:30:37,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:30:37,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:30:37,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:30:37,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:30:37,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:30:37,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:30:37,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:30:37,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:30:37,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:30:37,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:30:37,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:30:37,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:30:37,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:30:37,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:30:37,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:30:37,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:30:37,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:30:37,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:30:37,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:30:37,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:30:37,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:30:37,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:30:37,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:30:37,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:30:37,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:30:37,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:30:37,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:30:37,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:30:37,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:30:37,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:30:37,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:30:37,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:30:37,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:30:37,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:30:37,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:30:37,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:30:37,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:30:37,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:30:37,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:30:37,761 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:30:37,761 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-14 21:30:37,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:30:37,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:30:37,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:30:37,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:30:37,926 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:30:37,927 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-14 21:30:37,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89778e5eb/5961b27cea30457c8d2f6e8cd4f9fa82/FLAG42dfa2617 [2022-02-14 21:30:38,352 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:30:38,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-02-14 21:30:38,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89778e5eb/5961b27cea30457c8d2f6e8cd4f9fa82/FLAG42dfa2617 [2022-02-14 21:30:38,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89778e5eb/5961b27cea30457c8d2f6e8cd4f9fa82 [2022-02-14 21:30:38,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:30:38,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:30:38,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:30:38,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:30:38,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:30:38,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38, skipping insertion in model container [2022-02-14 21:30:38,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:30:38,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:30:38,511 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-14 21:30:38,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:30:38,547 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:30:38,554 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-14 21:30:38,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:30:38,565 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:30:38,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38 WrapperNode [2022-02-14 21:30:38,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:30:38,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:30:38,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:30:38,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:30:38,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:30:38,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:30:38,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:30:38,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:30:38,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:30:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:38,608 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-14 21:30:38,635 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-14 21:30:38,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:30:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:30:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:30:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-14 21:30:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:30:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:30:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:30:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:30:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:30:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:30:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-14 21:30:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-14 21:30:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:30:38,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:30:38,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:30:38,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:30:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:30:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:30:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:30:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:30:38,694 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:30:38,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:30:38,794 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:30:38,798 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:30:38,798 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-14 21:30:38,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:30:38 BoogieIcfgContainer [2022-02-14 21:30:38,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:30:38,799 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:30:38,800 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:30:38,801 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:30:38,803 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:30:38" (1/1) ... [2022-02-14 21:30:38,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:30:38 BasicIcfg [2022-02-14 21:30:38,817 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:30:38,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:30:38,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:30:38,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:30:38,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:30:38" (1/4) ... [2022-02-14 21:30:38,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315d027e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:30:38, skipping insertion in model container [2022-02-14 21:30:38,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:30:38" (2/4) ... [2022-02-14 21:30:38,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315d027e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:30:38, skipping insertion in model container [2022-02-14 21:30:38,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:30:38" (3/4) ... [2022-02-14 21:30:38,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315d027e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:30:38, skipping insertion in model container [2022-02-14 21:30:38,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:30:38" (4/4) ... [2022-02-14 21:30:38,832 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.cJordan [2022-02-14 21:30:38,836 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:30:38,836 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:30:38,880 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:30:38,885 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-14 21:30:38,885 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:30:38,897 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-14 21:30:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-14 21:30:38,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:38,902 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-14 21:30:38,902 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash -414317756, now seen corresponding path program 1 times [2022-02-14 21:30:38,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:38,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800812500] [2022-02-14 21:30:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:38,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,053 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-14 21:30:39,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:39,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800812500] [2022-02-14 21:30:39,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800812500] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:30:39,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:30:39,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:30:39,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456318164] [2022-02-14 21:30:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:30:39,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:30:39,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:39,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:30:39,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:30:39,080 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-14 21:30:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:39,116 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-14 21:30:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:30:39,118 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-14 21:30:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:39,122 INFO L225 Difference]: With dead ends: 27 [2022-02-14 21:30:39,122 INFO L226 Difference]: Without dead ends: 27 [2022-02-14 21:30:39,124 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-14 21:30:39,126 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-14 21:30:39,126 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-14 21:30:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-14 21:30:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-14 21:30:39,144 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-14 21:30:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-14 21:30:39,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2022-02-14 21:30:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:39,146 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-14 21:30:39,146 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-14 21:30:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-14 21:30:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-14 21:30:39,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:39,147 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-14 21:30:39,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:30:39,147 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1035089572, now seen corresponding path program 1 times [2022-02-14 21:30:39,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:39,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552664164] [2022-02-14 21:30:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,253 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-14 21:30:39,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:39,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552664164] [2022-02-14 21:30:39,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552664164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:30:39,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:30:39,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 21:30:39,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302151516] [2022-02-14 21:30:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:30:39,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 21:30:39,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 21:30:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-14 21:30:39,255 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-14 21:30:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:39,337 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-14 21:30:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:30:39,338 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-14 21:30:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:39,339 INFO L225 Difference]: With dead ends: 31 [2022-02-14 21:30:39,339 INFO L226 Difference]: Without dead ends: 31 [2022-02-14 21:30:39,343 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-14 21:30:39,345 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-14 21:30:39,345 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-14 21:30:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-14 21:30:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-02-14 21:30:39,352 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-14 21:30:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-14 21:30:39,354 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2022-02-14 21:30:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:39,355 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-14 21:30:39,355 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-14 21:30:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-14 21:30:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-14 21:30:39,356 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:39,356 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-14 21:30:39,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:30:39,356 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:39,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2124918270, now seen corresponding path program 1 times [2022-02-14 21:30:39,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:39,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702713999] [2022-02-14 21:30:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:39,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,401 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-14 21:30:39,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:39,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702713999] [2022-02-14 21:30:39,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702713999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:30:39,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:30:39,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 21:30:39,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325270277] [2022-02-14 21:30:39,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:30:39,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-14 21:30:39,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:39,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-14 21:30:39,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-14 21:30:39,403 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-14 21:30:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:39,455 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-14 21:30:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-14 21:30:39,457 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-14 21:30:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:39,460 INFO L225 Difference]: With dead ends: 33 [2022-02-14 21:30:39,461 INFO L226 Difference]: Without dead ends: 33 [2022-02-14 21:30:39,462 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-14 21:30:39,466 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:30:39,468 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.0s Time] [2022-02-14 21:30:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-14 21:30:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-02-14 21:30:39,476 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-14 21:30:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-14 21:30:39,477 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-02-14 21:30:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:39,478 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-14 21:30:39,478 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-14 21:30:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-14 21:30:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-14 21:30:39,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:39,479 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-14 21:30:39,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-14 21:30:39,479 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1237414589, now seen corresponding path program 1 times [2022-02-14 21:30:39,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:39,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357989860] [2022-02-14 21:30:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,569 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-14 21:30:39,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:39,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357989860] [2022-02-14 21:30:39,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357989860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:30:39,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:30:39,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 21:30:39,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067437864] [2022-02-14 21:30:39,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:30:39,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:30:39,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:39,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:30:39,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:30:39,571 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-14 21:30:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:39,636 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-02-14 21:30:39,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:30:39,637 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-14 21:30:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:39,638 INFO L225 Difference]: With dead ends: 40 [2022-02-14 21:30:39,638 INFO L226 Difference]: Without dead ends: 40 [2022-02-14 21:30:39,638 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-14 21:30:39,642 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.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:30:39,643 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.0s Time] [2022-02-14 21:30:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-14 21:30:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-14 21:30:39,650 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-14 21:30:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-02-14 21:30:39,653 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2022-02-14 21:30:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:39,654 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-02-14 21:30:39,654 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-14 21:30:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-02-14 21:30:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-14 21:30:39,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:39,655 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-14 21:30:39,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-14 21:30:39,656 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:39,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1236491068, now seen corresponding path program 1 times [2022-02-14 21:30:39,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:39,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236548253] [2022-02-14 21:30:39,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:39,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,732 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-14 21:30:39,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:39,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236548253] [2022-02-14 21:30:39,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236548253] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:39,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322229824] [2022-02-14 21:30:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:39,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:39,736 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-14 21:30:39,737 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-14 21:30:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:39,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-14 21:30:39,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:39,913 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-14 21:30:39,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:30:39,990 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-14 21:30:39,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322229824] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:39,990 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:39,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-14 21:30:39,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53899653] [2022-02-14 21:30:39,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:39,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-14 21:30:39,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:39,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-14 21:30:39,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-14 21:30:39,991 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-14 21:30:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:40,073 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-02-14 21:30:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:30:40,074 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-14 21:30:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:40,074 INFO L225 Difference]: With dead ends: 59 [2022-02-14 21:30:40,074 INFO L226 Difference]: Without dead ends: 59 [2022-02-14 21:30:40,075 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-14 21:30:40,075 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 69 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-14 21:30:40,075 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-14 21:30:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-14 21:30:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-02-14 21:30:40,078 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-14 21:30:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-02-14 21:30:40,079 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 24 [2022-02-14 21:30:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:40,079 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-14 21:30:40,079 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-14 21:30:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-02-14 21:30:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-14 21:30:40,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:40,080 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-14 21:30:40,099 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-14 21:30:40,290 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-14 21:30:40,290 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 575066086, now seen corresponding path program 2 times [2022-02-14 21:30:40,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:40,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305933840] [2022-02-14 21:30:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:40,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:40,400 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-14 21:30:40,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:40,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305933840] [2022-02-14 21:30:40,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305933840] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:40,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250105807] [2022-02-14 21:30:40,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:30:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:40,402 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-14 21:30:40,403 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-14 21:30:40,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:30:40,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:30:40,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-14 21:30:40,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:40,515 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-14 21:30:40,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:30:40,573 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-14 21:30:40,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250105807] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:40,573 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:40,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-02-14 21:30:40,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518325677] [2022-02-14 21:30:40,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:40,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-14 21:30:40,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-14 21:30:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-14 21:30:40,575 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-14 21:30:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:40,842 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2022-02-14 21:30:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-14 21:30:40,843 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-14 21:30:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:40,844 INFO L225 Difference]: With dead ends: 137 [2022-02-14 21:30:40,844 INFO L226 Difference]: Without dead ends: 137 [2022-02-14 21:30:40,844 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-14 21:30:40,844 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-14 21:30:40,845 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-14 21:30:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-14 21:30:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2022-02-14 21:30:40,857 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-14 21:30:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2022-02-14 21:30:40,858 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 33 [2022-02-14 21:30:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:40,858 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-02-14 21:30:40,858 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-14 21:30:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2022-02-14 21:30:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-14 21:30:40,859 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:40,859 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-14 21:30:40,877 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-14 21:30:41,059 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-14 21:30:41,060 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1861776890, now seen corresponding path program 1 times [2022-02-14 21:30:41,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:41,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890616976] [2022-02-14 21:30:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:41,109 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-14 21:30:41,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:41,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890616976] [2022-02-14 21:30:41,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890616976] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:30:41,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:30:41,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 21:30:41,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849235467] [2022-02-14 21:30:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:30:41,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-14 21:30:41,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:41,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-14 21:30:41,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-14 21:30:41,111 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-14 21:30:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:41,147 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2022-02-14 21:30:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-14 21:30:41,147 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-14 21:30:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:41,155 INFO L225 Difference]: With dead ends: 169 [2022-02-14 21:30:41,155 INFO L226 Difference]: Without dead ends: 169 [2022-02-14 21:30:41,155 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-14 21:30:41,156 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-14 21:30:41,156 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-14 21:30:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-14 21:30:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2022-02-14 21:30:41,162 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-14 21:30:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 207 transitions. [2022-02-14 21:30:41,163 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 207 transitions. Word has length 39 [2022-02-14 21:30:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:41,163 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 207 transitions. [2022-02-14 21:30:41,163 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-14 21:30:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 207 transitions. [2022-02-14 21:30:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-14 21:30:41,164 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:41,164 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-14 21:30:41,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-14 21:30:41,164 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1695849177, now seen corresponding path program 1 times [2022-02-14 21:30:41,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:41,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302270184] [2022-02-14 21:30:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:41,240 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-14 21:30:41,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:41,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302270184] [2022-02-14 21:30:41,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302270184] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:41,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967527786] [2022-02-14 21:30:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:41,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:41,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:41,244 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-14 21:30:41,244 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-14 21:30:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:41,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:30:41,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:41,446 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-14 21:30:41,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:30:41,590 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-14 21:30:41,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967527786] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:41,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:41,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-02-14 21:30:41,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669982208] [2022-02-14 21:30:41,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:41,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-14 21:30:41,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:41,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-14 21:30:41,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2022-02-14 21:30:41,592 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-14 21:30:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:41,793 INFO L93 Difference]: Finished difference Result 303 states and 400 transitions. [2022-02-14 21:30:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-14 21:30:41,793 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-14 21:30:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:41,795 INFO L225 Difference]: With dead ends: 303 [2022-02-14 21:30:41,795 INFO L226 Difference]: Without dead ends: 303 [2022-02-14 21:30:41,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 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-14 21:30:41,795 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-14 21:30:41,796 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-14 21:30:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-02-14 21:30:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2022-02-14 21:30:41,802 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-14 21:30:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2022-02-14 21:30:41,804 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 40 [2022-02-14 21:30:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:41,804 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2022-02-14 21:30:41,804 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-14 21:30:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2022-02-14 21:30:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-14 21:30:41,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:41,805 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-14 21:30:41,821 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-14 21:30:42,022 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-14 21:30:42,022 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash 150253017, now seen corresponding path program 2 times [2022-02-14 21:30:42,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:42,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453957844] [2022-02-14 21:30:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:42,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:42,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:42,235 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-14 21:30:42,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:42,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453957844] [2022-02-14 21:30:42,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453957844] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:42,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292490688] [2022-02-14 21:30:42,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:30:42,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:42,237 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-14 21:30:42,238 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-14 21:30:42,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:30:42,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:30:42,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-14 21:30:42,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:42,461 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-14 21:30:42,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:30:42,602 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-14 21:30:42,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292490688] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:42,602 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:42,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 26 [2022-02-14 21:30:42,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868298429] [2022-02-14 21:30:42,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:42,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-14 21:30:42,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-14 21:30:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2022-02-14 21:30:42,604 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-14 21:30:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:43,542 INFO L93 Difference]: Finished difference Result 1111 states and 1458 transitions. [2022-02-14 21:30:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-14 21:30:43,542 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-14 21:30:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:43,545 INFO L225 Difference]: With dead ends: 1111 [2022-02-14 21:30:43,545 INFO L226 Difference]: Without dead ends: 1111 [2022-02-14 21:30:43,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1752, Invalid=4568, Unknown=0, NotChecked=0, Total=6320 [2022-02-14 21:30:43,548 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-14 21:30:43,548 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-14 21:30:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-02-14 21:30:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 482. [2022-02-14 21:30:43,557 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-14 21:30:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 639 transitions. [2022-02-14 21:30:43,559 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 639 transitions. Word has length 64 [2022-02-14 21:30:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:43,559 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 639 transitions. [2022-02-14 21:30:43,559 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-14 21:30:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 639 transitions. [2022-02-14 21:30:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-14 21:30:43,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:43,561 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-14 21:30:43,579 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-14 21:30:43,767 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-14 21:30:43,767 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash -110856328, now seen corresponding path program 1 times [2022-02-14 21:30:43,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:43,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708385874] [2022-02-14 21:30:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:43,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:43,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:43,982 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-14 21:30:43,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:43,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708385874] [2022-02-14 21:30:43,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708385874] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:43,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347021766] [2022-02-14 21:30:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:43,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:43,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:43,984 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-14 21:30:43,985 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-14 21:30:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:44,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-14 21:30:44,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:44,396 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-14 21:30:44,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:30:44,568 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-14 21:30:44,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347021766] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:44,568 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:44,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-02-14 21:30:44,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301794632] [2022-02-14 21:30:44,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:44,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-14 21:30:44,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:44,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-14 21:30:44,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=1058, Unknown=0, NotChecked=0, Total=1722 [2022-02-14 21:30:44,570 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-14 21:30:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:44,759 INFO L93 Difference]: Finished difference Result 1633 states and 2144 transitions. [2022-02-14 21:30:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-14 21:30:44,760 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-14 21:30:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:44,764 INFO L225 Difference]: With dead ends: 1633 [2022-02-14 21:30:44,764 INFO L226 Difference]: Without dead ends: 1633 [2022-02-14 21:30:44,764 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-14 21:30:44,765 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-14 21:30:44,765 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-14 21:30:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-02-14 21:30:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 590. [2022-02-14 21:30:44,776 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-14 21:30:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 779 transitions. [2022-02-14 21:30:44,778 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 779 transitions. Word has length 70 [2022-02-14 21:30:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:44,778 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 779 transitions. [2022-02-14 21:30:44,778 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-14 21:30:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 779 transitions. [2022-02-14 21:30:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-14 21:30:44,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:44,779 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-14 21:30:44,798 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-14 21:30:44,998 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-14 21:30:44,998 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash 906232056, now seen corresponding path program 2 times [2022-02-14 21:30:44,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:44,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175673839] [2022-02-14 21:30:44,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:45,472 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-14 21:30:45,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:45,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175673839] [2022-02-14 21:30:45,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175673839] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:45,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349816122] [2022-02-14 21:30:45,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:30:45,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:45,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:45,474 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-14 21:30:45,475 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-14 21:30:45,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:30:45,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:30:45,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:30:45,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:45,665 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-14 21:30:45,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:30:45,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349816122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:30:45,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:30:45,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [30] total 34 [2022-02-14 21:30:45,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241446988] [2022-02-14 21:30:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:30:45,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:30:45,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:30:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=841, Unknown=0, NotChecked=0, Total=1122 [2022-02-14 21:30:45,667 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-14 21:30:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:45,702 INFO L93 Difference]: Finished difference Result 453 states and 593 transitions. [2022-02-14 21:30:45,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:30:45,702 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-14 21:30:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:45,703 INFO L225 Difference]: With dead ends: 453 [2022-02-14 21:30:45,703 INFO L226 Difference]: Without dead ends: 453 [2022-02-14 21:30:45,704 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-14 21:30:45,704 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-14 21:30:45,704 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-14 21:30:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-02-14 21:30:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2022-02-14 21:30:45,710 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-14 21:30:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 592 transitions. [2022-02-14 21:30:45,711 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 592 transitions. Word has length 82 [2022-02-14 21:30:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:45,711 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 592 transitions. [2022-02-14 21:30:45,711 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-14 21:30:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 592 transitions. [2022-02-14 21:30:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-14 21:30:45,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:45,712 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-14 21:30:45,730 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-14 21:30:45,925 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-14 21:30:45,926 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash -764281513, now seen corresponding path program 1 times [2022-02-14 21:30:45,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:45,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434610076] [2022-02-14 21:30:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:46,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:46,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:46,351 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-14 21:30:46,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:46,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434610076] [2022-02-14 21:30:46,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434610076] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:46,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844627478] [2022-02-14 21:30:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:46,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:46,353 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-14 21:30:46,354 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-14 21:30:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:46,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-14 21:30:46,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:47,414 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-14 21:30:47,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:30:49,130 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-14 21:30:49,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844627478] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:49,131 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:49,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 77 [2022-02-14 21:30:49,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946170377] [2022-02-14 21:30:49,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:49,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-02-14 21:30:49,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:49,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-02-14 21:30:49,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1581, Invalid=4271, Unknown=0, NotChecked=0, Total=5852 [2022-02-14 21:30:49,133 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-14 21:30:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:51,098 INFO L93 Difference]: Finished difference Result 907 states and 1205 transitions. [2022-02-14 21:30:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-02-14 21:30:51,099 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-14 21:30:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:51,102 INFO L225 Difference]: With dead ends: 907 [2022-02-14 21:30:51,102 INFO L226 Difference]: Without dead ends: 907 [2022-02-14 21:30:51,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6247 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3458, Invalid=12544, Unknown=0, NotChecked=0, Total=16002 [2022-02-14 21:30:51,106 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-14 21:30:51,106 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-14 21:30:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-02-14 21:30:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 862. [2022-02-14 21:30:51,118 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-14 21:30:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1143 transitions. [2022-02-14 21:30:51,120 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1143 transitions. Word has length 82 [2022-02-14 21:30:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:51,120 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1143 transitions. [2022-02-14 21:30:51,121 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-14 21:30:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1143 transitions. [2022-02-14 21:30:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-14 21:30:51,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:51,121 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-14 21:30:51,138 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-14 21:30:51,337 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-14 21:30:51,338 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2101920920, now seen corresponding path program 1 times [2022-02-14 21:30:51,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:51,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094966577] [2022-02-14 21:30:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:51,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:51,395 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-14 21:30:51,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:51,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094966577] [2022-02-14 21:30:51,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094966577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:30:51,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:30:51,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 21:30:51,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639592115] [2022-02-14 21:30:51,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:30:51,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:30:51,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:30:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:30:51,396 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-14 21:30:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:51,449 INFO L93 Difference]: Finished difference Result 1103 states and 1466 transitions. [2022-02-14 21:30:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 21:30:51,449 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-14 21:30:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:51,454 INFO L225 Difference]: With dead ends: 1103 [2022-02-14 21:30:51,454 INFO L226 Difference]: Without dead ends: 1103 [2022-02-14 21:30:51,454 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-14 21:30:51,455 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-14 21:30:51,455 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-14 21:30:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-02-14 21:30:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 937. [2022-02-14 21:30:51,470 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-14 21:30:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1244 transitions. [2022-02-14 21:30:51,472 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1244 transitions. Word has length 82 [2022-02-14 21:30:51,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:51,472 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1244 transitions. [2022-02-14 21:30:51,472 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-14 21:30:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1244 transitions. [2022-02-14 21:30:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-02-14 21:30:51,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:51,477 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-14 21:30:51,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-14 21:30:51,477 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:51,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1670302378, now seen corresponding path program 1 times [2022-02-14 21:30:51,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:51,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447069496] [2022-02-14 21:30:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:51,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-14 21:30:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:51,541 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-14 21:30:51,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:51,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447069496] [2022-02-14 21:30:51,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447069496] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:51,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329818848] [2022-02-14 21:30:51,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:51,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:51,543 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-14 21:30:51,544 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-14 21:30:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:51,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-14 21:30:51,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:52,031 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-14 21:30:52,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:30:52,296 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-14 21:30:52,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329818848] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:52,296 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:52,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-02-14 21:30:52,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345616122] [2022-02-14 21:30:52,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:52,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 21:30:52,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:52,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 21:30:52,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-02-14 21:30:52,297 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-14 21:30:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:52,437 INFO L93 Difference]: Finished difference Result 2067 states and 2758 transitions. [2022-02-14 21:30:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-14 21:30:52,437 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-14 21:30:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:52,445 INFO L225 Difference]: With dead ends: 2067 [2022-02-14 21:30:52,445 INFO L226 Difference]: Without dead ends: 2067 [2022-02-14 21:30:52,445 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-14 21:30:52,445 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-14 21:30:52,446 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-14 21:30:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-02-14 21:30:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1237. [2022-02-14 21:30:52,469 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-14 21:30:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2022-02-14 21:30:52,473 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 153 [2022-02-14 21:30:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:52,473 INFO L470 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2022-02-14 21:30:52,473 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-14 21:30:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2022-02-14 21:30:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-14 21:30:52,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:52,474 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-14 21:30:52,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-14 21:30:52,691 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-14 21:30:52,691 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1910464549, now seen corresponding path program 1 times [2022-02-14 21:30:52,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:52,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524764714] [2022-02-14 21:30:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:52,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-14 21:30:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:52,962 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-14 21:30:52,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:52,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524764714] [2022-02-14 21:30:52,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524764714] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:52,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293535187] [2022-02-14 21:30:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:52,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:52,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:52,963 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-14 21:30:52,964 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-14 21:30:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:53,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-14 21:30:53,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:53,704 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-14 21:30:53,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:30:53,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293535187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:30:53,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:30:53,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [25] total 46 [2022-02-14 21:30:53,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751133405] [2022-02-14 21:30:53,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:30:53,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-14 21:30:53,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:53,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-14 21:30:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=1348, Unknown=0, NotChecked=0, Total=2070 [2022-02-14 21:30:53,706 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-14 21:30:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:53,856 INFO L93 Difference]: Finished difference Result 1141 states and 1483 transitions. [2022-02-14 21:30:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-14 21:30:53,856 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-14 21:30:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:53,859 INFO L225 Difference]: With dead ends: 1141 [2022-02-14 21:30:53,859 INFO L226 Difference]: Without dead ends: 928 [2022-02-14 21:30:53,859 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-14 21:30:53,860 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.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:30:53,860 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.1s Time] [2022-02-14 21:30:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-02-14 21:30:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 866. [2022-02-14 21:30:53,869 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-14 21:30:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1010 transitions. [2022-02-14 21:30:53,870 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1010 transitions. Word has length 156 [2022-02-14 21:30:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:53,870 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1010 transitions. [2022-02-14 21:30:53,870 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-14 21:30:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1010 transitions. [2022-02-14 21:30:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-02-14 21:30:53,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:53,874 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-14 21:30:53,892 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-14 21:30:54,090 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-14 21:30:54,090 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:54,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1004247254, now seen corresponding path program 2 times [2022-02-14 21:30:54,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:54,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617600696] [2022-02-14 21:30:54,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:54,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-14 21:30:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:54,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-02-14 21:30:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-02-14 21:30:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:54,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-02-14 21:30:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-02-14 21:30:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:54,260 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-14 21:30:54,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:54,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617600696] [2022-02-14 21:30:54,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617600696] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:54,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110179171] [2022-02-14 21:30:54,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:30:54,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:54,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:54,262 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-14 21:30:54,265 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-14 21:30:54,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:30:54,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:30:54,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:30:54,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:30:55,677 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-14 21:30:55,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:30:56,383 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-14 21:30:56,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110179171] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:56,383 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:56,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-02-14 21:30:56,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144881832] [2022-02-14 21:30:56,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:56,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-14 21:30:56,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-14 21:30:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2022-02-14 21:30:56,385 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-14 21:30:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:56,631 INFO L93 Difference]: Finished difference Result 2570 states and 3234 transitions. [2022-02-14 21:30:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-14 21:30:56,631 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-14 21:30:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:56,634 INFO L225 Difference]: With dead ends: 2570 [2022-02-14 21:30:56,635 INFO L226 Difference]: Without dead ends: 1402 [2022-02-14 21:30:56,635 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-14 21:30:56,635 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-14 21:30:56,635 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-14 21:30:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-02-14 21:30:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2022-02-14 21:30:56,650 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-14 21:30:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1562 transitions. [2022-02-14 21:30:56,652 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1562 transitions. Word has length 437 [2022-02-14 21:30:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:56,652 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 1562 transitions. [2022-02-14 21:30:56,653 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-14 21:30:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1562 transitions. [2022-02-14 21:30:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2022-02-14 21:30:56,668 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:56,668 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-14 21:30:56,684 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-14 21:30:56,884 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-14 21:30:56,884 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1775263786, now seen corresponding path program 3 times [2022-02-14 21:30:56,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:56,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858365360] [2022-02-14 21:30:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:56,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-14 21:30:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-14 21:30:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-02-14 21:30:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-02-14 21:30:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-02-14 21:30:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-02-14 21:30:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-02-14 21:30:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2022-02-14 21:30:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2022-02-14 21:30:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2022-02-14 21:30:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2022-02-14 21:30:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2022-02-14 21:30:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2022-02-14 21:30:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2022-02-14 21:30:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:57,319 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-14 21:30:57,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:57,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858365360] [2022-02-14 21:30:57,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858365360] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:57,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379274640] [2022-02-14 21:30:57,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 21:30:57,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:57,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:57,320 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-14 21:30:57,321 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-14 21:30:57,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2022-02-14 21:30:57,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:30:57,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-14 21:30:57,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:31:00,529 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-14 21:31:00,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:31:02,022 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-14 21:31:02,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379274640] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:31:02,023 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:31:02,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 40 [2022-02-14 21:31:02,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096610604] [2022-02-14 21:31:02,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:31:02,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-14 21:31:02,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:31:02,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-14 21:31:02,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=946, Unknown=0, NotChecked=0, Total=1560 [2022-02-14 21:31:02,028 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-14 21:31:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:31:02,369 INFO L93 Difference]: Finished difference Result 2680 states and 3230 transitions. [2022-02-14 21:31:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-14 21:31:02,370 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-14 21:31:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:31:02,375 INFO L225 Difference]: With dead ends: 2680 [2022-02-14 21:31:02,375 INFO L226 Difference]: Without dead ends: 1804 [2022-02-14 21:31:02,375 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-14 21:31:02,376 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-14 21:31:02,376 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-14 21:31:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-02-14 21:31:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2022-02-14 21:31:02,394 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-14 21:31:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 1976 transitions. [2022-02-14 21:31:02,398 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 1976 transitions. Word has length 1005 [2022-02-14 21:31:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:31:02,399 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 1976 transitions. [2022-02-14 21:31:02,399 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-14 21:31:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 1976 transitions. [2022-02-14 21:31:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2022-02-14 21:31:02,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:31:02,451 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-14 21:31:02,469 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-14 21:31:02,667 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-14 21:31:02,668 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:31:02,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:31:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 942669078, now seen corresponding path program 4 times [2022-02-14 21:31:02,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:31:02,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374096056] [2022-02-14 21:31:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:31:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:31:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-14 21:31:02,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-14 21:31:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-14 21:31:03,629 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-14 21:31:03,629 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-14 21:31:03,630 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-14 21:31:03,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-14 21:31:03,634 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:31:03,637 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-14 21:31:03,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:31:03 BasicIcfg [2022-02-14 21:31:03,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-14 21:31:03,810 INFO L158 Benchmark]: Toolchain (without parser) took 25435.12ms. Allocated memory was 196.1MB in the beginning and 385.9MB in the end (delta: 189.8MB). Free memory was 142.9MB in the beginning and 263.2MB in the end (delta: -120.2MB). Peak memory consumption was 213.3MB. Max. memory is 8.0GB. [2022-02-14 21:31:03,810 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-14 21:31:03,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.67ms. Allocated memory is still 196.1MB. Free memory was 142.7MB in the beginning and 168.6MB in the end (delta: -25.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-02-14 21:31:03,810 INFO L158 Benchmark]: Boogie Preprocessor took 16.62ms. Allocated memory is still 196.1MB. Free memory was 168.6MB in the beginning and 167.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-14 21:31:03,810 INFO L158 Benchmark]: RCFGBuilder took 216.14ms. Allocated memory is still 196.1MB. Free memory was 167.0MB in the beginning and 155.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-14 21:31:03,810 INFO L158 Benchmark]: IcfgTransformer took 17.24ms. Allocated memory is still 196.1MB. Free memory was 155.5MB in the beginning and 154.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-14 21:31:03,811 INFO L158 Benchmark]: TraceAbstraction took 24981.26ms. Allocated memory was 196.1MB in the beginning and 385.9MB in the end (delta: 189.8MB). Free memory was 153.9MB in the beginning and 263.2MB in the end (delta: -109.2MB). Peak memory consumption was 224.4MB. Max. memory is 8.0GB. [2022-02-14 21:31:03,811 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.11ms. Allocated memory is still 196.1MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.67ms. Allocated memory is still 196.1MB. Free memory was 142.7MB in the beginning and 168.6MB in the end (delta: -25.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.62ms. Allocated memory is still 196.1MB. Free memory was 168.6MB in the beginning and 167.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 216.14ms. Allocated memory is still 196.1MB. Free memory was 167.0MB in the beginning and 155.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 17.24ms. Allocated memory is still 196.1MB. Free memory was 155.5MB in the beginning and 154.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 24981.26ms. Allocated memory was 196.1MB in the beginning and 385.9MB in the end (delta: 189.8MB). Free memory was 153.9MB in the beginning and 263.2MB in the end (delta: -109.2MB). Peak memory consumption was 224.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 24.8s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3346 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3321 mSDsluCounter, 1030 SdHoareTripleChecker+Invalid, 1.5s 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.4s 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.9s 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-14 21:31:03,835 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...