/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:29:14,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:29:14,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:29:14,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:29:14,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:29:14,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:29:14,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:29:14,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:29:14,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:29:14,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:29:14,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:29:14,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:29:14,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:29:14,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:29:14,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:29:14,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:29:14,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:29:14,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:29:14,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:29:14,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:29:14,575 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:29:14,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:29:14,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:29:14,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:29:14,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:29:14,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:29:14,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:29:14,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:29:14,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:29:14,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:29:14,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:29:14,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:29:14,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:29:14,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:29:14,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:29:14,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:29:14,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:29:14,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:29:14,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:29:14,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:29:14,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:29:14,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:29:14,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:29:14,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:29:14,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:29:14,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:29:14,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:29:14,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:29:14,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:29:14,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:29:14,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:29:14,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:29:14,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:29:14,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:29:14,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:29:14,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:29:14,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:29:14,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:29:14,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:29:14,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:29:14,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:29:14,604 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:29:14,604 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:29:14,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:29:14,605 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:29:14,605 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 09:29:14,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:29:14,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:29:14,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:29:14,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:29:14,875 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:29:14,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-08 09:29:14,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831a86025/7aae63e027b143938bb8bede4d8c6c86/FLAG0f347ac55 [2022-04-08 09:29:15,348 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:29:15,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-08 09:29:15,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831a86025/7aae63e027b143938bb8bede4d8c6c86/FLAG0f347ac55 [2022-04-08 09:29:15,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831a86025/7aae63e027b143938bb8bede4d8c6c86 [2022-04-08 09:29:15,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:29:15,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:29:15,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:29:15,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:29:15,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:29:15,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6814360b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15, skipping insertion in model container [2022-04-08 09:29:15,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:29:15,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:29:15,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i[893,906] [2022-04-08 09:29:15,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:29:15,677 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:29:15,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i[893,906] [2022-04-08 09:29:15,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:29:15,719 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:29:15,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15 WrapperNode [2022-04-08 09:29:15,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:29:15,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:29:15,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:29:15,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:29:15,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:29:15,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:29:15,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:29:15,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:29:15,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (1/1) ... [2022-04-08 09:29:15,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:29:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:15,805 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-08 09:29:15,822 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-08 09:29:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:29:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:29:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:29:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:29:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:29:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:29:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:29:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:29:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:29:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:29:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:29:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:29:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:29:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:29:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:29:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:29:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:29:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:29:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:29:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:29:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:29:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:29:15,929 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:29:15,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:29:16,198 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:29:16,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:29:16,204 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 09:29:16,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:29:16 BoogieIcfgContainer [2022-04-08 09:29:16,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:29:16,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:29:16,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:29:16,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:29:16,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:29:15" (1/3) ... [2022-04-08 09:29:16,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d64879c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:29:16, skipping insertion in model container [2022-04-08 09:29:16,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:29:15" (2/3) ... [2022-04-08 09:29:16,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d64879c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:29:16, skipping insertion in model container [2022-04-08 09:29:16,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:29:16" (3/3) ... [2022-04-08 09:29:16,213 INFO L111 eAbstractionObserver]: Analyzing ICFG nested9.i [2022-04-08 09:29:16,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:29:16,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:29:16,252 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:29:16,264 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:29:16,264 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:29:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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-08 09:29:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:29:16,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:16,288 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:16,289 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2111647297, now seen corresponding path program 1 times [2022-04-08 09:29:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:16,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [984428998] [2022-04-08 09:29:16,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:29:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2111647297, now seen corresponding path program 2 times [2022-04-08 09:29:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:16,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009856684] [2022-04-08 09:29:16,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:16,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {32#true} is VALID [2022-04-08 09:29:16,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 09:29:16,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-08 09:29:16,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:16,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {32#true} is VALID [2022-04-08 09:29:16,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 09:29:16,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-08 09:29:16,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2022-04-08 09:29:16,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {32#true} is VALID [2022-04-08 09:29:16,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {32#true} is VALID [2022-04-08 09:29:16,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {32#true} is VALID [2022-04-08 09:29:16,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {32#true} is VALID [2022-04-08 09:29:16,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {32#true} is VALID [2022-04-08 09:29:16,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} ~i~0 := 0; {37#(= main_~i~0 0)} is VALID [2022-04-08 09:29:16,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:16,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:16,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 < ~j~0); {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:16,740 INFO L272 TraceCheckUtils]: 14: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {40#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:16,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:16,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-08 09:29:16,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 09:29:16,744 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-08 09:29:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:16,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009856684] [2022-04-08 09:29:16,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009856684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:16,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:16,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:29:16,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:16,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [984428998] [2022-04-08 09:29:16,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [984428998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:16,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:16,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:29:16,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205265878] [2022-04-08 09:29:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:16,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-08 09:29:16,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:16,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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-08 09:29:16,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:16,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:29:16,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:29:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:29:16,817 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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-08 09:29:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,452 INFO L93 Difference]: Finished difference Result 67 states and 98 transitions. [2022-04-08 09:29:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:29:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-08 09:29:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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-08 09:29:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-08 09:29:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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-08 09:29:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-08 09:29:17,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-08 09:29:17,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:17,568 INFO L225 Difference]: With dead ends: 67 [2022-04-08 09:29:17,568 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 09:29:17,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:29:17,574 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:17,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:29:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 09:29:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-08 09:29:17,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:17,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:17,610 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:17,610 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,621 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 09:29:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 09:29:17,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:17,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:17,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-08 09:29:17,623 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-08 09:29:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:17,626 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 09:29:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 09:29:17,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:17,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:17,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:17,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-08 09:29:17,636 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2022-04-08 09:29:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:17,642 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-08 09:29:17,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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-08 09:29:17,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-08 09:29:17,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 09:29:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:29:17,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:17,696 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:17,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:29:17,696 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 192634036, now seen corresponding path program 1 times [2022-04-08 09:29:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:17,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68037054] [2022-04-08 09:29:17,724 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:17,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:17,725 INFO L85 PathProgramCache]: Analyzing trace with hash 192634036, now seen corresponding path program 2 times [2022-04-08 09:29:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:17,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556816326] [2022-04-08 09:29:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {357#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {345#true} is VALID [2022-04-08 09:29:17,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-08 09:29:17,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #94#return; {345#true} is VALID [2022-04-08 09:29:17,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {357#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:17,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {345#true} is VALID [2022-04-08 09:29:17,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-08 09:29:17,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #94#return; {345#true} is VALID [2022-04-08 09:29:17,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret7 := main(); {345#true} is VALID [2022-04-08 09:29:17,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {345#true} is VALID [2022-04-08 09:29:17,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {345#true} is VALID [2022-04-08 09:29:17,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {345#true} is VALID [2022-04-08 09:29:17,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {345#true} is VALID [2022-04-08 09:29:17,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {345#true} is VALID [2022-04-08 09:29:17,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {345#true} ~i~0 := 0; {350#(= main_~i~0 0)} is VALID [2022-04-08 09:29:17,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {350#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {351#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:17,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} assume !(~j~0 < 3 * ~i~0); {351#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:17,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {351#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {352#(<= 1 main_~n~0)} is VALID [2022-04-08 09:29:17,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {352#(<= 1 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {353#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:17,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {353#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:17,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {353#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {354#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:17,908 INFO L272 TraceCheckUtils]: 17: Hoare triple {354#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {355#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:17,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {355#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {356#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:17,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {346#false} is VALID [2022-04-08 09:29:17,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-04-08 09:29:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:29:17,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:17,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556816326] [2022-04-08 09:29:17,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556816326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:17,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628200407] [2022-04-08 09:29:17,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:17,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:17,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:17,912 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-08 09:29:17,914 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-08 09:29:17,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 09:29:17,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:17,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:29:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:17,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:18,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2022-04-08 09:29:18,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {345#true} is VALID [2022-04-08 09:29:18,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2022-04-08 09:29:18,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #94#return; {345#true} is VALID [2022-04-08 09:29:18,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret7 := main(); {345#true} is VALID [2022-04-08 09:29:18,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {345#true} is VALID [2022-04-08 09:29:18,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {345#true} is VALID [2022-04-08 09:29:18,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {345#true} is VALID [2022-04-08 09:29:18,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {345#true} is VALID [2022-04-08 09:29:18,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {345#true} is VALID [2022-04-08 09:29:18,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {345#true} ~i~0 := 0; {345#true} is VALID [2022-04-08 09:29:18,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {345#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {345#true} is VALID [2022-04-08 09:29:18,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#true} assume !(~j~0 < 3 * ~i~0); {345#true} is VALID [2022-04-08 09:29:18,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {345#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {345#true} is VALID [2022-04-08 09:29:18,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {345#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {403#(and (< main_~i~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0))} is VALID [2022-04-08 09:29:18,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {403#(and (< main_~i~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {407#(and (< main_~i~0 main_~n~0) (< 0 main_~i~0) (<= main_~k~0 main_~i~0))} is VALID [2022-04-08 09:29:18,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {407#(and (< main_~i~0 main_~n~0) (< 0 main_~i~0) (<= main_~k~0 main_~i~0))} assume !!(~k~0 < ~j~0); {407#(and (< main_~i~0 main_~n~0) (< 0 main_~i~0) (<= main_~k~0 main_~i~0))} is VALID [2022-04-08 09:29:18,484 INFO L272 TraceCheckUtils]: 17: Hoare triple {407#(and (< main_~i~0 main_~n~0) (< 0 main_~i~0) (<= main_~k~0 main_~i~0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {414#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:18,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {414#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {418#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:18,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {418#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {346#false} is VALID [2022-04-08 09:29:18,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-04-08 09:29:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:29:18,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:29:18,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628200407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:18,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:29:18,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-04-08 09:29:18,487 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:18,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68037054] [2022-04-08 09:29:18,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68037054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:18,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:18,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:29:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536231180] [2022-04-08 09:29:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:18,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 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 21 [2022-04-08 09:29:18,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:18,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 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-08 09:29:18,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:18,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:29:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:29:18,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:29:18,509 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 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-08 09:29:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:18,718 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-04-08 09:29:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:29:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 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 21 [2022-04-08 09:29:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 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-08 09:29:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-04-08 09:29:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 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-08 09:29:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-04-08 09:29:18,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2022-04-08 09:29:18,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:18,771 INFO L225 Difference]: With dead ends: 68 [2022-04-08 09:29:18,771 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 09:29:18,775 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:29:18,776 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:18,777 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 69 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:29:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 09:29:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-04-08 09:29:18,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:18,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:18,813 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:18,814 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:18,825 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 09:29:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 09:29:18,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:18,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:18,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 44 states. [2022-04-08 09:29:18,828 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 44 states. [2022-04-08 09:29:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:18,833 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 09:29:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 09:29:18,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:18,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:18,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:18,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-08 09:29:18,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2022-04-08 09:29:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:18,836 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-08 09:29:18,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 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-08 09:29:18,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-08 09:29:18,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 09:29:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 09:29:18,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:18,883 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:18,910 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-08 09:29:19,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:19,098 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash -450009679, now seen corresponding path program 1 times [2022-04-08 09:29:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:19,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2056768344] [2022-04-08 09:29:19,165 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:19,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash -450009679, now seen corresponding path program 2 times [2022-04-08 09:29:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:19,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194379223] [2022-04-08 09:29:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {727#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {712#true} is VALID [2022-04-08 09:29:19,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 09:29:19,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {712#true} {712#true} #94#return; {712#true} is VALID [2022-04-08 09:29:19,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-08 09:29:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-08 09:29:19,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-08 09:29:19,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 09:29:19,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} #92#return; {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {727#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:19,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {727#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {712#true} is VALID [2022-04-08 09:29:19,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 09:29:19,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #94#return; {712#true} is VALID [2022-04-08 09:29:19,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-08 09:29:19,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {712#true} is VALID [2022-04-08 09:29:19,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {712#true} is VALID [2022-04-08 09:29:19,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {712#true} is VALID [2022-04-08 09:29:19,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {712#true} is VALID [2022-04-08 09:29:19,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {712#true} is VALID [2022-04-08 09:29:19,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {712#true} ~i~0 := 0; {717#(= main_~i~0 0)} is VALID [2022-04-08 09:29:19,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {718#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {718#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 < ~j~0); {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,302 INFO L272 TraceCheckUtils]: 14: Hoare triple {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {712#true} is VALID [2022-04-08 09:29:19,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-08 09:29:19,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-08 09:29:19,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 09:29:19,304 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {712#true} {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} #92#return; {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {719#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {724#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} assume !!(~k~0 < ~j~0); {724#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:29:19,306 INFO L272 TraceCheckUtils]: 21: Hoare triple {724#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {725#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:19,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {725#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {726#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:19,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {726#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {713#false} is VALID [2022-04-08 09:29:19,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-08 09:29:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:29:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:19,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194379223] [2022-04-08 09:29:19,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194379223] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:19,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036816266] [2022-04-08 09:29:19,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:19,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:19,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:19,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:19,331 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-08 09:29:19,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 09:29:19,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:19,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 09:29:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:19,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:19,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-08 09:29:19,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {712#true} is VALID [2022-04-08 09:29:19,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 09:29:19,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #94#return; {712#true} is VALID [2022-04-08 09:29:19,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-08 09:29:19,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {712#true} is VALID [2022-04-08 09:29:19,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {712#true} is VALID [2022-04-08 09:29:19,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {712#true} is VALID [2022-04-08 09:29:19,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {712#true} is VALID [2022-04-08 09:29:19,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {712#true} is VALID [2022-04-08 09:29:19,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {712#true} ~i~0 := 0; {761#(<= main_~i~0 0)} is VALID [2022-04-08 09:29:19,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {761#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {765#(and (<= main_~i~0 0) (<= (* main_~i~0 2) main_~j~0))} is VALID [2022-04-08 09:29:19,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {765#(and (<= main_~i~0 0) (<= (* main_~i~0 2) main_~j~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {713#false} is VALID [2022-04-08 09:29:19,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#false} assume !!(~k~0 < ~j~0); {713#false} is VALID [2022-04-08 09:29:19,478 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {713#false} is VALID [2022-04-08 09:29:19,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {713#false} ~cond := #in~cond; {713#false} is VALID [2022-04-08 09:29:19,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {713#false} assume !(0 == ~cond); {713#false} is VALID [2022-04-08 09:29:19,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {713#false} assume true; {713#false} is VALID [2022-04-08 09:29:19,487 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {713#false} {713#false} #92#return; {713#false} is VALID [2022-04-08 09:29:19,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {713#false} is VALID [2022-04-08 09:29:19,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#false} assume !!(~k~0 < ~j~0); {713#false} is VALID [2022-04-08 09:29:19,488 INFO L272 TraceCheckUtils]: 21: Hoare triple {713#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {713#false} is VALID [2022-04-08 09:29:19,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {713#false} ~cond := #in~cond; {713#false} is VALID [2022-04-08 09:29:19,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {713#false} assume 0 == ~cond; {713#false} is VALID [2022-04-08 09:29:19,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-08 09:29:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:29:19,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:29:19,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036816266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:19,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:29:19,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-04-08 09:29:19,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:19,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2056768344] [2022-04-08 09:29:19,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2056768344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:19,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:19,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:29:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763465864] [2022-04-08 09:29:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-08 09:29:19,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:19,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:19,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:19,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:29:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:19,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:29:19,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:29:19,511 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:19,590 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-08 09:29:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:29:19,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-08 09:29:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-08 09:29:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-08 09:29:19,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-08 09:29:19,622 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-08 09:29:19,624 INFO L225 Difference]: With dead ends: 52 [2022-04-08 09:29:19,624 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 09:29:19,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:29:19,625 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:19,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:29:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 09:29:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-08 09:29:19,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:19,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:19,654 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:19,654 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:19,655 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 09:29:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 09:29:19,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:19,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:19,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 09:29:19,656 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 09:29:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:19,658 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 09:29:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 09:29:19,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:19,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:19,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:19,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-08 09:29:19,660 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2022-04-08 09:29:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:19,660 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-08 09:29:19,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:19,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-08 09:29:19,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-08 09:29:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 09:29:19,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:19,696 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:19,716 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-08 09:29:19,905 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,SelfDestructingSolverStorable2 [2022-04-08 09:29:19,906 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1971686684, now seen corresponding path program 1 times [2022-04-08 09:29:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:19,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [870649170] [2022-04-08 09:29:19,916 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:19,916 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1971686684, now seen corresponding path program 2 times [2022-04-08 09:29:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:19,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725339208] [2022-04-08 09:29:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:20,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1038#true} is VALID [2022-04-08 09:29:20,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-04-08 09:29:20,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1038#true} {1038#true} #94#return; {1038#true} is VALID [2022-04-08 09:29:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:29:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:20,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {1038#true} ~cond := #in~cond; {1038#true} is VALID [2022-04-08 09:29:20,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#true} assume !(0 == ~cond); {1038#true} is VALID [2022-04-08 09:29:20,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-04-08 09:29:20,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1038#true} {1046#(<= main_~j~0 (+ main_~k~0 1))} #92#return; {1046#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-08 09:29:20,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {1038#true} call ULTIMATE.init(); {1052#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:20,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1038#true} is VALID [2022-04-08 09:29:20,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-04-08 09:29:20,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1038#true} {1038#true} #94#return; {1038#true} is VALID [2022-04-08 09:29:20,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {1038#true} call #t~ret7 := main(); {1038#true} is VALID [2022-04-08 09:29:20,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1038#true} is VALID [2022-04-08 09:29:20,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1038#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1038#true} is VALID [2022-04-08 09:29:20,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {1038#true} ~i~0 := 0; {1043#(= main_~i~0 0)} is VALID [2022-04-08 09:29:20,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1043#(= main_~i~0 0)} is VALID [2022-04-08 09:29:20,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {1043#(= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {1043#(= main_~i~0 0)} is VALID [2022-04-08 09:29:20,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {1043#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1044#(<= main_~i~0 1)} is VALID [2022-04-08 09:29:20,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1045#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-08 09:29:20,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {1045#(<= main_~j~0 (+ main_~i~0 1))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1046#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-08 09:29:20,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {1046#(<= main_~j~0 (+ main_~k~0 1))} assume !!(~k~0 < ~j~0); {1046#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-08 09:29:20,054 INFO L272 TraceCheckUtils]: 17: Hoare triple {1046#(<= main_~j~0 (+ main_~k~0 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1038#true} is VALID [2022-04-08 09:29:20,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {1038#true} ~cond := #in~cond; {1038#true} is VALID [2022-04-08 09:29:20,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {1038#true} assume !(0 == ~cond); {1038#true} is VALID [2022-04-08 09:29:20,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-04-08 09:29:20,055 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1038#true} {1046#(<= main_~j~0 (+ main_~k~0 1))} #92#return; {1046#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-08 09:29:20,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {1046#(<= main_~j~0 (+ main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1051#(<= main_~j~0 main_~k~0)} is VALID [2022-04-08 09:29:20,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {1051#(<= main_~j~0 main_~k~0)} assume !!(~k~0 < ~j~0); {1039#false} is VALID [2022-04-08 09:29:20,056 INFO L272 TraceCheckUtils]: 24: Hoare triple {1039#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1039#false} is VALID [2022-04-08 09:29:20,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {1039#false} ~cond := #in~cond; {1039#false} is VALID [2022-04-08 09:29:20,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {1039#false} assume 0 == ~cond; {1039#false} is VALID [2022-04-08 09:29:20,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2022-04-08 09:29:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:29:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:20,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725339208] [2022-04-08 09:29:20,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725339208] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:20,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217648546] [2022-04-08 09:29:20,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:20,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:20,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:20,061 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-08 09:29:20,083 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-08 09:29:20,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 09:29:20,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:20,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:29:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:20,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:20,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {1038#true} call ULTIMATE.init(); {1038#true} is VALID [2022-04-08 09:29:20,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1038#true} is VALID [2022-04-08 09:29:20,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-04-08 09:29:20,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1038#true} {1038#true} #94#return; {1038#true} is VALID [2022-04-08 09:29:20,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {1038#true} call #t~ret7 := main(); {1038#true} is VALID [2022-04-08 09:29:20,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1038#true} is VALID [2022-04-08 09:29:20,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {1038#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1038#true} is VALID [2022-04-08 09:29:20,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {1038#true} ~i~0 := 0; {1038#true} is VALID [2022-04-08 09:29:20,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {1038#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1038#true} is VALID [2022-04-08 09:29:20,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {1038#true} assume !(~j~0 < 3 * ~i~0); {1038#true} is VALID [2022-04-08 09:29:20,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {1038#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1038#true} is VALID [2022-04-08 09:29:20,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {1038#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1098#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:20,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#(< main_~i~0 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:20,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:20,487 INFO L272 TraceCheckUtils]: 17: Hoare triple {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1038#true} is VALID [2022-04-08 09:29:20,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {1038#true} ~cond := #in~cond; {1038#true} is VALID [2022-04-08 09:29:20,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {1038#true} assume !(0 == ~cond); {1038#true} is VALID [2022-04-08 09:29:20,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-04-08 09:29:20,488 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1038#true} {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #92#return; {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:20,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:20,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {1102#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {1127#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} is VALID [2022-04-08 09:29:20,490 INFO L272 TraceCheckUtils]: 24: Hoare triple {1127#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:20,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:20,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {1135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1039#false} is VALID [2022-04-08 09:29:20,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2022-04-08 09:29:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:29:20,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:20,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2022-04-08 09:29:20,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {1135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1039#false} is VALID [2022-04-08 09:29:20,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:20,671 INFO L272 TraceCheckUtils]: 24: Hoare triple {1151#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:20,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {1151#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:20,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:20,673 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1038#true} {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #92#return; {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:20,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-04-08 09:29:20,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {1038#true} assume !(0 == ~cond); {1038#true} is VALID [2022-04-08 09:29:20,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {1038#true} ~cond := #in~cond; {1038#true} is VALID [2022-04-08 09:29:20,674 INFO L272 TraceCheckUtils]: 17: Hoare triple {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1038#true} is VALID [2022-04-08 09:29:20,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:20,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {1180#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1155#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:20,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {1038#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1180#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:20,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {1038#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1038#true} is VALID [2022-04-08 09:29:20,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {1038#true} assume !(~j~0 < 3 * ~i~0); {1038#true} is VALID [2022-04-08 09:29:20,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {1038#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1038#true} is VALID [2022-04-08 09:29:20,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {1038#true} ~i~0 := 0; {1038#true} is VALID [2022-04-08 09:29:20,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1038#true} is VALID [2022-04-08 09:29:20,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1038#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1038#true} is VALID [2022-04-08 09:29:20,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1038#true} is VALID [2022-04-08 09:29:20,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {1038#true} call #t~ret7 := main(); {1038#true} is VALID [2022-04-08 09:29:20,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1038#true} {1038#true} #94#return; {1038#true} is VALID [2022-04-08 09:29:20,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#true} assume true; {1038#true} is VALID [2022-04-08 09:29:20,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1038#true} is VALID [2022-04-08 09:29:20,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {1038#true} call ULTIMATE.init(); {1038#true} is VALID [2022-04-08 09:29:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:29:20,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217648546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:20,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:20,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-04-08 09:29:20,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:20,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [870649170] [2022-04-08 09:29:20,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [870649170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:20,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:20,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:29:20,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255151587] [2022-04-08 09:29:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:20,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-08 09:29:20,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:20,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:20,703 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-08 09:29:20,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:29:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:29:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:29:20,705 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:21,187 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-04-08 09:29:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:29:21,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-08 09:29:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-08 09:29:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-08 09:29:21,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2022-04-08 09:29:21,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:21,269 INFO L225 Difference]: With dead ends: 66 [2022-04-08 09:29:21,269 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 09:29:21,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:29:21,270 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:21,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 40 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:29:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 09:29:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-04-08 09:29:21,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:21,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:21,341 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:21,341 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:21,344 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-08 09:29:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-08 09:29:21,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:21,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:21,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-08 09:29:21,346 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-08 09:29:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:21,348 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-08 09:29:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-08 09:29:21,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:21,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:21,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:21,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-08 09:29:21,350 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 28 [2022-04-08 09:29:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:21,352 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-08 09:29:21,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:21,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2022-04-08 09:29:21,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-08 09:29:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 09:29:21,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:21,408 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:21,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:21,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:21,632 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash -132601391, now seen corresponding path program 3 times [2022-04-08 09:29:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:21,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1214070029] [2022-04-08 09:29:21,637 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:21,638 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash -132601391, now seen corresponding path program 4 times [2022-04-08 09:29:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:21,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973261587] [2022-04-08 09:29:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {1569#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1552#true} is VALID [2022-04-08 09:29:21,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-04-08 09:29:21,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1552#true} {1552#true} #94#return; {1552#true} is VALID [2022-04-08 09:29:21,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-08 09:29:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {1552#true} ~cond := #in~cond; {1552#true} is VALID [2022-04-08 09:29:21,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {1552#true} assume !(0 == ~cond); {1552#true} is VALID [2022-04-08 09:29:21,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-04-08 09:29:21,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1552#true} {1561#(<= (+ 5 main_~k~0) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {1561#(<= (+ 5 main_~k~0) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:21,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {1552#true} call ULTIMATE.init(); {1569#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:21,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {1569#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1552#true} is VALID [2022-04-08 09:29:21,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-04-08 09:29:21,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1552#true} {1552#true} #94#return; {1552#true} is VALID [2022-04-08 09:29:21,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {1552#true} call #t~ret7 := main(); {1552#true} is VALID [2022-04-08 09:29:21,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {1552#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1552#true} is VALID [2022-04-08 09:29:21,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {1552#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1552#true} is VALID [2022-04-08 09:29:21,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {1552#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1552#true} is VALID [2022-04-08 09:29:21,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {1552#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1552#true} is VALID [2022-04-08 09:29:21,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {1552#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1552#true} is VALID [2022-04-08 09:29:21,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {1552#true} ~i~0 := 0; {1557#(= main_~i~0 0)} is VALID [2022-04-08 09:29:21,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {1557#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1557#(= main_~i~0 0)} is VALID [2022-04-08 09:29:21,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {1557#(= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {1557#(= main_~i~0 0)} is VALID [2022-04-08 09:29:21,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {1557#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1558#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:21,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {1558#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1558#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:21,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {1558#(<= 1 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {1558#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:21,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {1558#(<= 1 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1559#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:21,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {1559#(<= 2 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1560#(<= (+ main_~j~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:21,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {1560#(<= (+ main_~j~0 4) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1560#(<= (+ main_~j~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:21,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#(<= (+ main_~j~0 4) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {1561#(<= (+ 5 main_~k~0) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:21,772 INFO L272 TraceCheckUtils]: 20: Hoare triple {1561#(<= (+ 5 main_~k~0) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1552#true} is VALID [2022-04-08 09:29:21,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {1552#true} ~cond := #in~cond; {1552#true} is VALID [2022-04-08 09:29:21,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {1552#true} assume !(0 == ~cond); {1552#true} is VALID [2022-04-08 09:29:21,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-04-08 09:29:21,773 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1552#true} {1561#(<= (+ 5 main_~k~0) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {1561#(<= (+ 5 main_~k~0) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:21,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {1561#(<= (+ 5 main_~k~0) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1566#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:21,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {1566#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {1566#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:21,775 INFO L272 TraceCheckUtils]: 27: Hoare triple {1566#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1567#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:21,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {1567#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1568#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:21,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {1568#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1553#false} is VALID [2022-04-08 09:29:21,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2022-04-08 09:29:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:29:21,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:21,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973261587] [2022-04-08 09:29:21,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973261587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:21,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126468465] [2022-04-08 09:29:21,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:29:21,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:21,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:21,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:21,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 09:29:21,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:29:21,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:21,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:29:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:21,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:21,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {1552#true} call ULTIMATE.init(); {1552#true} is VALID [2022-04-08 09:29:21,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1552#true} is VALID [2022-04-08 09:29:21,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-04-08 09:29:21,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1552#true} {1552#true} #94#return; {1552#true} is VALID [2022-04-08 09:29:21,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {1552#true} call #t~ret7 := main(); {1552#true} is VALID [2022-04-08 09:29:21,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {1552#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1552#true} is VALID [2022-04-08 09:29:21,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {1552#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1552#true} is VALID [2022-04-08 09:29:21,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {1552#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1552#true} is VALID [2022-04-08 09:29:21,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {1552#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1552#true} is VALID [2022-04-08 09:29:21,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {1552#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1552#true} is VALID [2022-04-08 09:29:21,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {1552#true} ~i~0 := 0; {1603#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:21,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {1603#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1603#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:21,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {1603#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {1603#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:21,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {1603#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1558#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:21,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {1558#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1616#(and (<= main_~j~0 (* main_~i~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-08 09:29:21,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {1616#(and (<= main_~j~0 (* main_~i~0 2)) (<= 1 main_~i~0))} assume !(~j~0 < 3 * ~i~0); {1553#false} is VALID [2022-04-08 09:29:21,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {1553#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1553#false} is VALID [2022-04-08 09:29:21,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {1553#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1553#false} is VALID [2022-04-08 09:29:21,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {1553#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1553#false} is VALID [2022-04-08 09:29:21,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {1553#false} assume !!(~k~0 < ~j~0); {1553#false} is VALID [2022-04-08 09:29:21,966 INFO L272 TraceCheckUtils]: 20: Hoare triple {1553#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1553#false} is VALID [2022-04-08 09:29:21,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {1553#false} ~cond := #in~cond; {1553#false} is VALID [2022-04-08 09:29:21,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {1553#false} assume !(0 == ~cond); {1553#false} is VALID [2022-04-08 09:29:21,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {1553#false} assume true; {1553#false} is VALID [2022-04-08 09:29:21,966 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1553#false} {1553#false} #92#return; {1553#false} is VALID [2022-04-08 09:29:21,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {1553#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1553#false} is VALID [2022-04-08 09:29:21,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {1553#false} assume !!(~k~0 < ~j~0); {1553#false} is VALID [2022-04-08 09:29:21,967 INFO L272 TraceCheckUtils]: 27: Hoare triple {1553#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1553#false} is VALID [2022-04-08 09:29:21,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {1553#false} ~cond := #in~cond; {1553#false} is VALID [2022-04-08 09:29:21,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {1553#false} assume 0 == ~cond; {1553#false} is VALID [2022-04-08 09:29:21,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2022-04-08 09:29:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:29:21,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:29:21,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126468465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:21,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:29:21,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2022-04-08 09:29:21,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:21,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1214070029] [2022-04-08 09:29:21,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1214070029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:21,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:21,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:29:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711892207] [2022-04-08 09:29:21,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:21,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-04-08 09:29:21,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:21,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:21,989 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-08 09:29:21,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:29:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:21,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:29:21,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:29:21,990 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:22,223 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-08 09:29:22,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:29:22,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-04-08 09:29:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-04-08 09:29:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-04-08 09:29:22,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2022-04-08 09:29:22,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:22,274 INFO L225 Difference]: With dead ends: 72 [2022-04-08 09:29:22,274 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 09:29:22,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:29:22,279 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:22,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 63 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:29:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 09:29:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2022-04-08 09:29:22,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:22,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:22,366 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:22,366 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:22,371 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 09:29:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 09:29:22,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:22,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:22,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-08 09:29:22,372 INFO L87 Difference]: Start difference. First operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-08 09:29:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:22,374 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 09:29:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 09:29:22,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:22,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:22,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:22,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-08 09:29:22,378 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 31 [2022-04-08 09:29:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:22,379 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-08 09:29:22,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:29:22,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-08 09:29:22,444 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-08 09:29:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-08 09:29:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 09:29:22,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:22,448 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:22,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:22,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:22,671 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash 50284442, now seen corresponding path program 1 times [2022-04-08 09:29:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:22,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74690534] [2022-04-08 09:29:22,755 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:22,755 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash 50284442, now seen corresponding path program 2 times [2022-04-08 09:29:22,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:22,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375807720] [2022-04-08 09:29:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:22,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {2018#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1998#true} is VALID [2022-04-08 09:29:22,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:22,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1998#true} {1998#true} #94#return; {1998#true} is VALID [2022-04-08 09:29:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:29:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:22,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2022-04-08 09:29:22,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2022-04-08 09:29:22,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:22,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {2005#(<= 2 main_~n~0)} #92#return; {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:29:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:22,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2022-04-08 09:29:22,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2022-04-08 09:29:22,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:22,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:22,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {2018#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:22,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2018#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1998#true} is VALID [2022-04-08 09:29:22,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:22,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {1998#true} #94#return; {1998#true} is VALID [2022-04-08 09:29:22,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {1998#true} call #t~ret7 := main(); {1998#true} is VALID [2022-04-08 09:29:22,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {1998#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1998#true} is VALID [2022-04-08 09:29:22,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {1998#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:22,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {1998#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:22,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {1998#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:22,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {1998#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1998#true} is VALID [2022-04-08 09:29:22,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {1998#true} ~i~0 := 0; {2003#(= main_~i~0 0)} is VALID [2022-04-08 09:29:22,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {2003#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2003#(= main_~i~0 0)} is VALID [2022-04-08 09:29:22,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {2003#(= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {2003#(= main_~i~0 0)} is VALID [2022-04-08 09:29:22,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {2003#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2004#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:22,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {2004#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {2005#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {2005#(<= 2 main_~n~0)} assume !!(~k~0 < ~j~0); {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,893 INFO L272 TraceCheckUtils]: 17: Hoare triple {2005#(<= 2 main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1998#true} is VALID [2022-04-08 09:29:22,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2022-04-08 09:29:22,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2022-04-08 09:29:22,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:22,894 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1998#true} {2005#(<= 2 main_~n~0)} #92#return; {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {2005#(<= 2 main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {2005#(<= 2 main_~n~0)} assume !(~k~0 < ~j~0); {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {2005#(<= 2 main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {2005#(<= 2 main_~n~0)} assume !(~j~0 < 3 * ~i~0); {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {2005#(<= 2 main_~n~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2005#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:22,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#(<= 2 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:22,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:22,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:22,897 INFO L272 TraceCheckUtils]: 30: Hoare triple {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1998#true} is VALID [2022-04-08 09:29:22,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2022-04-08 09:29:22,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2022-04-08 09:29:22,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:22,898 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1998#true} {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:22,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:22,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {2010#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {2015#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:22,900 INFO L272 TraceCheckUtils]: 37: Hoare triple {2015#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:22,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {2016#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2017#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:22,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {2017#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1999#false} is VALID [2022-04-08 09:29:22,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2022-04-08 09:29:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 09:29:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:22,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375807720] [2022-04-08 09:29:22,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375807720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:22,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336200968] [2022-04-08 09:29:22,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:22,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:22,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:22,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:22,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 09:29:22,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 09:29:22,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:22,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:29:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:22,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:23,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {1998#true} is VALID [2022-04-08 09:29:23,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1998#true} is VALID [2022-04-08 09:29:23,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:23,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {1998#true} #94#return; {1998#true} is VALID [2022-04-08 09:29:23,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {1998#true} call #t~ret7 := main(); {1998#true} is VALID [2022-04-08 09:29:23,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {1998#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1998#true} is VALID [2022-04-08 09:29:23,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {1998#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:23,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {1998#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:23,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {1998#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:23,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {1998#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1998#true} is VALID [2022-04-08 09:29:23,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {1998#true} ~i~0 := 0; {1998#true} is VALID [2022-04-08 09:29:23,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {1998#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1998#true} is VALID [2022-04-08 09:29:23,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {1998#true} assume !(~j~0 < 3 * ~i~0); {1998#true} is VALID [2022-04-08 09:29:23,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {1998#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1998#true} is VALID [2022-04-08 09:29:23,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {1998#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1998#true} is VALID [2022-04-08 09:29:23,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {1998#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1998#true} is VALID [2022-04-08 09:29:23,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {1998#true} assume !!(~k~0 < ~j~0); {1998#true} is VALID [2022-04-08 09:29:23,322 INFO L272 TraceCheckUtils]: 17: Hoare triple {1998#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1998#true} is VALID [2022-04-08 09:29:23,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2022-04-08 09:29:23,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2022-04-08 09:29:23,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:23,332 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1998#true} {1998#true} #92#return; {1998#true} is VALID [2022-04-08 09:29:23,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {1998#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1998#true} is VALID [2022-04-08 09:29:23,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {1998#true} assume !(~k~0 < ~j~0); {1998#true} is VALID [2022-04-08 09:29:23,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {1998#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1998#true} is VALID [2022-04-08 09:29:23,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {1998#true} assume !(~j~0 < 3 * ~i~0); {1998#true} is VALID [2022-04-08 09:29:23,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {1998#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1998#true} is VALID [2022-04-08 09:29:23,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {1998#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2103#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:23,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {2103#(< main_~i~0 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:23,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:23,335 INFO L272 TraceCheckUtils]: 30: Hoare triple {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1998#true} is VALID [2022-04-08 09:29:23,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2022-04-08 09:29:23,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2022-04-08 09:29:23,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:23,337 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1998#true} {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #92#return; {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:23,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:23,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {2107#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {2132#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} is VALID [2022-04-08 09:29:23,346 INFO L272 TraceCheckUtils]: 37: Hoare triple {2132#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2136#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:23,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {2136#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2140#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:23,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {2140#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1999#false} is VALID [2022-04-08 09:29:23,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2022-04-08 09:29:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 09:29:23,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:23,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2022-04-08 09:29:23,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {2140#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1999#false} is VALID [2022-04-08 09:29:23,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {2136#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2140#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:23,586 INFO L272 TraceCheckUtils]: 37: Hoare triple {2156#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2136#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:23,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {2156#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:23,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:23,588 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1998#true} {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #92#return; {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:23,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:23,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2022-04-08 09:29:23,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2022-04-08 09:29:23,588 INFO L272 TraceCheckUtils]: 30: Hoare triple {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1998#true} is VALID [2022-04-08 09:29:23,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:23,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2160#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:23,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {1998#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2185#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:23,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {1998#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1998#true} is VALID [2022-04-08 09:29:23,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {1998#true} assume !(~j~0 < 3 * ~i~0); {1998#true} is VALID [2022-04-08 09:29:23,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {1998#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1998#true} is VALID [2022-04-08 09:29:23,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {1998#true} assume !(~k~0 < ~j~0); {1998#true} is VALID [2022-04-08 09:29:23,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {1998#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1998#true} is VALID [2022-04-08 09:29:23,591 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1998#true} {1998#true} #92#return; {1998#true} is VALID [2022-04-08 09:29:23,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:23,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2022-04-08 09:29:23,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2022-04-08 09:29:23,591 INFO L272 TraceCheckUtils]: 17: Hoare triple {1998#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1998#true} is VALID [2022-04-08 09:29:23,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {1998#true} assume !!(~k~0 < ~j~0); {1998#true} is VALID [2022-04-08 09:29:23,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {1998#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1998#true} is VALID [2022-04-08 09:29:23,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1998#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1998#true} is VALID [2022-04-08 09:29:23,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1998#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1998#true} is VALID [2022-04-08 09:29:23,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {1998#true} assume !(~j~0 < 3 * ~i~0); {1998#true} is VALID [2022-04-08 09:29:23,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {1998#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1998#true} is VALID [2022-04-08 09:29:23,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {1998#true} ~i~0 := 0; {1998#true} is VALID [2022-04-08 09:29:23,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {1998#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1998#true} is VALID [2022-04-08 09:29:23,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {1998#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:23,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {1998#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:23,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {1998#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1998#true} is VALID [2022-04-08 09:29:23,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {1998#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1998#true} is VALID [2022-04-08 09:29:23,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {1998#true} call #t~ret7 := main(); {1998#true} is VALID [2022-04-08 09:29:23,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {1998#true} #94#return; {1998#true} is VALID [2022-04-08 09:29:23,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2022-04-08 09:29:23,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1998#true} is VALID [2022-04-08 09:29:23,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {1998#true} is VALID [2022-04-08 09:29:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 09:29:23,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336200968] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:23,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:23,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2022-04-08 09:29:23,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:23,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74690534] [2022-04-08 09:29:23,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74690534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:23,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:23,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:29:23,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063980388] [2022-04-08 09:29:23,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:23,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-04-08 09:29:23,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:23,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:23,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:23,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:29:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:29:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:29:23,634 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:24,279 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-08 09:29:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:29:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-04-08 09:29:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2022-04-08 09:29:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2022-04-08 09:29:24,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2022-04-08 09:29:24,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:24,331 INFO L225 Difference]: With dead ends: 60 [2022-04-08 09:29:24,331 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 09:29:24,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:29:24,334 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:24,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 52 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:29:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 09:29:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-04-08 09:29:24,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:24,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 51 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:29:24,462 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 51 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:29:24,462 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 51 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:29:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:24,465 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-08 09:29:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-08 09:29:24,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:24,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:24,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 58 states. [2022-04-08 09:29:24,466 INFO L87 Difference]: Start difference. First operand has 51 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 58 states. [2022-04-08 09:29:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:24,469 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-08 09:29:24,469 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-08 09:29:24,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:24,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:24,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:24,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:29:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-04-08 09:29:24,473 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 41 [2022-04-08 09:29:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:24,474 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-04-08 09:29:24,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:24,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 57 transitions. [2022-04-08 09:29:24,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-04-08 09:29:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 09:29:24,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:24,560 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:24,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:24,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:24,771 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash -156950287, now seen corresponding path program 3 times [2022-04-08 09:29:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:24,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [651385353] [2022-04-08 09:29:24,853 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:24,854 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash -156950287, now seen corresponding path program 4 times [2022-04-08 09:29:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:24,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733124339] [2022-04-08 09:29:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {2652#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {2628#true} is VALID [2022-04-08 09:29:24,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:24,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2628#true} {2628#true} #94#return; {2628#true} is VALID [2022-04-08 09:29:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:29:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:24,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:24,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:24,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2628#true} {2635#(<= 2 main_~n~0)} #92#return; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:29:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:24,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:24,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:24,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2628#true} {2635#(<= 2 main_~n~0)} #92#return; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-08 09:29:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:24,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:24,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:24,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:24,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2628#true} {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:24,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {2628#true} call ULTIMATE.init(); {2652#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:24,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {2652#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {2628#true} is VALID [2022-04-08 09:29:24,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:24,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2628#true} {2628#true} #94#return; {2628#true} is VALID [2022-04-08 09:29:24,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {2628#true} call #t~ret7 := main(); {2628#true} is VALID [2022-04-08 09:29:24,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {2628#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {2628#true} is VALID [2022-04-08 09:29:24,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {2628#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:24,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {2628#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:24,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {2628#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:24,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {2628#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {2628#true} is VALID [2022-04-08 09:29:24,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {2628#true} ~i~0 := 0; {2633#(= main_~i~0 0)} is VALID [2022-04-08 09:29:24,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {2633#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2633#(= main_~i~0 0)} is VALID [2022-04-08 09:29:24,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {2633#(= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {2633#(= main_~i~0 0)} is VALID [2022-04-08 09:29:24,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {2633#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:24,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {2634#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {2635#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {2635#(<= 2 main_~n~0)} assume !!(~k~0 < ~j~0); {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,978 INFO L272 TraceCheckUtils]: 17: Hoare triple {2635#(<= 2 main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2628#true} is VALID [2022-04-08 09:29:24,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:24,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:24,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:24,979 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2628#true} {2635#(<= 2 main_~n~0)} #92#return; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {2635#(<= 2 main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {2635#(<= 2 main_~n~0)} assume !(~k~0 < ~j~0); {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {2635#(<= 2 main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {2635#(<= 2 main_~n~0)} assume !(~j~0 < 3 * ~i~0); {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {2635#(<= 2 main_~n~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {2635#(<= 2 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {2635#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {2635#(<= 2 main_~n~0)} assume !!(~k~0 < ~j~0); {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,982 INFO L272 TraceCheckUtils]: 30: Hoare triple {2635#(<= 2 main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2628#true} is VALID [2022-04-08 09:29:24,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:24,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:24,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:24,983 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2628#true} {2635#(<= 2 main_~n~0)} #92#return; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {2635#(<= 2 main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {2635#(<= 2 main_~n~0)} assume !(~k~0 < ~j~0); {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {2635#(<= 2 main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2635#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:24,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {2635#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:24,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:24,985 INFO L272 TraceCheckUtils]: 40: Hoare triple {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2628#true} is VALID [2022-04-08 09:29:24,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:24,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:24,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:24,986 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2628#true} {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:24,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {2644#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2649#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:24,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {2649#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {2649#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:24,987 INFO L272 TraceCheckUtils]: 47: Hoare triple {2649#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:24,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {2650#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2651#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:24,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {2651#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2629#false} is VALID [2022-04-08 09:29:24,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {2629#false} assume !false; {2629#false} is VALID [2022-04-08 09:29:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 09:29:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:24,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733124339] [2022-04-08 09:29:24,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733124339] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:24,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593083163] [2022-04-08 09:29:24,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:29:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:24,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:25,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 09:29:25,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:29:25,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:25,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:29:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:25,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:29,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {2628#true} call ULTIMATE.init(); {2628#true} is VALID [2022-04-08 09:29:29,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {2628#true} is VALID [2022-04-08 09:29:29,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:29,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2628#true} {2628#true} #94#return; {2628#true} is VALID [2022-04-08 09:29:29,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {2628#true} call #t~ret7 := main(); {2628#true} is VALID [2022-04-08 09:29:29,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {2628#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {2628#true} is VALID [2022-04-08 09:29:29,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {2628#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:29,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {2628#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:29,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {2628#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:29,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {2628#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {2628#true} is VALID [2022-04-08 09:29:29,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {2628#true} ~i~0 := 0; {2686#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:29,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {2686#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2686#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:29,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {2686#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {2686#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:29,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {2686#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {2634#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {2634#(<= 1 main_~i~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {2634#(<= 1 main_~i~0)} assume !!(~k~0 < ~j~0); {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,589 INFO L272 TraceCheckUtils]: 17: Hoare triple {2634#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2628#true} is VALID [2022-04-08 09:29:29,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:29,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:29,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:29,594 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2628#true} {2634#(<= 1 main_~i~0)} #92#return; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#(<= 1 main_~i~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {2634#(<= 1 main_~i~0)} assume !(~k~0 < ~j~0); {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {2634#(<= 1 main_~i~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {2634#(<= 1 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {2634#(<= 1 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2735#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:29,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {2735#(<= 2 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2739#(and (<= 2 main_~i~0) (<= (* main_~i~0 2) main_~j~0))} is VALID [2022-04-08 09:29:29,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {2739#(and (<= 2 main_~i~0) (<= (* main_~i~0 2) main_~j~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2743#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (div main_~j~0 2)))} is VALID [2022-04-08 09:29:29,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {2743#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (div main_~j~0 2)))} assume !!(~k~0 < ~j~0); {2743#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (div main_~j~0 2)))} is VALID [2022-04-08 09:29:29,598 INFO L272 TraceCheckUtils]: 30: Hoare triple {2743#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2628#true} is VALID [2022-04-08 09:29:29,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:29,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:29,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:29,599 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2628#true} {2743#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (div main_~j~0 2)))} #92#return; {2743#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (div main_~j~0 2)))} is VALID [2022-04-08 09:29:29,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {2743#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (div main_~j~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2765#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (+ (div main_~j~0 2) 1)))} is VALID [2022-04-08 09:29:29,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {2765#(and (<= 2 (div main_~j~0 2)) (<= main_~k~0 (+ (div main_~j~0 2) 1)))} assume !(~k~0 < ~j~0); {2629#false} is VALID [2022-04-08 09:29:29,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {2629#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2629#false} is VALID [2022-04-08 09:29:29,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#false} assume !!(~k~0 < ~j~0); {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L272 TraceCheckUtils]: 40: Hoare triple {2629#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {2629#false} ~cond := #in~cond; {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {2629#false} assume !(0 == ~cond); {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {2629#false} assume true; {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2629#false} {2629#false} #92#return; {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {2629#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {2629#false} assume !!(~k~0 < ~j~0); {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L272 TraceCheckUtils]: 47: Hoare triple {2629#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2629#false} is VALID [2022-04-08 09:29:29,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {2629#false} ~cond := #in~cond; {2629#false} is VALID [2022-04-08 09:29:29,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {2629#false} assume 0 == ~cond; {2629#false} is VALID [2022-04-08 09:29:29,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {2629#false} assume !false; {2629#false} is VALID [2022-04-08 09:29:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 09:29:29,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:29,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {2629#false} assume !false; {2629#false} is VALID [2022-04-08 09:29:29,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {2629#false} assume 0 == ~cond; {2629#false} is VALID [2022-04-08 09:29:29,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {2629#false} ~cond := #in~cond; {2629#false} is VALID [2022-04-08 09:29:29,871 INFO L272 TraceCheckUtils]: 47: Hoare triple {2629#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2629#false} is VALID [2022-04-08 09:29:29,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {2629#false} assume !!(~k~0 < ~j~0); {2629#false} is VALID [2022-04-08 09:29:29,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {2629#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2629#false} is VALID [2022-04-08 09:29:29,871 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2628#true} {2629#false} #92#return; {2629#false} is VALID [2022-04-08 09:29:29,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:29,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:29,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:29,871 INFO L272 TraceCheckUtils]: 40: Hoare triple {2629#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2628#true} is VALID [2022-04-08 09:29:29,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#false} assume !!(~k~0 < ~j~0); {2629#false} is VALID [2022-04-08 09:29:29,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2629#false} is VALID [2022-04-08 09:29:29,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {2629#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2629#false} is VALID [2022-04-08 09:29:29,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {2853#(< main_~k~0 main_~j~0)} assume !(~k~0 < ~j~0); {2629#false} is VALID [2022-04-08 09:29:29,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {2857#(< (+ main_~k~0 1) main_~j~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2853#(< main_~k~0 main_~j~0)} is VALID [2022-04-08 09:29:29,873 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2628#true} {2857#(< (+ main_~k~0 1) main_~j~0)} #92#return; {2857#(< (+ main_~k~0 1) main_~j~0)} is VALID [2022-04-08 09:29:29,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:29,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:29,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:29,873 INFO L272 TraceCheckUtils]: 30: Hoare triple {2857#(< (+ main_~k~0 1) main_~j~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2628#true} is VALID [2022-04-08 09:29:29,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {2857#(< (+ main_~k~0 1) main_~j~0)} assume !!(~k~0 < ~j~0); {2857#(< (+ main_~k~0 1) main_~j~0)} is VALID [2022-04-08 09:29:29,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {2879#(< (+ main_~i~0 1) main_~j~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2857#(< (+ main_~k~0 1) main_~j~0)} is VALID [2022-04-08 09:29:29,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {2735#(<= 2 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2879#(< (+ main_~i~0 1) main_~j~0)} is VALID [2022-04-08 09:29:29,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {2634#(<= 1 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2735#(<= 2 main_~i~0)} is VALID [2022-04-08 09:29:29,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {2634#(<= 1 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {2634#(<= 1 main_~i~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {2634#(<= 1 main_~i~0)} assume !(~k~0 < ~j~0); {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#(<= 1 main_~i~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,876 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2628#true} {2634#(<= 1 main_~i~0)} #92#return; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:29,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {2628#true} assume !(0 == ~cond); {2628#true} is VALID [2022-04-08 09:29:29,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {2628#true} ~cond := #in~cond; {2628#true} is VALID [2022-04-08 09:29:29,876 INFO L272 TraceCheckUtils]: 17: Hoare triple {2634#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {2628#true} is VALID [2022-04-08 09:29:29,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {2634#(<= 1 main_~i~0)} assume !!(~k~0 < ~j~0); {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {2634#(<= 1 main_~i~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {2634#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {2686#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2634#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:29,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {2686#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {2686#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:29,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {2686#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {2686#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:29,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {2628#true} ~i~0 := 0; {2686#(<= 0 main_~i~0)} is VALID [2022-04-08 09:29:29,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {2628#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {2628#true} is VALID [2022-04-08 09:29:29,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {2628#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:29,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {2628#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:29,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {2628#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {2628#true} is VALID [2022-04-08 09:29:29,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {2628#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {2628#true} is VALID [2022-04-08 09:29:29,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {2628#true} call #t~ret7 := main(); {2628#true} is VALID [2022-04-08 09:29:29,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2628#true} {2628#true} #94#return; {2628#true} is VALID [2022-04-08 09:29:29,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume true; {2628#true} is VALID [2022-04-08 09:29:29,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {2628#true} is VALID [2022-04-08 09:29:29,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {2628#true} call ULTIMATE.init(); {2628#true} is VALID [2022-04-08 09:29:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 09:29:29,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593083163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:29,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:29,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2022-04-08 09:29:29,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:29,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [651385353] [2022-04-08 09:29:29,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [651385353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:29,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:29,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:29:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757948525] [2022-04-08 09:29:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:29,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-04-08 09:29:29,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:29,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:29,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:29,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:29:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:29:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:29:29,914 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:30,568 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-08 09:29:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:29:30,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-04-08 09:29:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-08 09:29:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-08 09:29:30,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-08 09:29:30,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:30,622 INFO L225 Difference]: With dead ends: 74 [2022-04-08 09:29:30,622 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 09:29:30,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:29:30,624 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:30,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 53 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:29:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 09:29:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2022-04-08 09:29:30,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:30,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 58 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:29:30,768 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 58 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:29:30,768 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 58 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:29:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:30,772 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-04-08 09:29:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-04-08 09:29:30,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:30,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:30,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 72 states. [2022-04-08 09:29:30,773 INFO L87 Difference]: Start difference. First operand has 58 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 72 states. [2022-04-08 09:29:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:30,775 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-04-08 09:29:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-04-08 09:29:30,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:30,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:30,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:30,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:29:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-04-08 09:29:30,778 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 51 [2022-04-08 09:29:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:30,778 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-04-08 09:29:30,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:29:30,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 65 transitions. [2022-04-08 09:29:30,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-08 09:29:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 09:29:30,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:30,865 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:30,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:31,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:31,068 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2126579137, now seen corresponding path program 5 times [2022-04-08 09:29:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:31,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [272743015] [2022-04-08 09:29:31,134 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:31,134 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2126579137, now seen corresponding path program 6 times [2022-04-08 09:29:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:31,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959198556] [2022-04-08 09:29:31,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:31,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {3419#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {3390#true} is VALID [2022-04-08 09:29:31,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3390#true} {3390#true} #94#return; {3390#true} is VALID [2022-04-08 09:29:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:29:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:31,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3390#true} {3397#(<= 2 main_~n~0)} #92#return; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:29:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:31,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3390#true} {3397#(<= 2 main_~n~0)} #92#return; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-08 09:29:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:31,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3390#true} {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-08 09:29:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:31,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3390#true} {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {3390#true} call ULTIMATE.init(); {3419#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:31,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {3419#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {3390#true} is VALID [2022-04-08 09:29:31,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3390#true} {3390#true} #94#return; {3390#true} is VALID [2022-04-08 09:29:31,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {3390#true} call #t~ret7 := main(); {3390#true} is VALID [2022-04-08 09:29:31,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {3390#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {3390#true} is VALID [2022-04-08 09:29:31,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {3390#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:31,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {3390#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:31,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {3390#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:31,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {3390#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {3390#true} is VALID [2022-04-08 09:29:31,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {3390#true} ~i~0 := 0; {3395#(= main_~i~0 0)} is VALID [2022-04-08 09:29:31,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {3395#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3395#(= main_~i~0 0)} is VALID [2022-04-08 09:29:31,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {3395#(= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {3395#(= main_~i~0 0)} is VALID [2022-04-08 09:29:31,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {3395#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3396#(<= 1 main_~i~0)} is VALID [2022-04-08 09:29:31,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {3396#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {3397#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {3397#(<= 2 main_~n~0)} assume !!(~k~0 < ~j~0); {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,305 INFO L272 TraceCheckUtils]: 17: Hoare triple {3397#(<= 2 main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:31,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,306 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3390#true} {3397#(<= 2 main_~n~0)} #92#return; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {3397#(<= 2 main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {3397#(<= 2 main_~n~0)} assume !(~k~0 < ~j~0); {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {3397#(<= 2 main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {3397#(<= 2 main_~n~0)} assume !(~j~0 < 3 * ~i~0); {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {3397#(<= 2 main_~n~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {3397#(<= 2 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {3397#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {3397#(<= 2 main_~n~0)} assume !!(~k~0 < ~j~0); {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,309 INFO L272 TraceCheckUtils]: 30: Hoare triple {3397#(<= 2 main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:31,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,309 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3390#true} {3397#(<= 2 main_~n~0)} #92#return; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#(<= 2 main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {3397#(<= 2 main_~n~0)} assume !(~k~0 < ~j~0); {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {3397#(<= 2 main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3397#(<= 2 main_~n~0)} is VALID [2022-04-08 09:29:31,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {3397#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,311 INFO L272 TraceCheckUtils]: 40: Hoare triple {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:31,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,312 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3390#true} {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,313 INFO L290 TraceCheckUtils]: 45: Hoare triple {3406#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,313 INFO L272 TraceCheckUtils]: 47: Hoare triple {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:31,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,314 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3390#true} {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {3411#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3416#(<= (+ main_~k~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {3416#(<= (+ main_~k~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {3416#(<= (+ main_~k~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:31,315 INFO L272 TraceCheckUtils]: 54: Hoare triple {3416#(<= (+ main_~k~0 2) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:31,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {3417#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3418#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:31,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {3418#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3391#false} is VALID [2022-04-08 09:29:31,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {3391#false} assume !false; {3391#false} is VALID [2022-04-08 09:29:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 09:29:31,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:31,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959198556] [2022-04-08 09:29:31,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959198556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:31,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585198882] [2022-04-08 09:29:31,317 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:29:31,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:31,318 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:31,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 09:29:31,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-08 09:29:31,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:31,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:29:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:31,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:31,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {3390#true} call ULTIMATE.init(); {3390#true} is VALID [2022-04-08 09:29:31,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {3390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3390#true} {3390#true} #94#return; {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {3390#true} call #t~ret7 := main(); {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {3390#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {3390#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {3390#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {3390#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {3390#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {3390#true} is VALID [2022-04-08 09:29:31,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {3390#true} ~i~0 := 0; {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {3390#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {3390#true} assume !(~j~0 < 3 * ~i~0); {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {3390#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {3390#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {3390#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {3390#true} assume !!(~k~0 < ~j~0); {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L272 TraceCheckUtils]: 17: Hoare triple {3390#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,839 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3390#true} {3390#true} #92#return; {3390#true} is VALID [2022-04-08 09:29:31,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {3390#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3390#true} is VALID [2022-04-08 09:29:31,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {3390#true} assume !(~k~0 < ~j~0); {3390#true} is VALID [2022-04-08 09:29:31,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {3390#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3390#true} is VALID [2022-04-08 09:29:31,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {3390#true} assume !(~j~0 < 3 * ~i~0); {3390#true} is VALID [2022-04-08 09:29:31,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {3390#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3390#true} is VALID [2022-04-08 09:29:31,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {3390#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3504#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:31,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {3504#(< main_~i~0 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3504#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:31,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {3504#(< main_~i~0 main_~n~0)} assume !!(~k~0 < ~j~0); {3504#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:31,840 INFO L272 TraceCheckUtils]: 30: Hoare triple {3504#(< main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:31,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,841 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3390#true} {3504#(< main_~i~0 main_~n~0)} #92#return; {3504#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:31,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {3504#(< main_~i~0 main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3504#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:31,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {3504#(< main_~i~0 main_~n~0)} assume !(~k~0 < ~j~0); {3504#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:31,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {3504#(< main_~i~0 main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3504#(< main_~i~0 main_~n~0)} is VALID [2022-04-08 09:29:31,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {3504#(< main_~i~0 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:31,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:31,843 INFO L272 TraceCheckUtils]: 40: Hoare triple {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:31,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,851 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3390#true} {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #92#return; {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:31,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:31,852 INFO L290 TraceCheckUtils]: 46: Hoare triple {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:31,852 INFO L272 TraceCheckUtils]: 47: Hoare triple {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:31,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:31,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:31,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:31,853 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3390#true} {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #92#return; {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:31,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:31,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {3538#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {3584#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} is VALID [2022-04-08 09:29:31,855 INFO L272 TraceCheckUtils]: 54: Hoare triple {3584#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:31,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {3588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:31,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {3592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3391#false} is VALID [2022-04-08 09:29:31,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {3391#false} assume !false; {3391#false} is VALID [2022-04-08 09:29:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 09:29:31,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:32,140 INFO L290 TraceCheckUtils]: 57: Hoare triple {3391#false} assume !false; {3391#false} is VALID [2022-04-08 09:29:32,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {3592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3391#false} is VALID [2022-04-08 09:29:32,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {3588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:32,141 INFO L272 TraceCheckUtils]: 54: Hoare triple {3608#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:32,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {3608#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:32,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:32,143 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3390#true} {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #92#return; {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:32,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:32,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:32,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:32,143 INFO L272 TraceCheckUtils]: 47: Hoare triple {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:32,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:32,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:32,148 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3390#true} {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #92#return; {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:32,149 INFO L290 TraceCheckUtils]: 43: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:32,149 INFO L290 TraceCheckUtils]: 42: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:32,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:32,149 INFO L272 TraceCheckUtils]: 40: Hoare triple {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:32,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:32,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3612#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:32,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:32,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !(~k~0 < ~j~0); {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:32,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:32,152 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3390#true} {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} #92#return; {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:32,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:32,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:32,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:32,152 INFO L272 TraceCheckUtils]: 30: Hoare triple {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:32,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:32,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:32,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {3390#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3658#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:32,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {3390#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {3390#true} assume !(~j~0 < 3 * ~i~0); {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {3390#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {3390#true} assume !(~k~0 < ~j~0); {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {3390#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3390#true} {3390#true} #92#return; {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {3390#true} assume !(0 == ~cond); {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {3390#true} ~cond := #in~cond; {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L272 TraceCheckUtils]: 17: Hoare triple {3390#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {3390#true} is VALID [2022-04-08 09:29:32,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {3390#true} assume !!(~k~0 < ~j~0); {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {3390#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {3390#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {3390#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {3390#true} assume !(~j~0 < 3 * ~i~0); {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {3390#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {3390#true} ~i~0 := 0; {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {3390#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {3390#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {3390#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:32,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {3390#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {3390#true} is VALID [2022-04-08 09:29:32,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {3390#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {3390#true} is VALID [2022-04-08 09:29:32,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {3390#true} call #t~ret7 := main(); {3390#true} is VALID [2022-04-08 09:29:32,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3390#true} {3390#true} #94#return; {3390#true} is VALID [2022-04-08 09:29:32,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {3390#true} assume true; {3390#true} is VALID [2022-04-08 09:29:32,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {3390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {3390#true} is VALID [2022-04-08 09:29:32,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {3390#true} call ULTIMATE.init(); {3390#true} is VALID [2022-04-08 09:29:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 32 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 09:29:32,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585198882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:32,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:32,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2022-04-08 09:29:32,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [272743015] [2022-04-08 09:29:32,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [272743015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:32,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:32,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:29:32,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341351575] [2022-04-08 09:29:32,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:32,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2022-04-08 09:29:32,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:32,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:32,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:32,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:29:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:29:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:29:32,193 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:32,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:32,966 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-04-08 09:29:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:29:32,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2022-04-08 09:29:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-08 09:29:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-08 09:29:32,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-04-08 09:29:33,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:33,036 INFO L225 Difference]: With dead ends: 89 [2022-04-08 09:29:33,036 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 09:29:33,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-04-08 09:29:33,037 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:33,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:29:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 09:29:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2022-04-08 09:29:33,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:33,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 65 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:29:33,190 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 65 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:29:33,190 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 65 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:29:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:33,194 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2022-04-08 09:29:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2022-04-08 09:29:33,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:33,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:33,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 87 states. [2022-04-08 09:29:33,195 INFO L87 Difference]: Start difference. First operand has 65 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 87 states. [2022-04-08 09:29:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:33,198 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2022-04-08 09:29:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2022-04-08 09:29:33,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:33,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:33,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:33,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:29:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-04-08 09:29:33,202 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 58 [2022-04-08 09:29:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:33,202 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-04-08 09:29:33,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:29:33,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 73 transitions. [2022-04-08 09:29:33,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-08 09:29:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 09:29:33,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:29:33,305 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:29:33,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:33,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:33,506 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:29:33,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:29:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash 237677873, now seen corresponding path program 7 times [2022-04-08 09:29:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:33,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695012819] [2022-04-08 09:29:33,582 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:29:33,583 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:29:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash 237677873, now seen corresponding path program 8 times [2022-04-08 09:29:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:29:33,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8156405] [2022-04-08 09:29:33,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:29:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:29:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:29:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {4307#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {4275#true} is VALID [2022-04-08 09:29:33,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4275#true} {4275#true} #94#return; {4275#true} is VALID [2022-04-08 09:29:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:29:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4275#true} {4275#true} #92#return; {4275#true} is VALID [2022-04-08 09:29:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:29:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4275#true} {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-08 09:29:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4275#true} {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-08 09:29:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4275#true} {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-08 09:29:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4275#true} {4299#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {4299#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {4275#true} call ULTIMATE.init(); {4307#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:29:33,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {4307#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {4275#true} is VALID [2022-04-08 09:29:33,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4275#true} {4275#true} #94#return; {4275#true} is VALID [2022-04-08 09:29:33,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {4275#true} call #t~ret7 := main(); {4275#true} is VALID [2022-04-08 09:29:33,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {4275#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {4275#true} is VALID [2022-04-08 09:29:33,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {4275#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:33,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {4275#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:33,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {4275#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {4275#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {4275#true} ~i~0 := 0; {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {4275#true} assume !(~j~0 < 3 * ~i~0); {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {4275#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {4275#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {4275#true} assume !!(~k~0 < ~j~0); {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L272 TraceCheckUtils]: 17: Hoare triple {4275#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:33,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,764 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4275#true} {4275#true} #92#return; {4275#true} is VALID [2022-04-08 09:29:33,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {4275#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4275#true} is VALID [2022-04-08 09:29:33,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {4275#true} assume !(~k~0 < ~j~0); {4275#true} is VALID [2022-04-08 09:29:33,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {4275#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4275#true} is VALID [2022-04-08 09:29:33,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {4275#true} assume !(~j~0 < 3 * ~i~0); {4275#true} is VALID [2022-04-08 09:29:33,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {4275#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#true} is VALID [2022-04-08 09:29:33,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4284#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 09:29:33,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {4284#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,766 INFO L272 TraceCheckUtils]: 30: Hoare triple {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:33,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,767 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4275#true} {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !(~k~0 < ~j~0); {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {4285#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,769 INFO L272 TraceCheckUtils]: 40: Hoare triple {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:33,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,770 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4275#true} {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,770 INFO L272 TraceCheckUtils]: 47: Hoare triple {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:33,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,771 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4275#true} {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {4290#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {4299#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,772 INFO L272 TraceCheckUtils]: 54: Hoare triple {4299#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:33,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:33,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:33,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:33,773 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4275#true} {4299#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {4299#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {4299#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4304#(<= (+ main_~k~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {4304#(<= (+ main_~k~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {4304#(<= (+ main_~k~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:33,775 INFO L272 TraceCheckUtils]: 61: Hoare triple {4304#(<= (+ main_~k~0 2) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4305#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:29:33,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {4305#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4306#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:29:33,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {4306#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4276#false} is VALID [2022-04-08 09:29:33,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {4276#false} assume !false; {4276#false} is VALID [2022-04-08 09:29:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 38 proven. 26 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-04-08 09:29:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:29:33,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8156405] [2022-04-08 09:29:33,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8156405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:29:33,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545975343] [2022-04-08 09:29:33,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:29:33,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:29:33,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:29:33,780 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:29:33,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 09:29:33,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 09:29:33,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:29:33,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:29:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:29:33,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:29:34,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {4275#true} call ULTIMATE.init(); {4275#true} is VALID [2022-04-08 09:29:34,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {4275#true} is VALID [2022-04-08 09:29:34,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4275#true} {4275#true} #94#return; {4275#true} is VALID [2022-04-08 09:29:34,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {4275#true} call #t~ret7 := main(); {4275#true} is VALID [2022-04-08 09:29:34,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {4275#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {4275#true} is VALID [2022-04-08 09:29:34,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {4275#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:34,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {4275#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:34,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {4275#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {4275#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {4275#true} ~i~0 := 0; {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {4275#true} assume !(~j~0 < 3 * ~i~0); {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {4275#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {4275#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {4275#true} assume !!(~k~0 < ~j~0); {4275#true} is VALID [2022-04-08 09:29:34,269 INFO L272 TraceCheckUtils]: 17: Hoare triple {4275#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4275#true} {4275#true} #92#return; {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {4275#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {4275#true} assume !(~k~0 < ~j~0); {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {4275#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {4275#true} assume !(~j~0 < 3 * ~i~0); {4275#true} is VALID [2022-04-08 09:29:34,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {4275#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#true} is VALID [2022-04-08 09:29:34,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4284#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 09:29:34,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {4284#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4284#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 09:29:34,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {4284#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~k~0 < ~j~0); {4284#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 09:29:34,276 INFO L272 TraceCheckUtils]: 30: Hoare triple {4284#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,277 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4275#true} {4284#(<= (+ main_~i~0 1) main_~n~0)} #92#return; {4284#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 09:29:34,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {4284#(<= (+ main_~i~0 1) main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4284#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 09:29:34,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {4284#(<= (+ main_~i~0 1) main_~n~0)} assume !(~k~0 < ~j~0); {4284#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 09:29:34,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {4284#(<= (+ main_~i~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4284#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-08 09:29:34,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {4284#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,279 INFO L272 TraceCheckUtils]: 40: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,280 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4275#true} {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #92#return; {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,281 INFO L272 TraceCheckUtils]: 47: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,282 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4275#true} {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #92#return; {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,283 INFO L272 TraceCheckUtils]: 54: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,283 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4275#true} {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #92#return; {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,284 INFO L290 TraceCheckUtils]: 60: Hoare triple {4425#(and (<= (+ main_~i~0 1) main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {4492#(and (<= (+ main_~i~0 1) main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} is VALID [2022-04-08 09:29:34,285 INFO L272 TraceCheckUtils]: 61: Hoare triple {4492#(and (<= (+ main_~i~0 1) main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4496#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:34,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {4496#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4500#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:34,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {4500#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4276#false} is VALID [2022-04-08 09:29:34,286 INFO L290 TraceCheckUtils]: 64: Hoare triple {4276#false} assume !false; {4276#false} is VALID [2022-04-08 09:29:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-08 09:29:34,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:29:34,575 INFO L290 TraceCheckUtils]: 64: Hoare triple {4276#false} assume !false; {4276#false} is VALID [2022-04-08 09:29:34,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {4500#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4276#false} is VALID [2022-04-08 09:29:34,576 INFO L290 TraceCheckUtils]: 62: Hoare triple {4496#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4500#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:29:34,576 INFO L272 TraceCheckUtils]: 61: Hoare triple {4516#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4496#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:29:34,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {4516#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:34,578 INFO L290 TraceCheckUtils]: 59: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,578 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4275#true} {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #92#return; {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,579 INFO L290 TraceCheckUtils]: 55: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,579 INFO L272 TraceCheckUtils]: 54: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,579 INFO L290 TraceCheckUtils]: 53: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,580 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4275#true} {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #92#return; {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,580 INFO L272 TraceCheckUtils]: 47: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,582 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4275#true} {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #92#return; {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,582 INFO L272 TraceCheckUtils]: 40: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4520#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-08 09:29:34,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:34,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !(~k~0 < ~j~0); {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:34,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:34,584 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4275#true} {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} #92#return; {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:34,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,585 INFO L272 TraceCheckUtils]: 30: Hoare triple {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:34,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:34,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4587#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-08 09:29:34,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {4275#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#true} is VALID [2022-04-08 09:29:34,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {4275#true} assume !(~j~0 < 3 * ~i~0); {4275#true} is VALID [2022-04-08 09:29:34,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {4275#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4275#true} is VALID [2022-04-08 09:29:34,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {4275#true} assume !(~k~0 < ~j~0); {4275#true} is VALID [2022-04-08 09:29:34,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {4275#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4275#true} is VALID [2022-04-08 09:29:34,586 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4275#true} {4275#true} #92#return; {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {4275#true} assume !(0 == ~cond); {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {4275#true} ~cond := #in~cond; {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L272 TraceCheckUtils]: 17: Hoare triple {4275#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {4275#true} assume !!(~k~0 < ~j~0); {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {4275#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {4275#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#true} is VALID [2022-04-08 09:29:34,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {4275#true} assume !(~j~0 < 3 * ~i~0); {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {4275#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {4275#true} ~i~0 := 0; {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {4275#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {4275#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {4275#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {4275#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {4275#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {4275#true} call #t~ret7 := main(); {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4275#true} {4275#true} #94#return; {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {4275#true} assume true; {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {4275#true} is VALID [2022-04-08 09:29:34,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {4275#true} call ULTIMATE.init(); {4275#true} is VALID [2022-04-08 09:29:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-08 09:29:34,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545975343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:29:34,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:29:34,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-04-08 09:29:34,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:29:34,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695012819] [2022-04-08 09:29:34,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695012819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:29:34,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:29:34,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:29:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767453888] [2022-04-08 09:29:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:29:34,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 65 [2022-04-08 09:29:34,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:29:34,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 09:29:34,625 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-08 09:29:34,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:29:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:29:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:29:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:29:34,627 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 09:29:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:35,191 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-08 09:29:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:29:35,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 65 [2022-04-08 09:29:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:29:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 09:29:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2022-04-08 09:29:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 09:29:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2022-04-08 09:29:35,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 32 transitions. [2022-04-08 09:29:35,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:35,232 INFO L225 Difference]: With dead ends: 65 [2022-04-08 09:29:35,232 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:29:35,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:29:35,233 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:29:35,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:29:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:29:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:29:35,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:29:35,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:29:35,234 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:29:35,235 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:29:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:35,235 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:29:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:29:35,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:35,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:35,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:29:35,235 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:29:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:29:35,235 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:29:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:29:35,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:35,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:29:35,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:29:35,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:29:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:29:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:29:35,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2022-04-08 09:29:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:29:35,236 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:29:35,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 09:29:35,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:29:35,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:29:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:29:35,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:29:35,239 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:29:35,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 09:29:35,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 09:29:35,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:29:36,815 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:29:36,815 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:29:36,815 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:29:36,815 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:29:36,815 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:29:36,815 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:29:36,816 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:29:36,816 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 37) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* main_~n~0 2)))) (and (< main_~i~0 main_~n~0) (<= (+ main_~j~0 3) .cse0) (<= main_~j~0 main_~k~0) (<= (+ main_~k~0 2) .cse0) (<= (* main_~i~0 2) main_~j~0) (<= 1 main_~i~0))) [2022-04-08 09:29:36,816 INFO L878 garLoopResultBuilder]: At program point L35-3(lines 35 37) the Hoare annotation is: (let ((.cse1 (* main_~i~0 2))) (let ((.cse3 (<= 1 main_~i~0)) (.cse0 (< main_~i~0 main_~n~0)) (.cse2 (<= .cse1 main_~j~0))) (or (and .cse0 (<= main_~j~0 .cse1) (<= main_~i~0 1) .cse2 .cse3) (let ((.cse4 (+ main_~i~0 (* main_~n~0 2)))) (and .cse0 (<= (+ main_~j~0 2) .cse4) (<= (+ main_~k~0 2) .cse4) .cse2 .cse3)) (and .cse0 (<= main_~j~0 (+ main_~i~0 1)) (= main_~i~0 0) .cse2)))) [2022-04-08 09:29:36,816 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-04-08 09:29:36,816 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 25 40) the Hoare annotation is: true [2022-04-08 09:29:36,816 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 37) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* main_~n~0 2)))) (and (< main_~i~0 main_~n~0) (<= (+ main_~j~0 3) .cse0) (<= (+ main_~k~0 2) .cse0) (<= (* main_~i~0 2) main_~j~0) (<= 1 main_~i~0))) [2022-04-08 09:29:36,816 INFO L885 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-08 09:29:36,816 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* main_~n~0 2)))) (and (<= (+ main_~k~0 3) .cse0) (< main_~i~0 main_~n~0) (<= (+ main_~j~0 3) .cse0) (<= (* main_~i~0 2) main_~j~0) (<= 1 main_~i~0))) [2022-04-08 09:29:36,817 INFO L878 garLoopResultBuilder]: At program point L37-1(lines 36 37) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* main_~n~0 2)))) (and (<= (+ main_~k~0 3) .cse0) (< main_~i~0 main_~n~0) (<= (+ main_~j~0 3) .cse0) (<= (* main_~i~0 2) main_~j~0) (<= 1 main_~i~0))) [2022-04-08 09:29:36,817 INFO L885 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-08 09:29:36,817 INFO L885 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: true [2022-04-08 09:29:36,817 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 25 40) the Hoare annotation is: true [2022-04-08 09:29:36,817 INFO L885 garLoopResultBuilder]: At program point L38(lines 25 40) the Hoare annotation is: true [2022-04-08 09:29:36,817 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 37) the Hoare annotation is: (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse2 (<= (* main_~i~0 2) main_~j~0))) (or (let ((.cse1 (+ main_~i~0 (* main_~n~0 2)))) (and .cse0 (<= (+ main_~j~0 2) .cse1) (<= (+ main_~k~0 2) .cse1) .cse2 (<= 1 main_~i~0))) (and .cse0 (<= main_~j~0 (+ main_~i~0 1)) (= main_~i~0 0) .cse2))) [2022-04-08 09:29:36,817 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0))) (or (and (<= main_~j~0 (+ main_~i~0 1)) (<= main_~i~0 1) .cse0) (let ((.cse1 (+ main_~i~0 (* main_~n~0 2)))) (and (<= (+ main_~k~0 3) .cse1) (<= 2 main_~n~0) (<= (+ main_~j~0 3) .cse1) .cse0)) (= main_~i~0 0))) [2022-04-08 09:29:36,817 INFO L885 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-04-08 09:29:36,817 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 25 40) the Hoare annotation is: true [2022-04-08 09:29:36,817 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:29:36,817 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:29:36,818 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:29:36,818 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:29:36,818 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:29:36,818 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:29:36,818 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:29:36,818 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 09:29:36,818 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:29:36,818 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 09:29:36,818 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:29:36,818 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:29:36,818 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 09:29:36,821 INFO L719 BasicCegarLoop]: Path program histogram: [8, 4, 2, 2, 2] [2022-04-08 09:29:36,822 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:29:36,825 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:29:36,825 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:29:36,828 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:29:36,828 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:29:36,828 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:29:36,828 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:29:36,830 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:29:36,852 INFO L163 areAnnotationChecker]: CFG has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:29:36,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:29:36 BoogieIcfgContainer [2022-04-08 09:29:36,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:29:36,863 INFO L158 Benchmark]: Toolchain (without parser) took 21484.77ms. Allocated memory was 186.6MB in the beginning and 328.2MB in the end (delta: 141.6MB). Free memory was 133.3MB in the beginning and 262.5MB in the end (delta: -129.3MB). Peak memory consumption was 165.4MB. Max. memory is 8.0GB. [2022-04-08 09:29:36,863 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:29:36,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.85ms. Allocated memory was 186.6MB in the beginning and 269.5MB in the end (delta: 82.8MB). Free memory was 133.0MB in the beginning and 241.7MB in the end (delta: -108.6MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-08 09:29:36,864 INFO L158 Benchmark]: Boogie Preprocessor took 45.26ms. Allocated memory is still 269.5MB. Free memory was 241.7MB in the beginning and 240.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:29:36,864 INFO L158 Benchmark]: RCFGBuilder took 438.92ms. Allocated memory is still 269.5MB. Free memory was 240.1MB in the beginning and 226.7MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 09:29:36,864 INFO L158 Benchmark]: TraceAbstraction took 20654.77ms. Allocated memory was 269.5MB in the beginning and 328.2MB in the end (delta: 58.7MB). Free memory was 226.2MB in the beginning and 262.5MB in the end (delta: -36.4MB). Peak memory consumption was 175.2MB. Max. memory is 8.0GB. [2022-04-08 09:29:36,866 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.13ms. Allocated memory is still 186.6MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 339.85ms. Allocated memory was 186.6MB in the beginning and 269.5MB in the end (delta: 82.8MB). Free memory was 133.0MB in the beginning and 241.7MB in the end (delta: -108.6MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.26ms. Allocated memory is still 269.5MB. Free memory was 241.7MB in the beginning and 240.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 438.92ms. Allocated memory is still 269.5MB. Free memory was 240.1MB in the beginning and 226.7MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 20654.77ms. Allocated memory was 269.5MB in the beginning and 328.2MB in the end (delta: 58.7MB). Free memory was 226.2MB in the beginning and 262.5MB in the end (delta: -36.4MB). Peak memory consumption was 175.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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 320 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 488 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1049 IncrementalHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 166 mSDtfsCounter, 1049 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 739 GetRequests, 565 SyntacticMatches, 6 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=8, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 81 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 125 PreInvPairs, 175 NumberOfFragments, 363 HoareAnnotationTreeSize, 125 FomulaSimplifications, 4937 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 9952 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((i < n && j <= i * 2) && i <= 1) && i * 2 <= j) && 1 <= i) || ((((i < n && j + 2 <= i + n * 2) && k + 2 <= i + n * 2) && i * 2 <= j) && 1 <= i)) || (((i < n && j <= i + 1) && i == 0) && i * 2 <= j) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((j <= i + 1 && i <= 1) && 1 <= i) || (((k + 3 <= i + n * 2 && 2 <= n) && j + 3 <= i + n * 2) && 1 <= i)) || i == 0 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((i < n && j + 3 <= i + n * 2) && k + 2 <= i + n * 2) && i * 2 <= j) && 1 <= i - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= \old(cond)) || 1 <= cond) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-08 09:29:36,900 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...