/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 10:26:48,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 10:26:48,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 10:26:48,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 10:26:48,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 10:26:48,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 10:26:48,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 10:26:48,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 10:26:48,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 10:26:48,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 10:26:48,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 10:26:48,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 10:26:48,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 10:26:48,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 10:26:48,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 10:26:48,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 10:26:48,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 10:26:48,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 10:26:48,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 10:26:48,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 10:26:48,778 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 10:26:48,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 10:26:48,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 10:26:48,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 10:26:48,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 10:26:48,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 10:26:48,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 10:26:48,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 10:26:48,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 10:26:48,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 10:26:48,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 10:26:48,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 10:26:48,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 10:26:48,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 10:26:48,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 10:26:48,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 10:26:48,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 10:26:48,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 10:26:48,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 10:26:48,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 10:26:48,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 10:26:48,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 10:26:48,799 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 10:26:48,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 10:26:48,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 10:26:48,828 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 10:26:48,828 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 10:26:48,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 10:26:48,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 10:26:48,829 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 10:26:48,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 10:26:48,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 10:26:48,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 10:26:48,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 10:26:48,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 10:26:48,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 10:26:48,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 10:26:48,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 10:26:48,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 10:26:48,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 10:26:48,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 10:26:48,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 10:26:48,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 10:26:48,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 10:26:48,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 10:26:48,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 10:26:48,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 10:26:48,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 10:26:48,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 10:26:48,833 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 10:26:48,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 10:26:48,834 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 10:26:48,834 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-06 10:26:49,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 10:26:49,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 10:26:49,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 10:26:49,099 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 10:26:49,100 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 10:26:49,101 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-04-06 10:26:49,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e162c1b8c/50b408b07da74c9c89927b015c754a5f/FLAG609bad08a [2022-04-06 10:26:49,535 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 10:26:49,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-04-06 10:26:49,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e162c1b8c/50b408b07da74c9c89927b015c754a5f/FLAG609bad08a [2022-04-06 10:26:49,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e162c1b8c/50b408b07da74c9c89927b015c754a5f [2022-04-06 10:26:49,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 10:26:49,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 10:26:49,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 10:26:49,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 10:26:49,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 10:26:49,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633ece13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49, skipping insertion in model container [2022-04-06 10:26:49,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 10:26:49,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 10:26:49,753 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-04-06 10:26:49,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 10:26:49,794 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 10:26:49,807 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-04-06 10:26:49,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 10:26:49,833 INFO L208 MainTranslator]: Completed translation [2022-04-06 10:26:49,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49 WrapperNode [2022-04-06 10:26:49,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 10:26:49,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 10:26:49,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 10:26:49,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 10:26:49,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 10:26:49,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 10:26:49,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 10:26:49,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 10:26:49,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (1/1) ... [2022-04-06 10:26:49,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 10:26:49,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:26:49,885 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-04-06 10:26:49,886 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-04-06 10:26:49,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 10:26:49,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 10:26:49,914 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 10:26:49,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 10:26:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 10:26:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 10:26:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 10:26:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 10:26:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 10:26:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 10:26:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 10:26:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 10:26:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 10:26:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 10:26:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 10:26:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 10:26:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 10:26:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 10:26:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 10:26:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 10:26:49,968 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 10:26:49,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 10:26:50,159 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 10:26:50,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 10:26:50,176 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-06 10:26:50,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:26:50 BoogieIcfgContainer [2022-04-06 10:26:50,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 10:26:50,178 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 10:26:50,178 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 10:26:50,179 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 10:26:50,182 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:26:50" (1/1) ... [2022-04-06 10:26:50,184 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 10:26:50,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 10:26:50 BasicIcfg [2022-04-06 10:26:50,196 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 10:26:50,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 10:26:50,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 10:26:50,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 10:26:50,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 10:26:49" (1/4) ... [2022-04-06 10:26:50,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164d5737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:26:50, skipping insertion in model container [2022-04-06 10:26:50,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:26:49" (2/4) ... [2022-04-06 10:26:50,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164d5737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:26:50, skipping insertion in model container [2022-04-06 10:26:50,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:26:50" (3/4) ... [2022-04-06 10:26:50,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164d5737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:26:50, skipping insertion in model container [2022-04-06 10:26:50,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 10:26:50" (4/4) ... [2022-04-06 10:26:50,203 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.cqvasr [2022-04-06 10:26:50,206 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 10:26:50,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 10:26:50,283 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 10:26:50,288 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-04-06 10:26:50,288 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 10:26:50,302 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-04-06 10:26:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-06 10:26:50,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:50,306 INFO L499 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-04-06 10:26:50,307 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash -414317756, now seen corresponding path program 1 times [2022-04-06 10:26:50,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:50,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113756922] [2022-04-06 10:26:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:50,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:50,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:50,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:50,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113756922] [2022-04-06 10:26:50,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113756922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:26:50,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:26:50,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 10:26:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500968610] [2022-04-06 10:26:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:26:50,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 10:26:50,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 10:26:50,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 10:26:50,570 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-04-06 10:26:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:50,652 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-06 10:26:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 10:26:50,656 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-04-06 10:26:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:50,662 INFO L225 Difference]: With dead ends: 50 [2022-04-06 10:26:50,662 INFO L226 Difference]: Without dead ends: 27 [2022-04-06 10:26:50,665 INFO L912 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-04-06 10:26:50,674 INFO L913 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-04-06 10:26:50,676 INFO L914 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-04-06 10:26:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-06 10:26:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-06 10:26:50,710 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-04-06 10:26:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-06 10:26:50,714 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2022-04-06 10:26:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:50,714 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-06 10:26:50,715 INFO L479 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-04-06 10:26:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-06 10:26:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-06 10:26:50,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:50,717 INFO L499 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-04-06 10:26:50,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 10:26:50,717 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:50,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:50,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1035089572, now seen corresponding path program 1 times [2022-04-06 10:26:50,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:50,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405146758] [2022-04-06 10:26:50,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:50,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:50,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:50,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405146758] [2022-04-06 10:26:50,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405146758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:26:50,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:26:50,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 10:26:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390940833] [2022-04-06 10:26:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:26:50,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 10:26:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 10:26:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-06 10:26:50,887 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-04-06 10:26:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:51,001 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-06 10:26:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 10:26:51,002 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-04-06 10:26:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:51,004 INFO L225 Difference]: With dead ends: 46 [2022-04-06 10:26:51,004 INFO L226 Difference]: Without dead ends: 31 [2022-04-06 10:26:51,010 INFO L912 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-04-06 10:26:51,012 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 26 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-04-06 10:26:51,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 26 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:26:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-06 10:26:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-06 10:26:51,027 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-04-06 10:26:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-06 10:26:51,029 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2022-04-06 10:26:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:51,029 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-06 10:26:51,030 INFO L479 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-04-06 10:26:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-06 10:26:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-06 10:26:51,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:51,032 INFO L499 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-04-06 10:26:51,032 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 10:26:51,032 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:51,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:51,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2124918270, now seen corresponding path program 1 times [2022-04-06 10:26:51,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:51,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196198793] [2022-04-06 10:26:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:51,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 10:26:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:51,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196198793] [2022-04-06 10:26:51,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196198793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:26:51,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:26:51,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 10:26:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629734997] [2022-04-06 10:26:51,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:26:51,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 10:26:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:51,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 10:26:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 10:26:51,139 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-04-06 10:26:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:51,223 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-06 10:26:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 10:26:51,224 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-04-06 10:26:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:51,227 INFO L225 Difference]: With dead ends: 49 [2022-04-06 10:26:51,227 INFO L226 Difference]: Without dead ends: 33 [2022-04-06 10:26:51,230 INFO L912 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-04-06 10:26:51,234 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:26:51,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:26:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-06 10:26:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-04-06 10:26:51,246 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-04-06 10:26:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-06 10:26:51,247 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-04-06 10:26:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:51,248 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-06 10:26:51,248 INFO L479 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-04-06 10:26:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-06 10:26:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-06 10:26:51,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:51,250 INFO L499 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-04-06 10:26:51,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 10:26:51,250 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1237414589, now seen corresponding path program 1 times [2022-04-06 10:26:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:51,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040303113] [2022-04-06 10:26:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 10:26:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:51,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040303113] [2022-04-06 10:26:51,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040303113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:26:51,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:26:51,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 10:26:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121473363] [2022-04-06 10:26:51,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:26:51,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 10:26:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:51,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 10:26:51,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 10:26:51,374 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-04-06 10:26:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:51,458 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-04-06 10:26:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 10:26:51,458 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-04-06 10:26:51,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:51,459 INFO L225 Difference]: With dead ends: 57 [2022-04-06 10:26:51,460 INFO L226 Difference]: Without dead ends: 40 [2022-04-06 10:26:51,460 INFO L912 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-04-06 10:26:51,461 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 84 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:26:51,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 37 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:26:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-06 10:26:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-06 10:26:51,468 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-04-06 10:26:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-06 10:26:51,471 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2022-04-06 10:26:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:51,471 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-04-06 10:26:51,471 INFO L479 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-04-06 10:26:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-04-06 10:26:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-06 10:26:51,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:51,472 INFO L499 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-04-06 10:26:51,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 10:26:51,473 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:51,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:51,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1236491068, now seen corresponding path program 1 times [2022-04-06 10:26:51,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:51,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947108438] [2022-04-06 10:26:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:51,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947108438] [2022-04-06 10:26:51,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947108438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:26:51,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500090586] [2022-04-06 10:26:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:26:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:26:51,563 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-04-06 10:26:51,600 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-04-06 10:26:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:51,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-06 10:26:51,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:26:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:51,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:26:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:51,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500090586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:26:51,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:26:51,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-04-06 10:26:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864132265] [2022-04-06 10:26:51,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:26:51,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-06 10:26:51,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:51,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-06 10:26:51,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-06 10:26:51,838 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-04-06 10:26:51,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:51,971 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-06 10:26:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 10:26:51,971 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-04-06 10:26:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:51,974 INFO L225 Difference]: With dead ends: 87 [2022-04-06 10:26:51,974 INFO L226 Difference]: Without dead ends: 59 [2022-04-06 10:26:51,975 INFO L912 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-04-06 10:26:51,976 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:26:51,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 30 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:26:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-06 10:26:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-06 10:26:51,985 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-04-06 10:26:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-06 10:26:51,986 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 24 [2022-04-06 10:26:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:51,986 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-06 10:26:51,987 INFO L479 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-04-06 10:26:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-06 10:26:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-06 10:26:51,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:51,988 INFO L499 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-04-06 10:26:52,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-06 10:26:52,203 WARN L460 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-04-06 10:26:52,204 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash 575066086, now seen corresponding path program 2 times [2022-04-06 10:26:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:52,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407175305] [2022-04-06 10:26:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:52,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:52,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:52,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407175305] [2022-04-06 10:26:52,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407175305] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:26:52,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500762595] [2022-04-06 10:26:52,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 10:26:52,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:26:52,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:26:52,309 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-04-06 10:26:52,311 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-04-06 10:26:52,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 10:26:52,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 10:26:52,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-06 10:26:52,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:26:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 10:26:52,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:26:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 10:26:52,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500762595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:26:52,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:26:52,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-04-06 10:26:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658056416] [2022-04-06 10:26:52,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:26:52,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-06 10:26:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-06 10:26:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-06 10:26:52,543 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-04-06 10:26:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:52,912 INFO L93 Difference]: Finished difference Result 183 states and 258 transitions. [2022-04-06 10:26:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-06 10:26:52,913 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-04-06 10:26:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:52,914 INFO L225 Difference]: With dead ends: 183 [2022-04-06 10:26:52,914 INFO L226 Difference]: Without dead ends: 137 [2022-04-06 10:26:52,915 INFO L912 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-04-06 10:26:52,916 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 10:26:52,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 44 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 10:26:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-06 10:26:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2022-04-06 10:26:52,928 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-04-06 10:26:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2022-04-06 10:26:52,931 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 33 [2022-04-06 10:26:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:52,931 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-04-06 10:26:52,931 INFO L479 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-04-06 10:26:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2022-04-06 10:26:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-06 10:26:52,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:52,932 INFO L499 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-04-06 10:26:52,960 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-04-06 10:26:53,146 WARN L460 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-04-06 10:26:53,147 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:53,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1861776890, now seen corresponding path program 1 times [2022-04-06 10:26:53,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:53,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432983642] [2022-04-06 10:26:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-06 10:26:53,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:53,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432983642] [2022-04-06 10:26:53,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432983642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:26:53,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:26:53,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 10:26:53,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130555092] [2022-04-06 10:26:53,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:26:53,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 10:26:53,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:53,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 10:26:53,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 10:26:53,187 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-04-06 10:26:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:53,239 INFO L93 Difference]: Finished difference Result 281 states and 380 transitions. [2022-04-06 10:26:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 10:26:53,239 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-04-06 10:26:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:53,242 INFO L225 Difference]: With dead ends: 281 [2022-04-06 10:26:53,242 INFO L226 Difference]: Without dead ends: 169 [2022-04-06 10:26:53,245 INFO L912 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-04-06 10:26:53,246 INFO L913 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-04-06 10:26:53,246 INFO L914 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-04-06 10:26:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-06 10:26:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2022-04-06 10:26:53,270 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-04-06 10:26:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 207 transitions. [2022-04-06 10:26:53,271 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 207 transitions. Word has length 39 [2022-04-06 10:26:53,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:53,271 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 207 transitions. [2022-04-06 10:26:53,272 INFO L479 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-04-06 10:26:53,272 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 207 transitions. [2022-04-06 10:26:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-06 10:26:53,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:53,273 INFO L499 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-04-06 10:26:53,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 10:26:53,273 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1695849177, now seen corresponding path program 1 times [2022-04-06 10:26:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:53,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060525134] [2022-04-06 10:26:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:53,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:53,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060525134] [2022-04-06 10:26:53,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060525134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:26:53,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290544627] [2022-04-06 10:26:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:53,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:26:53,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:26:53,408 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-04-06 10:26:53,431 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-04-06 10:26:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:53,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 10:26:53,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:26:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:53,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:26:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:53,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290544627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:26:53,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:26:53,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-04-06 10:26:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767358247] [2022-04-06 10:26:53,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:26:53,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-06 10:26:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-06 10:26:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2022-04-06 10:26:53,897 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-04-06 10:26:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:54,187 INFO L93 Difference]: Finished difference Result 449 states and 643 transitions. [2022-04-06 10:26:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-06 10:26:54,188 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-04-06 10:26:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:54,189 INFO L225 Difference]: With dead ends: 449 [2022-04-06 10:26:54,190 INFO L226 Difference]: Without dead ends: 303 [2022-04-06 10:26:54,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=723, Unknown=0, NotChecked=0, Total=1122 [2022-04-06 10:26:54,191 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 197 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:26:54,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 29 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:26:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-06 10:26:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2022-04-06 10:26:54,211 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-04-06 10:26:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2022-04-06 10:26:54,213 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 40 [2022-04-06 10:26:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:54,213 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2022-04-06 10:26:54,214 INFO L479 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-04-06 10:26:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2022-04-06 10:26:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-06 10:26:54,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:54,216 INFO L499 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-04-06 10:26:54,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-06 10:26:54,438 WARN L460 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-04-06 10:26:54,439 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 150253017, now seen corresponding path program 2 times [2022-04-06 10:26:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:54,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944039156] [2022-04-06 10:26:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:54,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:54,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944039156] [2022-04-06 10:26:54,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944039156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:26:54,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492301101] [2022-04-06 10:26:54,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 10:26:54,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:26:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:26:54,661 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-04-06 10:26:54,663 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-04-06 10:26:54,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 10:26:54,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 10:26:54,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 10:26:54,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:26:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-04-06 10:26:54,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:26:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-04-06 10:26:55,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492301101] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:26:55,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:26:55,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 26 [2022-04-06 10:26:55,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113896547] [2022-04-06 10:26:55,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:26:55,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-06 10:26:55,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-06 10:26:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2022-04-06 10:26:55,118 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-04-06 10:26:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:56,391 INFO L93 Difference]: Finished difference Result 1401 states and 1897 transitions. [2022-04-06 10:26:56,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-06 10:26:56,391 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-04-06 10:26:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:56,396 INFO L225 Difference]: With dead ends: 1401 [2022-04-06 10:26:56,396 INFO L226 Difference]: Without dead ends: 1111 [2022-04-06 10:26:56,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1752, Invalid=4568, Unknown=0, NotChecked=0, Total=6320 [2022-04-06 10:26:56,399 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 693 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 10:26:56,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 33 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 10:26:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-04-06 10:26:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 482. [2022-04-06 10:26:56,433 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-04-06 10:26:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 639 transitions. [2022-04-06 10:26:56,435 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 639 transitions. Word has length 64 [2022-04-06 10:26:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:56,436 INFO L478 AbstractCegarLoop]: Abstraction has 482 states and 639 transitions. [2022-04-06 10:26:56,436 INFO L479 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-04-06 10:26:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 639 transitions. [2022-04-06 10:26:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-06 10:26:56,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:56,438 INFO L499 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-04-06 10:26:56,460 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-04-06 10:26:56,651 WARN L460 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-04-06 10:26:56,651 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:56,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash -110856328, now seen corresponding path program 1 times [2022-04-06 10:26:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:56,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027308989] [2022-04-06 10:26:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:56,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:56,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:56,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027308989] [2022-04-06 10:26:56,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027308989] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:26:56,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758817232] [2022-04-06 10:26:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:56,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:26:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:26:56,920 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-04-06 10:26:56,921 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-04-06 10:26:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:56,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-06 10:26:56,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:26:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:57,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:26:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:57,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758817232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:26:57,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:26:57,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-04-06 10:26:57,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861372048] [2022-04-06 10:26:57,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:26:57,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-06 10:26:57,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:57,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-06 10:26:57,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=1058, Unknown=0, NotChecked=0, Total=1722 [2022-04-06 10:26:57,638 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-04-06 10:26:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:58,012 INFO L93 Difference]: Finished difference Result 2103 states and 2809 transitions. [2022-04-06 10:26:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-06 10:26:58,012 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-04-06 10:26:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:58,025 INFO L225 Difference]: With dead ends: 2103 [2022-04-06 10:26:58,025 INFO L226 Difference]: Without dead ends: 1633 [2022-04-06 10:26:58,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=744, Invalid=1326, Unknown=0, NotChecked=0, Total=2070 [2022-04-06 10:26:58,028 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 223 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:26:58,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 32 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:26:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-04-06 10:26:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 590. [2022-04-06 10:26:58,085 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-04-06 10:26:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 779 transitions. [2022-04-06 10:26:58,087 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 779 transitions. Word has length 70 [2022-04-06 10:26:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:58,087 INFO L478 AbstractCegarLoop]: Abstraction has 590 states and 779 transitions. [2022-04-06 10:26:58,087 INFO L479 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-04-06 10:26:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 779 transitions. [2022-04-06 10:26:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-06 10:26:58,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:58,091 INFO L499 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-04-06 10:26:58,115 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-04-06 10:26:58,307 WARN L460 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-04-06 10:26:58,307 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash 906232056, now seen corresponding path program 2 times [2022-04-06 10:26:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:58,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218479190] [2022-04-06 10:26:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:58,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:26:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:58,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:26:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:26:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:26:58,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:26:58,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218479190] [2022-04-06 10:26:58,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218479190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:26:58,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299066506] [2022-04-06 10:26:58,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 10:26:58,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:26:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:26:58,888 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-04-06 10:26:58,918 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-04-06 10:26:58,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 10:26:58,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 10:26:58,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 10:26:58,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:26:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-04-06 10:26:59,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 10:26:59,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299066506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:26:59,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 10:26:59,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [30] total 34 [2022-04-06 10:26:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971487043] [2022-04-06 10:26:59,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:26:59,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 10:26:59,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:26:59,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 10:26:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=841, Unknown=0, NotChecked=0, Total=1122 [2022-04-06 10:26:59,124 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-04-06 10:26:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:26:59,194 INFO L93 Difference]: Finished difference Result 593 states and 781 transitions. [2022-04-06 10:26:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 10:26:59,194 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-04-06 10:26:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:26:59,196 INFO L225 Difference]: With dead ends: 593 [2022-04-06 10:26:59,196 INFO L226 Difference]: Without dead ends: 453 [2022-04-06 10:26:59,197 INFO L912 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-04-06 10:26:59,198 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 10:26:59,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 10:26:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-06 10:26:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2022-04-06 10:26:59,220 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-04-06 10:26:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 592 transitions. [2022-04-06 10:26:59,222 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 592 transitions. Word has length 82 [2022-04-06 10:26:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:26:59,222 INFO L478 AbstractCegarLoop]: Abstraction has 452 states and 592 transitions. [2022-04-06 10:26:59,222 INFO L479 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-04-06 10:26:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 592 transitions. [2022-04-06 10:26:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-06 10:26:59,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:26:59,223 INFO L499 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-04-06 10:26:59,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-06 10:26:59,443 WARN L460 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-04-06 10:26:59,444 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:26:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:26:59,444 INFO L85 PathProgramCache]: Analyzing trace with hash -764281513, now seen corresponding path program 1 times [2022-04-06 10:26:59,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:26:59,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451228045] [2022-04-06 10:26:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:26:59,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:26:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:27:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:27:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:27:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:27:00,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451228045] [2022-04-06 10:27:00,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451228045] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:27:00,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849106882] [2022-04-06 10:27:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:00,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:27:00,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:27:00,027 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-04-06 10:27:00,027 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-04-06 10:27:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:00,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-06 10:27:00,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:27:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:27:01,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:27:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:27:03,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849106882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:27:03,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:27:03,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 77 [2022-04-06 10:27:03,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049821942] [2022-04-06 10:27:03,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:27:03,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-06 10:27:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:27:03,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-06 10:27:03,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1581, Invalid=4271, Unknown=0, NotChecked=0, Total=5852 [2022-04-06 10:27:03,233 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-04-06 10:27:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:27:05,562 INFO L93 Difference]: Finished difference Result 909 states and 1209 transitions. [2022-04-06 10:27:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-04-06 10:27:05,562 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-04-06 10:27:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:27:05,566 INFO L225 Difference]: With dead ends: 909 [2022-04-06 10:27:05,566 INFO L226 Difference]: Without dead ends: 907 [2022-04-06 10:27:05,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6247 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3458, Invalid=12544, Unknown=0, NotChecked=0, Total=16002 [2022-04-06 10:27:05,570 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 516 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 10:27:05,570 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 63 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 10:27:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-06 10:27:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 862. [2022-04-06 10:27:05,617 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-04-06 10:27:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1143 transitions. [2022-04-06 10:27:05,620 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1143 transitions. Word has length 82 [2022-04-06 10:27:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:27:05,621 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1143 transitions. [2022-04-06 10:27:05,621 INFO L479 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-04-06 10:27:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1143 transitions. [2022-04-06 10:27:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-06 10:27:05,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:27:05,626 INFO L499 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-04-06 10:27:05,651 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-04-06 10:27:05,839 WARN L460 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-04-06 10:27:05,839 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:27:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:27:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2101920920, now seen corresponding path program 1 times [2022-04-06 10:27:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:27:05,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293267298] [2022-04-06 10:27:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:05,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:27:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:05,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:27:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:05,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:27:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-04-06 10:27:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:27:05,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293267298] [2022-04-06 10:27:05,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293267298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:27:05,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:27:05,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 10:27:05,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789528061] [2022-04-06 10:27:05,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:27:05,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 10:27:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:27:05,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 10:27:05,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 10:27:05,901 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-04-06 10:27:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:27:06,010 INFO L93 Difference]: Finished difference Result 1330 states and 1770 transitions. [2022-04-06 10:27:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 10:27:06,010 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-04-06 10:27:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:27:06,016 INFO L225 Difference]: With dead ends: 1330 [2022-04-06 10:27:06,016 INFO L226 Difference]: Without dead ends: 1103 [2022-04-06 10:27:06,017 INFO L912 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-04-06 10:27:06,018 INFO L913 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-04-06 10:27:06,018 INFO L914 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-04-06 10:27:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-04-06 10:27:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 937. [2022-04-06 10:27:06,094 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-04-06 10:27:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1244 transitions. [2022-04-06 10:27:06,098 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1244 transitions. Word has length 82 [2022-04-06 10:27:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:27:06,099 INFO L478 AbstractCegarLoop]: Abstraction has 937 states and 1244 transitions. [2022-04-06 10:27:06,099 INFO L479 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-04-06 10:27:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1244 transitions. [2022-04-06 10:27:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-06 10:27:06,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:27:06,101 INFO L499 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-04-06 10:27:06,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-06 10:27:06,101 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:27:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:27:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1670302378, now seen corresponding path program 1 times [2022-04-06 10:27:06,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:27:06,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312187139] [2022-04-06 10:27:06,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:27:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:27:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:27:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-06 10:27:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-04-06 10:27:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:27:06,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312187139] [2022-04-06 10:27:06,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312187139] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:27:06,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224109786] [2022-04-06 10:27:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:06,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:27:06,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:27:06,188 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-04-06 10:27:06,217 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-04-06 10:27:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:06,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 10:27:06,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:27:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-04-06 10:27:06,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:27:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-04-06 10:27:07,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224109786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:27:07,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:27:07,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-06 10:27:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725563206] [2022-04-06 10:27:07,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:27:07,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 10:27:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:27:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 10:27:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-06 10:27:07,086 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-04-06 10:27:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:27:07,354 INFO L93 Difference]: Finished difference Result 2294 states and 3080 transitions. [2022-04-06 10:27:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 10:27:07,355 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-04-06 10:27:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:27:07,366 INFO L225 Difference]: With dead ends: 2294 [2022-04-06 10:27:07,366 INFO L226 Difference]: Without dead ends: 2067 [2022-04-06 10:27:07,367 INFO L912 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-04-06 10:27:07,368 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 220 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:27:07,368 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 86 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:27:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-04-06 10:27:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1237. [2022-04-06 10:27:07,458 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-04-06 10:27:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2022-04-06 10:27:07,462 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 153 [2022-04-06 10:27:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:27:07,463 INFO L478 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2022-04-06 10:27:07,463 INFO L479 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-04-06 10:27:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2022-04-06 10:27:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-06 10:27:07,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:27:07,465 INFO L499 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-04-06 10:27:07,488 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-04-06 10:27:07,688 WARN L460 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-04-06 10:27:07,688 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:27:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:27:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1910464549, now seen corresponding path program 1 times [2022-04-06 10:27:07,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:27:07,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398967189] [2022-04-06 10:27:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:27:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:27:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:08,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:27:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-06 10:27:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 722 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-04-06 10:27:08,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:27:08,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398967189] [2022-04-06 10:27:08,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398967189] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:27:08,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672034337] [2022-04-06 10:27:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:08,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:27:08,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:27:08,021 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-04-06 10:27:08,022 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-04-06 10:27:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:08,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-06 10:27:08,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:27:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 1960 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-04-06 10:27:08,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 10:27:08,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672034337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:27:08,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 10:27:08,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [25] total 46 [2022-04-06 10:27:08,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025476101] [2022-04-06 10:27:08,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:27:08,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-06 10:27:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:27:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-06 10:27:08,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=1348, Unknown=0, NotChecked=0, Total=2070 [2022-04-06 10:27:08,939 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-04-06 10:27:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:27:09,162 INFO L93 Difference]: Finished difference Result 2246 states and 2982 transitions. [2022-04-06 10:27:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-06 10:27:09,162 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-04-06 10:27:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:27:09,165 INFO L225 Difference]: With dead ends: 2246 [2022-04-06 10:27:09,165 INFO L226 Difference]: Without dead ends: 928 [2022-04-06 10:27:09,168 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=722, Invalid=1348, Unknown=0, NotChecked=0, Total=2070 [2022-04-06 10:27:09,168 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:27:09,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 62 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:27:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-04-06 10:27:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 866. [2022-04-06 10:27:09,223 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-04-06 10:27:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1010 transitions. [2022-04-06 10:27:09,225 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1010 transitions. Word has length 156 [2022-04-06 10:27:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:27:09,225 INFO L478 AbstractCegarLoop]: Abstraction has 866 states and 1010 transitions. [2022-04-06 10:27:09,226 INFO L479 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-04-06 10:27:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1010 transitions. [2022-04-06 10:27:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-04-06 10:27:09,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:27:09,231 INFO L499 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-04-06 10:27:09,256 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-04-06 10:27:09,450 WARN L460 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-04-06 10:27:09,451 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:27:09,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:27:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1004247254, now seen corresponding path program 2 times [2022-04-06 10:27:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:27:09,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594863461] [2022-04-06 10:27:09,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:27:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:27:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:27:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-06 10:27:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:09,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-04-06 10:27:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:09,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-04-06 10:27:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-04-06 10:27:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:09,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-04-06 10:27:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-04-06 10:27:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:27:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594863461] [2022-04-06 10:27:09,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594863461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:27:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202363394] [2022-04-06 10:27:09,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 10:27:09,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:27:09,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:27:09,681 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-04-06 10:27:09,721 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-04-06 10:27:09,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 10:27:09,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 10:27:09,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 10:27:09,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:27:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-04-06 10:27:11,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:27:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-04-06 10:27:12,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202363394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:27:12,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:27:12,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-04-06 10:27:12,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833080736] [2022-04-06 10:27:12,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:27:12,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-06 10:27:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:27:12,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-06 10:27:12,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2022-04-06 10:27:12,126 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-04-06 10:27:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:27:12,549 INFO L93 Difference]: Finished difference Result 2797 states and 3552 transitions. [2022-04-06 10:27:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-06 10:27:12,555 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-04-06 10:27:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:27:12,560 INFO L225 Difference]: With dead ends: 2797 [2022-04-06 10:27:12,560 INFO L226 Difference]: Without dead ends: 1402 [2022-04-06 10:27:12,564 INFO L912 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-04-06 10:27:12,565 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 397 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 10:27:12,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 155 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 10:27:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-04-06 10:27:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2022-04-06 10:27:12,653 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-04-06 10:27:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1562 transitions. [2022-04-06 10:27:12,657 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1562 transitions. Word has length 437 [2022-04-06 10:27:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:27:12,657 INFO L478 AbstractCegarLoop]: Abstraction has 1402 states and 1562 transitions. [2022-04-06 10:27:12,658 INFO L479 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-04-06 10:27:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1562 transitions. [2022-04-06 10:27:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2022-04-06 10:27:12,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:27:12,682 INFO L499 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-04-06 10:27:12,708 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-04-06 10:27:12,895 WARN L460 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-04-06 10:27:12,895 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:27:12,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:27:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1775263786, now seen corresponding path program 3 times [2022-04-06 10:27:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:27:12,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577328516] [2022-04-06 10:27:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:12,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:27:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:27:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:27:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-06 10:27:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-04-06 10:27:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-04-06 10:27:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-04-06 10:27:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-04-06 10:27:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-04-06 10:27:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2022-04-06 10:27:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2022-04-06 10:27:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2022-04-06 10:27:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2022-04-06 10:27:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2022-04-06 10:27:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2022-04-06 10:27:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2022-04-06 10:27:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:27:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-04-06 10:27:13,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:27:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577328516] [2022-04-06 10:27:13,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577328516] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:27:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888867625] [2022-04-06 10:27:13,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 10:27:13,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:27:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:27:13,475 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-04-06 10:27:13,485 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-04-06 10:27:13,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2022-04-06 10:27:13,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 10:27:13,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-06 10:27:13,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:27:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-04-06 10:27:17,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:27:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-04-06 10:27:18,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888867625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:27:18,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:27:18,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 40 [2022-04-06 10:27:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105948857] [2022-04-06 10:27:18,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:27:18,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-06 10:27:18,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:27:18,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-06 10:27:18,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=946, Unknown=0, NotChecked=0, Total=1560 [2022-04-06 10:27:18,729 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-04-06 10:27:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:27:19,213 INFO L93 Difference]: Finished difference Result 2907 states and 3542 transitions. [2022-04-06 10:27:19,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-06 10:27:19,214 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-04-06 10:27:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:27:19,219 INFO L225 Difference]: With dead ends: 2907 [2022-04-06 10:27:19,219 INFO L226 Difference]: Without dead ends: 1804 [2022-04-06 10:27:19,222 INFO L912 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-04-06 10:27:19,223 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 447 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 10:27:19,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 216 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 10:27:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-04-06 10:27:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2022-04-06 10:27:19,354 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-04-06 10:27:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 1976 transitions. [2022-04-06 10:27:19,359 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 1976 transitions. Word has length 1005 [2022-04-06 10:27:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:27:19,360 INFO L478 AbstractCegarLoop]: Abstraction has 1804 states and 1976 transitions. [2022-04-06 10:27:19,360 INFO L479 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-04-06 10:27:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 1976 transitions. [2022-04-06 10:27:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2022-04-06 10:27:19,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:27:19,404 INFO L499 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-04-06 10:27:19,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-06 10:27:19,609 WARN L460 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-04-06 10:27:19,609 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:27:19,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:27:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 942669078, now seen corresponding path program 4 times [2022-04-06 10:27:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:27:19,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422876431] [2022-04-06 10:27:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:27:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:27:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 10:27:20,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 10:27:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 10:27:20,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 10:27:20,996 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 10:27:20,997 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 10:27:20,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-06 10:27:21,003 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 10:27:21,008 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 10:27:21,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:27:21 BasicIcfg [2022-04-06 10:27:21,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 10:27:21,248 INFO L158 Benchmark]: Toolchain (without parser) took 31687.40ms. Allocated memory was 190.8MB in the beginning and 425.7MB in the end (delta: 234.9MB). Free memory was 132.1MB in the beginning and 198.9MB in the end (delta: -66.9MB). Peak memory consumption was 183.3MB. Max. memory is 8.0GB. [2022-04-06 10:27:21,249 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 10:27:21,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.14ms. Allocated memory was 190.8MB in the beginning and 245.4MB in the end (delta: 54.5MB). Free memory was 131.9MB in the beginning and 217.2MB in the end (delta: -85.4MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2022-04-06 10:27:21,249 INFO L158 Benchmark]: Boogie Preprocessor took 25.40ms. Allocated memory is still 245.4MB. Free memory was 217.2MB in the beginning and 215.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 10:27:21,249 INFO L158 Benchmark]: RCFGBuilder took 316.78ms. Allocated memory is still 245.4MB. Free memory was 215.7MB in the beginning and 203.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-06 10:27:21,249 INFO L158 Benchmark]: IcfgTransformer took 18.09ms. Allocated memory is still 245.4MB. Free memory was 203.1MB in the beginning and 201.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 10:27:21,251 INFO L158 Benchmark]: TraceAbstraction took 31049.23ms. Allocated memory was 245.4MB in the beginning and 425.7MB in the end (delta: 180.4MB). Free memory was 201.0MB in the beginning and 198.9MB in the end (delta: 2.1MB). Peak memory consumption was 198.4MB. Max. memory is 8.0GB. [2022-04-06 10:27:21,257 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 190.8MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.14ms. Allocated memory was 190.8MB in the beginning and 245.4MB in the end (delta: 54.5MB). Free memory was 131.9MB in the beginning and 217.2MB in the end (delta: -85.4MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.40ms. Allocated memory is still 245.4MB. Free memory was 217.2MB in the beginning and 215.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 316.78ms. Allocated memory is still 245.4MB. Free memory was 215.7MB in the beginning and 203.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 18.09ms. Allocated memory is still 245.4MB. Free memory was 203.1MB in the beginning and 201.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 31049.23ms. Allocated memory was 245.4MB in the beginning and 425.7MB in the end (delta: 180.4MB). Free memory was 201.0MB in the beginning and 198.9MB in the end (delta: 2.1MB). Peak memory consumption was 198.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: 30.7s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3227 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3202 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 790 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3090 IncrementalHoareTripleChecker+Invalid, 3880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 790 mSolverCounterUnsat, 418 mSDtfsCounter, 3090 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, 7.7s 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.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 2809 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.5s 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-04-06 10:27:21,295 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...