/usr/bin/java -ea -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/loop-new/count_by_1_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:42:13,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:42:13,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:42:13,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:42:13,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:42:13,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:42:13,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:42:13,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:42:13,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:42:13,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:42:13,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:42:13,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:42:13,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:42:13,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:42:13,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:42:13,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:42:13,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:42:13,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:42:13,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:42:13,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:42:13,510 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:42:13,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:42:13,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:42:13,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:42:13,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:42:13,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:42:13,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:42:13,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:42:13,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:42:13,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:42:13,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:42:13,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:42:13,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:42:13,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:42:13,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:42:13,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:42:13,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:42:13,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:42:13,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:42:13,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:42:13,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:42:13,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:42:13,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:42:13,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:42:13,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:42:13,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:42:13,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:42:13,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:42:13,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:42:13,563 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:42:13,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:42:13,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:42:13,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:42:13,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:42:13,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:42:13,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:42:13,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:42:13,565 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:42:13,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:42:13,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:42:13,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:42:13,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:42:13,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:42:13,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:42:13,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:42:13,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:42:13,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:42:13,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:42:13,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:42:13,566 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:42:13,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:42:13,568 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:42:13,568 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-27 21:42:13,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:42:13,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:42:13,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:42:13,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:42:13,825 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:42:13,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_variant.i [2022-04-27 21:42:13,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70aad5468/b43f758bd1144e9d8e304aa3616bf795/FLAG204fe31db [2022-04-27 21:42:14,216 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:42:14,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant.i [2022-04-27 21:42:14,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70aad5468/b43f758bd1144e9d8e304aa3616bf795/FLAG204fe31db [2022-04-27 21:42:14,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70aad5468/b43f758bd1144e9d8e304aa3616bf795 [2022-04-27 21:42:14,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:42:14,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:42:14,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:42:14,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:42:14,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:42:14,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91e632a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14, skipping insertion in model container [2022-04-27 21:42:14,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:42:14,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:42:14,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant.i[891,904] [2022-04-27 21:42:14,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:42:14,802 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:42:14,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant.i[891,904] [2022-04-27 21:42:14,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:42:14,826 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:42:14,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14 WrapperNode [2022-04-27 21:42:14,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:42:14,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:42:14,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:42:14,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:42:14,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:42:14,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:42:14,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:42:14,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:42:14,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (1/1) ... [2022-04-27 21:42:14,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:42:14,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:42:14,912 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-27 21:42:14,926 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-27 21:42:14,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:42:14,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:42:14,952 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:42:14,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:42:14,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:42:14,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:42:14,953 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:42:14,953 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:42:14,954 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:42:14,954 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:42:14,954 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:42:14,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:42:14,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:42:14,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:42:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:42:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:42:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:42:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:42:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:42:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:42:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:42:14,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:42:15,012 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:42:15,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:42:15,164 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:42:15,169 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:42:15,169 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:42:15,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:42:15 BoogieIcfgContainer [2022-04-27 21:42:15,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:42:15,172 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:42:15,172 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:42:15,188 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:42:15,190 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:42:15" (1/1) ... [2022-04-27 21:42:15,192 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:42:15,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:42:15 BasicIcfg [2022-04-27 21:42:15,213 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:42:15,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:42:15,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:42:15,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:42:15,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:42:14" (1/4) ... [2022-04-27 21:42:15,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52062830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:42:15, skipping insertion in model container [2022-04-27 21:42:15,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:42:14" (2/4) ... [2022-04-27 21:42:15,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52062830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:42:15, skipping insertion in model container [2022-04-27 21:42:15,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:42:15" (3/4) ... [2022-04-27 21:42:15,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52062830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:42:15, skipping insertion in model container [2022-04-27 21:42:15,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:42:15" (4/4) ... [2022-04-27 21:42:15,219 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.iqvasr [2022-04-27 21:42:15,230 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:42:15,231 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:42:15,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:42:15,286 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@322c1560, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ed8fbfa [2022-04-27 21:42:15,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:42:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:42:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:42:15,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:42:15,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:42:15,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:42:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:42:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1861424559, now seen corresponding path program 1 times [2022-04-27 21:42:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:42:15,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569057430] [2022-04-27 21:42:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:42:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:42:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:42:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:42:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:42:15,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 21:42:15,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:42:15,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:42:15,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:42:15,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 21:42:15,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:42:15,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:42:15,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:42:15,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [58] mainENTRY-->L26-2: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {28#(<= main_~i~0 1000000)} is VALID [2022-04-27 21:42:15,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(<= main_~i~0 1000000)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {28#(<= main_~i~0 1000000)} is VALID [2022-04-27 21:42:15,601 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#(<= main_~i~0 1000000)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:42:15,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:42:15,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} [68] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:42:15,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [70] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:42:15,603 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-27 21:42:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:42:15,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569057430] [2022-04-27 21:42:15,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569057430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:42:15,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:42:15,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:42:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172281410] [2022-04-27 21:42:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:42:15,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:42:15,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:42:15,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:15,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:42:15,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:42:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:42:15,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:42:15,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:42:15,668 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:15,918 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 21:42:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:42:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:42:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:42:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 21:42:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 21:42:15,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-27 21:42:15,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:42:15,989 INFO L225 Difference]: With dead ends: 41 [2022-04-27 21:42:15,989 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 21:42:15,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:42:15,994 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:42:15,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:42:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 21:42:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 21:42:16,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:42:16,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:42:16,024 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:42:16,025 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:42:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:16,032 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 21:42:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 21:42:16,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:42:16,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:42:16,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 21:42:16,034 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 21:42:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:16,041 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 21:42:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 21:42:16,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:42:16,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:42:16,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:42:16,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:42:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:42:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-27 21:42:16,050 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2022-04-27 21:42:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:42:16,055 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-27 21:42:16,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 21:42:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:42:16,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:42:16,057 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:42:16,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:42:16,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:42:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:42:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1022018108, now seen corresponding path program 1 times [2022-04-27 21:42:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:42:16,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428217859] [2022-04-27 21:42:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:42:16,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:42:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:42:16,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:42:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:42:16,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171#true} is VALID [2022-04-27 21:42:16,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 21:42:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:42:16,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {171#true} is VALID [2022-04-27 21:42:16,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [69] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [72] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {176#(= main_~i~0 0)} [75] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {176#(= main_~i~0 0)} is VALID [2022-04-27 21:42:16,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:42:16,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171#true} is VALID [2022-04-27 21:42:16,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [58] mainENTRY-->L26-2: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {176#(= main_~i~0 0)} is VALID [2022-04-27 21:42:16,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(= main_~i~0 0)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {176#(= main_~i~0 0)} is VALID [2022-04-27 21:42:16,168 INFO L272 TraceCheckUtils]: 7: Hoare triple {176#(= main_~i~0 0)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {171#true} is VALID [2022-04-27 21:42:16,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#true} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {171#true} is VALID [2022-04-27 21:42:16,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#true} [69] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#true} [72] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,169 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {171#true} {176#(= main_~i~0 0)} [75] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {176#(= main_~i~0 0)} is VALID [2022-04-27 21:42:16,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {176#(= main_~i~0 0)} [66] L27-1-->L26-2: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {181#(<= main_~i~0 1)} is VALID [2022-04-27 21:42:16,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#(<= main_~i~0 1)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {181#(<= main_~i~0 1)} is VALID [2022-04-27 21:42:16,171 INFO L272 TraceCheckUtils]: 14: Hoare triple {181#(<= main_~i~0 1)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {182#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:42:16,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {182#(not (= |__VERIFIER_assert_#in~cond| 0))} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {183#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:42:16,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {183#(not (= __VERIFIER_assert_~cond 0))} [68] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-27 21:42:16,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {172#false} [70] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-27 21:42:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:42:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:42:16,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428217859] [2022-04-27 21:42:16,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428217859] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:42:16,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775752304] [2022-04-27 21:42:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:42:16,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:42:16,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:42:16,175 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-27 21:42:16,176 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-27 21:42:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:42:16,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:42:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:42:16,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:42:16,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171#true} is VALID [2022-04-27 21:42:16,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [58] mainENTRY-->L26-2: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {203#(<= main_~i~0 0)} is VALID [2022-04-27 21:42:16,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#(<= main_~i~0 0)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {203#(<= main_~i~0 0)} is VALID [2022-04-27 21:42:16,381 INFO L272 TraceCheckUtils]: 7: Hoare triple {203#(<= main_~i~0 0)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {171#true} is VALID [2022-04-27 21:42:16,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#true} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {171#true} is VALID [2022-04-27 21:42:16,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#true} [69] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#true} [72] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,382 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {171#true} {203#(<= main_~i~0 0)} [75] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {203#(<= main_~i~0 0)} is VALID [2022-04-27 21:42:16,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#(<= main_~i~0 0)} [66] L27-1-->L26-2: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {181#(<= main_~i~0 1)} is VALID [2022-04-27 21:42:16,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#(<= main_~i~0 1)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {181#(<= main_~i~0 1)} is VALID [2022-04-27 21:42:16,384 INFO L272 TraceCheckUtils]: 14: Hoare triple {181#(<= main_~i~0 1)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:42:16,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:42:16,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} [68] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-27 21:42:16,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {172#false} [70] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-27 21:42:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:42:16,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:42:16,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {172#false} [70] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-27 21:42:16,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} [68] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-27 21:42:16,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:42:16,546 INFO L272 TraceCheckUtils]: 14: Hoare triple {251#(<= main_~i~0 1000000)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:42:16,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {251#(<= main_~i~0 1000000)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {251#(<= main_~i~0 1000000)} is VALID [2022-04-27 21:42:16,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#(<= main_~i~0 999999)} [66] L27-1-->L26-2: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {251#(<= main_~i~0 1000000)} is VALID [2022-04-27 21:42:16,547 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {171#true} {258#(<= main_~i~0 999999)} [75] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {258#(<= main_~i~0 999999)} is VALID [2022-04-27 21:42:16,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#true} [72] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#true} [69] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#true} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {171#true} is VALID [2022-04-27 21:42:16,548 INFO L272 TraceCheckUtils]: 7: Hoare triple {258#(<= main_~i~0 999999)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {171#true} is VALID [2022-04-27 21:42:16,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {258#(<= main_~i~0 999999)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {258#(<= main_~i~0 999999)} is VALID [2022-04-27 21:42:16,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [58] mainENTRY-->L26-2: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {258#(<= main_~i~0 999999)} is VALID [2022-04-27 21:42:16,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171#true} is VALID [2022-04-27 21:42:16,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-27 21:42:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:42:16,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775752304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:42:16,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:42:16,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-27 21:42:16,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721690304] [2022-04-27 21:42:16,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:42:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-04-27 21:42:16,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:42:16,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:42:16,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:42:16,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 21:42:16,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:42:16,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 21:42:16,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:42:16,593 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:42:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:16,824 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-27 21:42:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:42:16,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-04-27 21:42:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:42:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:42:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-27 21:42:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:42:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-27 21:42:16,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-27 21:42:16,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:42:16,902 INFO L225 Difference]: With dead ends: 26 [2022-04-27 21:42:16,902 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:42:16,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-27 21:42:16,904 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:42:16,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:42:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:42:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:42:16,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:42:16,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:42:16,906 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:42:16,906 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:42:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:16,906 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:42:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:42:16,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:42:16,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:42:16,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:42:16,907 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:42:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:16,907 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:42:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:42:16,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:42:16,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:42:16,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:42:16,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:42:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:42:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:42:16,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 21:42:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:42:16,908 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:42:16,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:42:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:42:16,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:42:16,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:42:16,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:42:17,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:42:17,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:42:17,190 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:42:17,190 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:42:17,190 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:42:17,190 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:42:17,190 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:42:17,190 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:42:17,191 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:42:17,191 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 30) the Hoare annotation is: true [2022-04-27 21:42:17,191 INFO L895 garLoopResultBuilder]: At program point L26-2(lines 26 28) the Hoare annotation is: (<= main_~i~0 1000000) [2022-04-27 21:42:17,191 INFO L899 garLoopResultBuilder]: For program point L26-3(lines 26 28) no Hoare annotation was computed. [2022-04-27 21:42:17,191 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (<= main_~i~0 999999) [2022-04-27 21:42:17,191 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 30) no Hoare annotation was computed. [2022-04-27 21:42:17,191 INFO L899 garLoopResultBuilder]: For program point L27-1(lines 26 28) no Hoare annotation was computed. [2022-04-27 21:42:17,191 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 30) no Hoare annotation was computed. [2022-04-27 21:42:17,191 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:42:17,191 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:42:17,192 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:42:17,192 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:42:17,192 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:42:17,192 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:42:17,194 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 21:42:17,197 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:42:17,202 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:42:17,203 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:42:17,203 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:42:17,203 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-27 21:42:17,203 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:42:17,204 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:42:17,205 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:42:17,205 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 21:42:17,205 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:42:17,205 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:42:17,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:42:17 BasicIcfg [2022-04-27 21:42:17,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:42:17,213 INFO L158 Benchmark]: Toolchain (without parser) took 2575.53ms. Allocated memory was 181.4MB in the beginning and 245.4MB in the end (delta: 64.0MB). Free memory was 123.9MB in the beginning and 206.4MB in the end (delta: -82.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:42:17,220 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:42:17,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.70ms. Allocated memory was 181.4MB in the beginning and 245.4MB in the end (delta: 64.0MB). Free memory was 123.7MB in the beginning and 217.8MB in the end (delta: -94.1MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-27 21:42:17,221 INFO L158 Benchmark]: Boogie Preprocessor took 56.47ms. Allocated memory is still 245.4MB. Free memory was 217.8MB in the beginning and 215.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:42:17,222 INFO L158 Benchmark]: RCFGBuilder took 285.34ms. Allocated memory is still 245.4MB. Free memory was 215.8MB in the beginning and 204.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:42:17,222 INFO L158 Benchmark]: IcfgTransformer took 41.08ms. Allocated memory is still 245.4MB. Free memory was 204.3MB in the beginning and 203.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:42:17,223 INFO L158 Benchmark]: TraceAbstraction took 1998.07ms. Allocated memory is still 245.4MB. Free memory was 202.7MB in the beginning and 206.4MB in the end (delta: -3.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:42:17,226 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.70ms. Allocated memory was 181.4MB in the beginning and 245.4MB in the end (delta: 64.0MB). Free memory was 123.7MB in the beginning and 217.8MB in the end (delta: -94.1MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.47ms. Allocated memory is still 245.4MB. Free memory was 217.8MB in the beginning and 215.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.34ms. Allocated memory is still 245.4MB. Free memory was 215.8MB in the beginning and 204.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 41.08ms. Allocated memory is still 245.4MB. Free memory was 204.3MB in the beginning and 203.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1998.07ms. Allocated memory is still 245.4MB. Free memory was 202.7MB in the beginning and 206.4MB in the end (delta: -3.6MB). There was no memory consumed. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 22 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=1, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 17 HoareAnnotationTreeSize, 10 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 127 SizeOfPredicates, 1 NumberOfNonLiveVariables, 59 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/12 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: i <= 1000000 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:42:17,262 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...