/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/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:05:16,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:05:16,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:05:16,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:05:16,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:05:16,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:05:16,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:05:16,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:05:16,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:05:16,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:05:16,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:05:16,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:05:16,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:05:16,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:05:16,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:05:16,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:05:16,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:05:16,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:05:16,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:05:16,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:05:16,547 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:05:16,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:05:16,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:05:16,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:05:16,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:05:16,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:05:16,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:05:16,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:05:16,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:05:16,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:05:16,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:05:16,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:05:16,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:05:16,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:05:16,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:05:16,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:05:16,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:05:16,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:05:16,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:05:16,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:05:16,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:05:16,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:05:16,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:05:16,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:05:16,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:05:16,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:05:16,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:05:16,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:05:16,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:05:16,580 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:05:16,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:05:16,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:05:16,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:05:16,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:05:16,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:05:16,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:05:16,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:05:16,581 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:05:16,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:05:16,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:05:16,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:05:16,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:05:16,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:05:16,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:05:16,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:05:16,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:05:16,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:05:16,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:05:16,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:05:16,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:05:16,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:05:16,583 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:05:16,583 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-15 00:05:16,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:05:16,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:05:16,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:05:16,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:05:16,757 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:05:16,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2022-04-15 00:05:16,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f354ff6/38ad767703c44e99b10bdff0fd86e868/FLAGdabd06746 [2022-04-15 00:05:17,264 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:05:17,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2022-04-15 00:05:17,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f354ff6/38ad767703c44e99b10bdff0fd86e868/FLAGdabd06746 [2022-04-15 00:05:17,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f354ff6/38ad767703c44e99b10bdff0fd86e868 [2022-04-15 00:05:17,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:05:17,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:05:17,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:05:17,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:05:17,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:05:17,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134a0b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17, skipping insertion in model container [2022-04-15 00:05:17,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:05:17,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:05:17,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i[808,821] [2022-04-15 00:05:17,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:05:17,448 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:05:17,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i[808,821] [2022-04-15 00:05:17,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:05:17,481 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:05:17,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17 WrapperNode [2022-04-15 00:05:17,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:05:17,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:05:17,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:05:17,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:05:17,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:05:17,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:05:17,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:05:17,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:05:17,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:05:17,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:17,556 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-15 00:05:17,557 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-15 00:05:17,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:05:17,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:05:17,579 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:05:17,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:05:17,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:05:17,579 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:05:17,579 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:05:17,579 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:05:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:05:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:05:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:05:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:05:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 00:05:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:05:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:05:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:05:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:05:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:05:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:05:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:05:17,625 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:05:17,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:05:17,762 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:05:17,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:05:17,781 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:05:17,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:17 BoogieIcfgContainer [2022-04-15 00:05:17,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:05:17,783 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:05:17,783 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:05:17,784 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:05:17,786 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:17" (1/1) ... [2022-04-15 00:05:17,788 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:05:17,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:05:17 BasicIcfg [2022-04-15 00:05:17,814 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:05:17,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:05:17,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:05:17,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:05:17,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:05:17" (1/4) ... [2022-04-15 00:05:17,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a117b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:17, skipping insertion in model container [2022-04-15 00:05:17,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:17" (2/4) ... [2022-04-15 00:05:17,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a117b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:17, skipping insertion in model container [2022-04-15 00:05:17,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:17" (3/4) ... [2022-04-15 00:05:17,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a117b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:05:17, skipping insertion in model container [2022-04-15 00:05:17,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:05:17" (4/4) ... [2022-04-15 00:05:17,836 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-1.iqvasr [2022-04-15 00:05:17,839 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:05:17,839 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:05:17,888 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:05:17,893 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:05:17,893 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:05:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-15 00:05:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:05:17,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:17,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:17,910 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:17,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash -423489079, now seen corresponding path program 1 times [2022-04-15 00:05:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:17,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002304684] [2022-04-15 00:05:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:18,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:18,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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-15 00:05:18,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:18,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:18,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:18,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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-15 00:05:18,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:18,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:18,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:18,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-15 00:05:18,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [56] L24-3-->L24-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 00:05:18,094 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {24#false} is VALID [2022-04-15 00:05:18,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [63] __VERIFIER_assertENTRY-->L15: 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] {24#false} is VALID [2022-04-15 00:05:18,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [65] L15-->L16: 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-15 00:05:18,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 00:05:18,095 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-15 00:05:18,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:18,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002304684] [2022-04-15 00:05:18,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002304684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:05:18,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:05:18,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:05:18,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564120559] [2022-04-15 00:05:18,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:05:18,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-15 00:05:18,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:18,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-15 00:05:18,120 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-15 00:05:18,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:05:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:05:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:05:18,144 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-15 00:05:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:18,214 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 00:05:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:05:18,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-15 00:05:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-15 00:05:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 00:05:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-15 00:05:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 00:05:18,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-15 00:05:18,274 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-15 00:05:18,279 INFO L225 Difference]: With dead ends: 31 [2022-04-15 00:05:18,279 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 00:05:18,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:05:18,286 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:18,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:05:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 00:05:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 00:05:18,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:18,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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-15 00:05:18,311 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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-15 00:05:18,311 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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-15 00:05:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:18,315 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 00:05:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:05:18,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:18,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:18,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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) Second operand 14 states. [2022-04-15 00:05:18,316 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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) Second operand 14 states. [2022-04-15 00:05:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:18,319 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 00:05:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:05:18,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:18,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:18,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:18,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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-15 00:05:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 00:05:18,325 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 00:05:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:18,327 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 00:05:18,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-15 00:05:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:05:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:05:18,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:18,333 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:18,334 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:05:18,334 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -422565558, now seen corresponding path program 1 times [2022-04-15 00:05:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:18,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737549249] [2022-04-15 00:05:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:18,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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] {120#true} is VALID [2022-04-15 00:05:18,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:18,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:18,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:18,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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] {120#true} is VALID [2022-04-15 00:05:18,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:18,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:18,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:18,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:18,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:18,470 INFO L272 TraceCheckUtils]: 7: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:05:18,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L15: 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] {127#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:05:18,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {127#(not (= __VERIFIER_assert_~cond 0))} [65] L15-->L16: 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[] {121#false} is VALID [2022-04-15 00:05:18,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-15 00:05:18,471 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-15 00:05:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:18,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737549249] [2022-04-15 00:05:18,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737549249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:05:18,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:05:18,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:05:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040494122] [2022-04-15 00:05:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:05:18,473 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-15 00:05:18,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:18,474 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-15 00:05:18,484 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-15 00:05:18,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:05:18,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:18,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:05:18,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:05:18,486 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. 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-15 00:05:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:18,616 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 00:05:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:05:18,617 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-15 00:05:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:18,617 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-15 00:05:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 00:05:18,618 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-15 00:05:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 00:05:18,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-15 00:05:18,637 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-15 00:05:18,638 INFO L225 Difference]: With dead ends: 22 [2022-04-15 00:05:18,638 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 00:05:18,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:05:18,639 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:18,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:05:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 00:05:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 00:05:18,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:18,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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-15 00:05:18,642 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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-15 00:05:18,643 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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-15 00:05:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:18,644 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 00:05:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 00:05:18,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:18,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:18,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 17 states. [2022-04-15 00:05:18,644 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 17 states. [2022-04-15 00:05:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:18,645 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 00:05:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 00:05:18,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:18,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:18,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:18,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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-15 00:05:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 00:05:18,647 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 00:05:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:18,647 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 00:05:18,647 INFO L479 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-15 00:05:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 00:05:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:05:18,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:18,647 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:18,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:05:18,648 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:18,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1744981802, now seen corresponding path program 1 times [2022-04-15 00:05:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:18,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555624590] [2022-04-15 00:05:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:18,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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] {228#true} is VALID [2022-04-15 00:05:18,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:18,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:18,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:18,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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] {228#true} is VALID [2022-04-15 00:05:18,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:18,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:18,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:18,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {233#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:18,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {234#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:18,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {235#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-15 00:05:18,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {236#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-15 00:05:18,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {237#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:18,795 INFO L272 TraceCheckUtils]: 10: Hoare triple {237#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:05:18,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {238#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L15: 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] {239#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:05:18,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(not (= __VERIFIER_assert_~cond 0))} [65] L15-->L16: 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[] {229#false} is VALID [2022-04-15 00:05:18,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-15 00:05:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:18,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:18,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555624590] [2022-04-15 00:05:18,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555624590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:18,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436880345] [2022-04-15 00:05:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:18,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:18,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:18,798 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-15 00:05:18,799 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-15 00:05:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:18,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 00:05:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:18,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:19,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:19,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [52] 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) 10) (= (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] {228#true} is VALID [2022-04-15 00:05:19,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:19,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:19,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:19,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {233#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:19,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {234#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:19,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {265#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-15 00:05:19,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {269#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-15 00:05:19,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {273#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-15 00:05:19,084 INFO L272 TraceCheckUtils]: 10: Hoare triple {273#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:19,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L15: 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] {281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:19,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(<= 1 __VERIFIER_assert_~cond)} [65] L15-->L16: 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[] {229#false} is VALID [2022-04-15 00:05:19,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-15 00:05:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:19,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:19,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-15 00:05:19,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(<= 1 __VERIFIER_assert_~cond)} [65] L15-->L16: 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[] {229#false} is VALID [2022-04-15 00:05:19,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L15: 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] {281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:19,312 INFO L272 TraceCheckUtils]: 10: Hoare triple {297#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:19,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {297#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:19,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {305#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {301#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:19,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {305#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:19,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {309#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:19,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {313#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:19,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:19,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:19,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:19,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [52] 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) 10) (= (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] {228#true} is VALID [2022-04-15 00:05:19,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-15 00:05:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:19,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436880345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:19,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:19,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-15 00:05:19,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030205796] [2022-04-15 00:05:19,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:19,317 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:05:19,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:19,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:19,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:19,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 00:05:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 00:05:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-15 00:05:19,337 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:19,908 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 00:05:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 00:05:19,909 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:05:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-15 00:05:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-15 00:05:19,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 40 transitions. [2022-04-15 00:05:19,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:19,942 INFO L225 Difference]: With dead ends: 37 [2022-04-15 00:05:19,942 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 00:05:19,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2022-04-15 00:05:19,943 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:19,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 81 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:05:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 00:05:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 00:05:19,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:19,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 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-15 00:05:19,948 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 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-15 00:05:19,949 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 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-15 00:05:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:19,950 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 00:05:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 00:05:19,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:19,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:19,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 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) Second operand 22 states. [2022-04-15 00:05:19,951 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 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) Second operand 22 states. [2022-04-15 00:05:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:19,952 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 00:05:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 00:05:19,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:19,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:19,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:19,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 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-15 00:05:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-15 00:05:19,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-15 00:05:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:19,953 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-15 00:05:19,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 00:05:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 00:05:19,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:19,954 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:19,973 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-15 00:05:20,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:20,171 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:20,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1411179434, now seen corresponding path program 2 times [2022-04-15 00:05:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:20,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669178457] [2022-04-15 00:05:20,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:20,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {500#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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] {485#true} is VALID [2022-04-15 00:05:20,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {500#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:20,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {500#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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] {485#true} is VALID [2022-04-15 00:05:20,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:20,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:20,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {491#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:20,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-15 00:05:20,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-15 00:05:20,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {493#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:20,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-15 00:05:20,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {494#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} is VALID [2022-04-15 00:05:20,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {495#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-15 00:05:20,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {495#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {496#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-15 00:05:20,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {496#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {497#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:20,373 INFO L272 TraceCheckUtils]: 16: Hoare triple {497#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:05:20,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {498#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L15: 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] {499#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:05:20,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#(not (= __VERIFIER_assert_~cond 0))} [65] L15-->L16: 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[] {486#false} is VALID [2022-04-15 00:05:20,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {486#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-15 00:05:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 00:05:20,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:20,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669178457] [2022-04-15 00:05:20,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669178457] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:20,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204688419] [2022-04-15 00:05:20,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:05:20,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:20,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:05:20,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:05:20,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:05:20,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:05:20,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 00:05:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:20,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:20,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} [52] 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) 10) (= (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] {485#true} is VALID [2022-04-15 00:05:20,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:20,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:20,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:20,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {491#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:20,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {528#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:20,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {528#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:20,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {528#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {535#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} is VALID [2022-04-15 00:05:20,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {539#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-15 00:05:20,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {543#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-15 00:05:20,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 2))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {547#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-15 00:05:20,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {547#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {551#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-15 00:05:20,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {555#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-15 00:05:20,865 INFO L272 TraceCheckUtils]: 16: Hoare triple {555#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:20,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L15: 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] {563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:20,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {563#(<= 1 __VERIFIER_assert_~cond)} [65] L15-->L16: 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[] {486#false} is VALID [2022-04-15 00:05:20,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {486#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-15 00:05:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:20,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:21,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {486#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-15 00:05:21,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {563#(<= 1 __VERIFIER_assert_~cond)} [65] L15-->L16: 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[] {486#false} is VALID [2022-04-15 00:05:21,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L15: 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] {563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:21,302 INFO L272 TraceCheckUtils]: 16: Hoare triple {579#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:21,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {583#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {579#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:21,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {587#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {583#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:21,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {591#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {587#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:21,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {595#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {591#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:21,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {595#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:21,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {599#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:21,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {603#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-15 00:05:21,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {603#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-15 00:05:21,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {610#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-15 00:05:21,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {614#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-15 00:05:21,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {614#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-15 00:05:21,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:21,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:21,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:21,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} [52] 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) 10) (= (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] {485#true} is VALID [2022-04-15 00:05:21,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-15 00:05:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:21,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204688419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:21,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:21,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-04-15 00:05:21,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738142926] [2022-04-15 00:05:21,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:21,311 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 00:05:21,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:21,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:21,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:21,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 00:05:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:21,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 00:05:21,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2022-04-15 00:05:21,345 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:22,322 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 00:05:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 00:05:22,322 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 00:05:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-15 00:05:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-15 00:05:22,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 49 transitions. [2022-04-15 00:05:22,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:22,392 INFO L225 Difference]: With dead ends: 42 [2022-04-15 00:05:22,392 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 00:05:22,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=2083, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 00:05:22,393 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:22,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 76 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:05:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 00:05:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-15 00:05:22,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:22,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 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-15 00:05:22,407 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 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-15 00:05:22,407 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 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-15 00:05:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:22,408 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 00:05:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 00:05:22,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:22,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:22,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 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) Second operand 30 states. [2022-04-15 00:05:22,409 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 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) Second operand 30 states. [2022-04-15 00:05:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:22,410 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 00:05:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 00:05:22,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:22,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:22,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:22,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 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-15 00:05:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 00:05:22,411 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2022-04-15 00:05:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:22,411 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 00:05:22,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 00:05:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 00:05:22,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:22,412 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:22,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 00:05:22,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 00:05:22,624 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1657807639, now seen corresponding path program 1 times [2022-04-15 00:05:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:22,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029777067] [2022-04-15 00:05:22,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:22,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:22,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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] {836#true} is VALID [2022-04-15 00:05:22,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {836#true} {836#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:22,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 10) (= (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] {836#true} is VALID [2022-04-15 00:05:22,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {841#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 00:05:22,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {841#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 00:05:22,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#(= (+ (- 1) main_~i~0) 0)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {841#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 00:05:22,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#(= (+ (- 1) main_~i~0) 0)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {842#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:22,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(<= main_~i~0 2)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {842#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:22,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {842#(<= main_~i~0 2)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {842#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:22,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#(<= main_~i~0 2)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {843#(<= main_~i~0 3)} is VALID [2022-04-15 00:05:22,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {843#(<= main_~i~0 3)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {843#(<= main_~i~0 3)} is VALID [2022-04-15 00:05:22,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {843#(<= main_~i~0 3)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {843#(<= main_~i~0 3)} is VALID [2022-04-15 00:05:22,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {843#(<= main_~i~0 3)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {844#(<= main_~i~0 4)} is VALID [2022-04-15 00:05:22,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {844#(<= main_~i~0 4)} is VALID [2022-04-15 00:05:22,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#(<= main_~i~0 4)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {844#(<= main_~i~0 4)} is VALID [2022-04-15 00:05:22,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {844#(<= main_~i~0 4)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {845#(<= main_~i~0 5)} is VALID [2022-04-15 00:05:22,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#(<= main_~i~0 5)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {845#(<= main_~i~0 5)} is VALID [2022-04-15 00:05:22,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#(<= main_~i~0 5)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 10)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:22,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {837#false} is VALID [2022-04-15 00:05:22,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {837#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:22,726 INFO L272 TraceCheckUtils]: 22: Hoare triple {837#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {837#false} is VALID [2022-04-15 00:05:22,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#false} [63] __VERIFIER_assertENTRY-->L15: 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] {837#false} is VALID [2022-04-15 00:05:22,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {837#false} [65] L15-->L16: 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[] {837#false} is VALID [2022-04-15 00:05:22,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {837#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:22,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:22,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029777067] [2022-04-15 00:05:22,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029777067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:22,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80727412] [2022-04-15 00:05:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:22,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:22,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:22,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:05:22,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 00:05:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:22,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 00:05:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:22,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:22,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} [52] 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) 10) (= (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] {836#true} is VALID [2022-04-15 00:05:22,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:22,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {865#(<= main_~i~0 1)} is VALID [2022-04-15 00:05:22,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {865#(<= main_~i~0 1)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {865#(<= main_~i~0 1)} is VALID [2022-04-15 00:05:22,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {865#(<= main_~i~0 1)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {865#(<= main_~i~0 1)} is VALID [2022-04-15 00:05:22,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(<= main_~i~0 1)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {842#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:22,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(<= main_~i~0 2)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {842#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:22,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {842#(<= main_~i~0 2)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {842#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:22,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#(<= main_~i~0 2)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {843#(<= main_~i~0 3)} is VALID [2022-04-15 00:05:22,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {843#(<= main_~i~0 3)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {843#(<= main_~i~0 3)} is VALID [2022-04-15 00:05:22,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {843#(<= main_~i~0 3)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {843#(<= main_~i~0 3)} is VALID [2022-04-15 00:05:22,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {843#(<= main_~i~0 3)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {844#(<= main_~i~0 4)} is VALID [2022-04-15 00:05:22,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {844#(<= main_~i~0 4)} is VALID [2022-04-15 00:05:22,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#(<= main_~i~0 4)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {844#(<= main_~i~0 4)} is VALID [2022-04-15 00:05:22,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {844#(<= main_~i~0 4)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {845#(<= main_~i~0 5)} is VALID [2022-04-15 00:05:22,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#(<= main_~i~0 5)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {845#(<= main_~i~0 5)} is VALID [2022-04-15 00:05:22,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#(<= main_~i~0 5)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 10)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:22,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {837#false} is VALID [2022-04-15 00:05:22,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {837#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:22,875 INFO L272 TraceCheckUtils]: 22: Hoare triple {837#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {837#false} is VALID [2022-04-15 00:05:22,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#false} [63] __VERIFIER_assertENTRY-->L15: 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] {837#false} is VALID [2022-04-15 00:05:22,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {837#false} [65] L15-->L16: 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[] {837#false} is VALID [2022-04-15 00:05:22,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {837#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:22,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:23,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {837#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:23,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {837#false} [65] L15-->L16: 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[] {837#false} is VALID [2022-04-15 00:05:23,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#false} [63] __VERIFIER_assertENTRY-->L15: 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] {837#false} is VALID [2022-04-15 00:05:23,001 INFO L272 TraceCheckUtils]: 22: Hoare triple {837#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {837#false} is VALID [2022-04-15 00:05:23,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {837#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:23,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {837#false} is VALID [2022-04-15 00:05:23,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {944#(< main_~i~0 10)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 10)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {837#false} is VALID [2022-04-15 00:05:23,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {944#(< main_~i~0 10)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {944#(< main_~i~0 10)} is VALID [2022-04-15 00:05:23,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {951#(< main_~i~0 9)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {944#(< main_~i~0 10)} is VALID [2022-04-15 00:05:23,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {951#(< main_~i~0 9)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {951#(< main_~i~0 9)} is VALID [2022-04-15 00:05:23,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#(< main_~i~0 9)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {951#(< main_~i~0 9)} is VALID [2022-04-15 00:05:23,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {961#(< main_~i~0 8)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {951#(< main_~i~0 9)} is VALID [2022-04-15 00:05:23,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {961#(< main_~i~0 8)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {961#(< main_~i~0 8)} is VALID [2022-04-15 00:05:23,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {961#(< main_~i~0 8)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {961#(< main_~i~0 8)} is VALID [2022-04-15 00:05:23,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {971#(< main_~i~0 7)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {961#(< main_~i~0 8)} is VALID [2022-04-15 00:05:23,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {971#(< main_~i~0 7)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {971#(< main_~i~0 7)} is VALID [2022-04-15 00:05:23,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#(< main_~i~0 7)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {971#(< main_~i~0 7)} is VALID [2022-04-15 00:05:23,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(<= main_~i~0 5)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {971#(< main_~i~0 7)} is VALID [2022-04-15 00:05:23,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(<= main_~i~0 5)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {845#(<= main_~i~0 5)} is VALID [2022-04-15 00:05:23,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#(<= main_~i~0 5)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {845#(<= main_~i~0 5)} is VALID [2022-04-15 00:05:23,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {845#(<= main_~i~0 5)} is VALID [2022-04-15 00:05:23,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:23,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:23,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:23,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} [52] 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) 10) (= (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] {836#true} is VALID [2022-04-15 00:05:23,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {836#true} is VALID [2022-04-15 00:05:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:23,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80727412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:23,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:23,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-15 00:05:23,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718775166] [2022-04-15 00:05:23,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 00:05:23,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:23,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:23,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:23,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 00:05:23,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:23,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 00:05:23,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:05:23,041 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:23,193 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-15 00:05:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 00:05:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 00:05:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-15 00:05:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-15 00:05:23,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-15 00:05:23,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:23,238 INFO L225 Difference]: With dead ends: 52 [2022-04-15 00:05:23,238 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 00:05:23,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2022-04-15 00:05:23,239 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:23,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 24 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:05:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 00:05:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 00:05:23,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:23,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 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-15 00:05:23,265 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 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-15 00:05:23,265 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 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-15 00:05:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:23,267 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 00:05:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 00:05:23,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:23,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:23,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 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) Second operand 44 states. [2022-04-15 00:05:23,270 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 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) Second operand 44 states. [2022-04-15 00:05:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:23,273 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 00:05:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 00:05:23,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:23,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:23,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:23,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 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-15 00:05:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-15 00:05:23,276 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 26 [2022-04-15 00:05:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:23,276 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-15 00:05:23,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 00:05:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 00:05:23,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:23,280 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:23,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 00:05:23,496 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:23,496 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2063074549, now seen corresponding path program 2 times [2022-04-15 00:05:23,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:23,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462269777] [2022-04-15 00:05:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:05:23,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 00:05:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:05:23,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 00:05:23,574 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 00:05:23,575 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:05:23,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 00:05:23,578 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-15 00:05:23,579 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:05:23,597 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:05:23,598 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:05:23,598 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:05:23,598 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:05:23,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:05:23 BasicIcfg [2022-04-15 00:05:23,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:05:23,599 INFO L158 Benchmark]: Toolchain (without parser) took 6297.93ms. Allocated memory was 231.7MB in the beginning and 293.6MB in the end (delta: 61.9MB). Free memory was 204.3MB in the beginning and 142.6MB in the end (delta: 61.7MB). Peak memory consumption was 123.3MB. Max. memory is 8.0GB. [2022-04-15 00:05:23,599 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 231.7MB. Free memory is still 189.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:05:23,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.71ms. Allocated memory was 231.7MB in the beginning and 293.6MB in the end (delta: 61.9MB). Free memory was 204.0MB in the beginning and 264.1MB in the end (delta: -60.0MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-15 00:05:23,599 INFO L158 Benchmark]: Boogie Preprocessor took 20.04ms. Allocated memory is still 293.6MB. Free memory was 264.1MB in the beginning and 262.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:05:23,599 INFO L158 Benchmark]: RCFGBuilder took 280.12ms. Allocated memory is still 293.6MB. Free memory was 262.5MB in the beginning and 252.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 00:05:23,600 INFO L158 Benchmark]: IcfgTransformer took 31.11ms. Allocated memory is still 293.6MB. Free memory was 252.0MB in the beginning and 250.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:05:23,600 INFO L158 Benchmark]: TraceAbstraction took 5766.56ms. Allocated memory is still 293.6MB. Free memory was 249.9MB in the beginning and 142.6MB in the end (delta: 107.2MB). Peak memory consumption was 108.2MB. Max. memory is 8.0GB. [2022-04-15 00:05:23,601 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.10ms. Allocated memory is still 231.7MB. Free memory is still 189.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.71ms. Allocated memory was 231.7MB in the beginning and 293.6MB in the end (delta: 61.9MB). Free memory was 204.0MB in the beginning and 264.1MB in the end (delta: -60.0MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.04ms. Allocated memory is still 293.6MB. Free memory was 264.1MB in the beginning and 262.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 280.12ms. Allocated memory is still 293.6MB. Free memory was 262.5MB in the beginning and 252.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 31.11ms. Allocated memory is still 293.6MB. Free memory was 252.0MB in the beginning and 250.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5766.56ms. Allocated memory is still 293.6MB. Free memory was 249.9MB in the beginning and 142.6MB in the end (delta: 107.2MB). Peak memory consumption was 108.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 VAL [i=1, n=0, n=10] [L24] COND TRUE i<=n VAL [i=1, n=0, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=1, n=10, n=2] [L24] i++ VAL [i=2, n=2, n=10] [L24] COND TRUE i<=n VAL [i=2, n=10, n=2] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=2, n=4, n=10] [L24] i++ VAL [i=3, n=10, n=4] [L24] COND TRUE i<=n VAL [i=3, n=4, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=3, n=10, n=6] [L24] i++ VAL [i=4, n=6, n=10] [L24] COND TRUE i<=n VAL [i=4, n=10, n=6] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=4, n=8, n=10] [L24] i++ VAL [i=5, n=8, n=10] [L24] COND TRUE i<=n VAL [i=5, n=8, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=5, n=10, n=10] [L24] i++ VAL [i=6, n=10, n=10] [L24] COND TRUE i<=n VAL [i=6, n=10, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=6, n=12, n=10] [L24] i++ VAL [i=7, n=12, n=10] [L24] COND TRUE i<=n VAL [i=7, n=10, n=12] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=7, n=14, n=10] [L24] i++ VAL [i=8, n=14, n=10] [L24] COND TRUE i<=n VAL [i=8, n=10, n=14] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=8, n=16, n=10] [L24] i++ VAL [i=9, n=10, n=16] [L24] COND TRUE i<=n VAL [i=9, n=10, n=16] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=9, n=10, n=18] [L24] i++ VAL [i=10, n=18, n=10] [L24] COND TRUE i<=n VAL [i=10, n=10, n=18] [L25] COND FALSE !(i<10) VAL [i=10, n=10, n=18] [L24] i++ VAL [i=11, n=10, n=18] [L24] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517 IncrementalHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 62 mSDtfsCounter, 517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=5, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1066 SizeOfPredicates, 6 NumberOfNonLiveVariables, 205 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 28/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 00:05:23,628 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...