/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/nla-digbench-scaling/ps5-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:23:17,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:23:17,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:23:17,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:23:17,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:23:17,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:23:17,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:23:17,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:23:17,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:23:17,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:23:17,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:23:17,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:23:17,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:23:17,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:23:17,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:23:17,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:23:17,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:23:17,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:23:17,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:23:17,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:23:17,731 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:23:17,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:23:17,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:23:17,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:23:17,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:23:17,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:23:17,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:23:17,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:23:17,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:23:17,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:23:17,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:23:17,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:23:17,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:23:17,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:23:17,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:23:17,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:23:17,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:23:17,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:23:17,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:23:17,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:23:17,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:23:17,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:23:17,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:23:17,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:23:17,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:23:17,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:23:17,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:23:17,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:23:17,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:23:17,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:23:17,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:23:17,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:23:17,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:23:17,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:23:17,756 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:23:17,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:23:17,757 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:23:17,757 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-28 14:23:17,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:23:17,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:23:17,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:23:17,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:23:17,939 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:23:17,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound20.c [2022-04-28 14:23:17,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e9fdb5b/93fd89b381824f85846e9d721a81b062/FLAG249334bf3 [2022-04-28 14:23:18,312 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:23:18,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound20.c [2022-04-28 14:23:18,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e9fdb5b/93fd89b381824f85846e9d721a81b062/FLAG249334bf3 [2022-04-28 14:23:18,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e9fdb5b/93fd89b381824f85846e9d721a81b062 [2022-04-28 14:23:18,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:23:18,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:23:18,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:23:18,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:23:18,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:23:18,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686883ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18, skipping insertion in model container [2022-04-28 14:23:18,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:23:18,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:23:18,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound20.c[458,471] [2022-04-28 14:23:18,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:23:18,913 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:23:18,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound20.c[458,471] [2022-04-28 14:23:18,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:23:18,935 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:23:18,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18 WrapperNode [2022-04-28 14:23:18,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:23:18,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:23:18,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:23:18,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:23:18,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:23:18,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:23:18,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:23:18,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:23:18,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (1/1) ... [2022-04-28 14:23:18,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:23:18,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:18,993 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-28 14:23:18,994 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-28 14:23:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:23:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:23:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:23:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:23:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:23:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:23:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:23:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:23:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:23:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:23:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:23:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:23:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:23:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:23:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:23:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:23:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:23:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:23:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:23:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:23:19,052 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:23:19,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:23:19,176 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:23:19,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:23:19,181 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:23:19,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:23:19 BoogieIcfgContainer [2022-04-28 14:23:19,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:23:19,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:23:19,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:23:19,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:23:19,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:23:18" (1/3) ... [2022-04-28 14:23:19,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418037ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:23:19, skipping insertion in model container [2022-04-28 14:23:19,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:18" (2/3) ... [2022-04-28 14:23:19,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418037ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:23:19, skipping insertion in model container [2022-04-28 14:23:19,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:23:19" (3/3) ... [2022-04-28 14:23:19,190 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound20.c [2022-04-28 14:23:19,200 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:23:19,200 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:23:19,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:23:19,233 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@404b0750, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c5a70c7 [2022-04-28 14:23:19,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:23:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:23:19,243 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:19,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:19,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 14:23:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:19,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867412698] [2022-04-28 14:23:19,267 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:23:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 14:23:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:19,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501866391] [2022-04-28 14:23:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:23:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:19,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 14:23:19,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:23:19,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 14:23:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:23:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:19,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:23:19,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:23:19,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:23:19,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:23:19,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:23:19,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 14:23:19,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:23:19,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 14:23:19,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 14:23:19,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 14:23:19,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 14:23:19,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:23:19,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:23:19,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:23:19,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:23:19,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 14:23:19,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 14:23:19,449 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-28 14:23:19,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 14:23:19,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 14:23:19,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 14:23:19,450 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-28 14:23:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:19,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501866391] [2022-04-28 14:23:19,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501866391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:19,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:19,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:23:19,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:19,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867412698] [2022-04-28 14:23:19,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867412698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:19,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:19,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:23:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964335748] [2022-04-28 14:23:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:19,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:23:19,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:19,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:19,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:19,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:23:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:23:19,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:23:19,509 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:19,623 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 14:23:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:23:19,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:23:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 14:23:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 14:23:19,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 14:23:19,722 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-28 14:23:19,727 INFO L225 Difference]: With dead ends: 50 [2022-04-28 14:23:19,728 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 14:23:19,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:23:19,731 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:19,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 14:23:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 14:23:19,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:19,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:19,752 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:19,753 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:19,755 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 14:23:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 14:23:19,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:19,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:19,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 14:23:19,766 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 14:23:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:19,768 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 14:23:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 14:23:19,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:19,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:19,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:19,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 14:23:19,773 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 14:23:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:19,773 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 14:23:19,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:19,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 14:23:19,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 14:23:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:23:19,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:19,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:19,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:23:19,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 14:23:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:19,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172266788] [2022-04-28 14:23:19,814 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:23:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 14:23:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:19,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036734153] [2022-04-28 14:23:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:19,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:19,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954032525] [2022-04-28 14:23:19,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:19,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:19,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:19,839 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-28 14:23:19,840 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-28 14:23:19,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:23:19,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:19,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:23:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:19,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:20,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 14:23:20,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:20,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-28 14:23:20,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {243#false} is VALID [2022-04-28 14:23:20,033 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {243#false} is VALID [2022-04-28 14:23:20,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 14:23:20,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 14:23:20,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 14:23:20,034 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-28 14:23:20,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:23:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:20,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036734153] [2022-04-28 14:23:20,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:20,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954032525] [2022-04-28 14:23:20,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954032525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:20,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:20,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:23:20,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:20,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [172266788] [2022-04-28 14:23:20,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [172266788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:20,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:20,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:23:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087317199] [2022-04-28 14:23:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 14:23:20,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:20,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:20,051 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-28 14:23:20,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:23:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:23:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:23:20,052 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:20,103 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 14:23:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:23:20,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 14:23:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 14:23:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 14:23:20,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 14:23:20,138 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-28 14:23:20,139 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:23:20,140 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:23:20,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:23:20,142 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:20,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:23:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:23:20,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:20,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:20,164 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:20,164 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:20,168 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:23:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:23:20,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:20,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:20,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 14:23:20,170 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 14:23:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:20,173 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:23:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:23:20,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:20,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:20,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:20,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 14:23:20,179 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 14:23:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:20,179 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 14:23:20,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:20,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 14:23:20,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:23:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:23:20,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:20,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:20,225 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-28 14:23:20,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:20,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 14:23:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:20,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997545488] [2022-04-28 14:23:20,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:23:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 14:23:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:20,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890836014] [2022-04-28 14:23:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:20,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:20,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114142131] [2022-04-28 14:23:20,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:20,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:20,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:20,432 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-28 14:23:20,433 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-28 14:23:20,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:23:20,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:20,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:23:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:20,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:20,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 14:23:20,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID [2022-04-28 14:23:20,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 14:23:20,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 14:23:20,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 14:23:20,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {471#true} is VALID [2022-04-28 14:23:20,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-28 14:23:20,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 14:23:20,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 14:23:20,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 14:23:20,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 14:23:20,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:20,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:20,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:20,566 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:20,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:20,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 14:23:20,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 14:23:20,567 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-28 14:23:20,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:23:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:20,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890836014] [2022-04-28 14:23:20,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:20,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114142131] [2022-04-28 14:23:20,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114142131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:20,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:20,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:23:20,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:20,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997545488] [2022-04-28 14:23:20,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997545488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:20,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:20,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:23:20,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450298699] [2022-04-28 14:23:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:20,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 14:23:20,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:20,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:20,582 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-28 14:23:20,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:23:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:23:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:23:20,582 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:20,784 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 14:23:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:23:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 14:23:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:23:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:23:20,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:23:20,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:20,819 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:23:20,819 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 14:23:20,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:23:20,820 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:20,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 14:23:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 14:23:20,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:20,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:20,834 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:20,835 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:20,836 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 14:23:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:23:20,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:20,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:20,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 14:23:20,837 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 14:23:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:20,838 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 14:23:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:23:20,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:20,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:20,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:20,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 14:23:20,840 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 14:23:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:20,840 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 14:23:20,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:20,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 14:23:20,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:23:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:23:20,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:20,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:20,893 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-28 14:23:21,087 WARN L477 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-28 14:23:21,087 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:21,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 14:23:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:21,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [554611122] [2022-04-28 14:23:21,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:21,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 14:23:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:21,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608804274] [2022-04-28 14:23:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:21,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:21,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:21,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186319259] [2022-04-28 14:23:21,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:21,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:21,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:21,245 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-28 14:23:21,246 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-28 14:23:21,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:21,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:21,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:23:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:21,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:21,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 14:23:21,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,475 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:21,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:21,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:21,476 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:21,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:21,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:21,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:21,478 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:21,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:21,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-28 14:23:21,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-28 14:23:21,479 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {732#false} is VALID [2022-04-28 14:23:21,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 14:23:21,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 14:23:21,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 14:23:21,480 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-28 14:23:21,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:21,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 14:23:21,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 14:23:21,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 14:23:21,618 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {732#false} is VALID [2022-04-28 14:23:21,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-28 14:23:21,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:23:21,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 20)} is VALID [2022-04-28 14:23:21,620 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 20)} #55#return; {830#(< ~counter~0 20)} is VALID [2022-04-28 14:23:21,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 14:23:21,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 14:23:21,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 14:23:21,621 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {731#true} is VALID [2022-04-28 14:23:21,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-28 14:23:21,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-28 14:23:21,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 19)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:23:21,622 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 19)} #53#return; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:23:21,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 14:23:21,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 14:23:21,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 14:23:21,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 19)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 14:23:21,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 19)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:23:21,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 19)} call #t~ret6 := main(); {855#(< ~counter~0 19)} is VALID [2022-04-28 14:23:21,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 19)} {731#true} #61#return; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:23:21,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 19)} assume true; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:23:21,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:23:21,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 14:23:21,626 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-28 14:23:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608804274] [2022-04-28 14:23:21,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186319259] [2022-04-28 14:23:21,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186319259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:23:21,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:23:21,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 14:23:21,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [554611122] [2022-04-28 14:23:21,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [554611122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:21,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:21,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:23:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191634904] [2022-04-28 14:23:21,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:21,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 14:23:21,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:21,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:21,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:21,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:23:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:23:21,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:23:21,645 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:21,743 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 14:23:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:23:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 14:23:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 14:23:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 14:23:21,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 14:23:21,775 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-28 14:23:21,776 INFO L225 Difference]: With dead ends: 42 [2022-04-28 14:23:21,776 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:23:21,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:23:21,777 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:21,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:23:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 14:23:21,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:21,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:21,823 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:21,824 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:21,826 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 14:23:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:23:21,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:21,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:21,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 14:23:21,830 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 14:23:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:21,833 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 14:23:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:23:21,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:21,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:21,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:21,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 14:23:21,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 14:23:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:21,836 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 14:23:21,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:21,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 14:23:21,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:23:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:23:21,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:21,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:21,891 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-28 14:23:22,074 WARN L477 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-28 14:23:22,075 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:22,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 14:23:22,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:22,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2108328081] [2022-04-28 14:23:22,180 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:22,180 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 14:23:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:22,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633490104] [2022-04-28 14:23:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:22,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:22,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850695668] [2022-04-28 14:23:22,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:22,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:22,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:22,192 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-28 14:23:22,193 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-28 14:23:22,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:22,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:22,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:23:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:22,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:22,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:23:22,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-28 14:23:22,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:23:22,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 14:23:22,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:23:22,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 14:23:22,358 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:23:22,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:23:22,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:23:22,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:23:22,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 14:23:22,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:22,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:22,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:22,368 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:23:22,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:23:22,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:23:22,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:23:22,369 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:22,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 14:23:22,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 14:23:22,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 14:23:22,370 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:22,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:22,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:23:22,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:23:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:23:22,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:22,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:23:22,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:23:22,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:22,509 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:22,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 14:23:22,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 14:23:24,577 WARN L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-28 14:23:24,578 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #55#return; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 14:23:24,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:23:24,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:23:24,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:23:24,578 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:23:24,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 14:23:24,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 14:23:24,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 14:23:24,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 14:23:24,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:23:24,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:23:24,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:23:24,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:23:24,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 14:23:24,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:23:24,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 14:23:24,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:23:24,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-28 14:23:24,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:23:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 14:23:24,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:24,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633490104] [2022-04-28 14:23:24,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:24,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850695668] [2022-04-28 14:23:24,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850695668] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:24,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:24,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:23:24,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:24,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2108328081] [2022-04-28 14:23:24,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2108328081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:24,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:24,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:23:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999690650] [2022-04-28 14:23:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:24,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 14:23:24,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:24,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:23:26,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:26,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:23:26,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:26,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:23:26,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:23:26,667 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:23:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:26,775 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 14:23:26,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:23:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 14:23:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:23:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:23:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:23:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:23:26,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 14:23:28,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:28,805 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:23:28,805 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 14:23:28,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:23:28,806 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:28,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 14:23:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 14:23:28,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:28,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:28,824 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:28,824 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:28,826 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:23:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:23:28,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:28,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:28,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 14:23:28,826 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 14:23:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:28,827 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:23:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:23:28,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:28,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:28,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:28,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 14:23:28,829 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 14:23:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:28,829 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 14:23:28,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:23:28,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 14:23:29,135 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-28 14:23:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:23:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:23:29,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:29,136 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:29,143 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-28 14:23:29,336 WARN L477 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-28 14:23:29,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 14:23:29,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:29,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [297962774] [2022-04-28 14:23:29,441 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:29,441 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 14:23:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:29,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470453158] [2022-04-28 14:23:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:29,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:29,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1906304230] [2022-04-28 14:23:29,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:29,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:29,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:29,451 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-28 14:23:29,458 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-28 14:23:29,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:29,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:29,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:23:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:29,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:29,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-28 14:23:29,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:23:29,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-28 14:23:29,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:29,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:29,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:29,757 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 14:23:29,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:23:29,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:23:29,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:23:29,772 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:29,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:23:29,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:23:29,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:23:29,774 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 14:23:29,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:23:29,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:23:29,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:23:29,774 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:23:29,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:29,775 INFO L272 TraceCheckUtils]: 28: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 14:23:29,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:23:29,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:23:29,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:23:29,776 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:29,776 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:29,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:29,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-28 14:23:29,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 14:23:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:23:29,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:30,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:30,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470453158] [2022-04-28 14:23:30,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:30,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906304230] [2022-04-28 14:23:30,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906304230] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:30,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:30,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:23:30,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:30,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [297962774] [2022-04-28 14:23:30,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [297962774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:30,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:30,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:23:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976770588] [2022-04-28 14:23:30,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:30,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 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 37 [2022-04-28 14:23:30,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:30,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 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-28 14:23:30,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:30,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:23:30,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:30,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:23:30,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:23:30,088 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 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-28 14:23:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:30,310 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 14:23:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:23:30,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 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 37 [2022-04-28 14:23:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 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-28 14:23:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 14:23:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 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-28 14:23:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 14:23:30,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 14:23:30,343 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-28 14:23:30,344 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:23:30,344 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:23:30,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:23:30,345 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:30,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:23:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:23:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 14:23:30,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:30,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:30,369 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:30,369 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:30,371 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 14:23:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:23:30,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:30,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:30,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-28 14:23:30,371 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-28 14:23:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:30,372 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 14:23:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:23:30,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:30,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:30,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:30,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 14:23:30,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 14:23:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:30,374 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 14:23:30,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 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-28 14:23:30,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 14:23:32,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:23:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:23:32,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:32,508 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:32,526 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-28 14:23:32,708 WARN L477 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-28 14:23:32,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:32,708 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 14:23:32,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:32,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597478693] [2022-04-28 14:23:32,809 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:32,809 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:32,809 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 14:23:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:32,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661843221] [2022-04-28 14:23:32,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:32,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:32,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:32,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415443640] [2022-04-28 14:23:32,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:32,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:32,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:32,833 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-28 14:23:32,834 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-28 14:23:32,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:32,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:32,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:23:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:32,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:33,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 14:23:33,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:33,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:33,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:33,072 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:33,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:33,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:33,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:33,073 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:33,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:33,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:33,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:33,075 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:33,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:33,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:33,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:33,076 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:33,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:33,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-28 14:23:33,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-28 14:23:33,078 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 14:23:33,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:23:33,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-28 14:23:33,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-28 14:23:33,078 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 14:23:33,079 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 14:23:33,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:23:33,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 14:23:33,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 14:23:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:23:33,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:33,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 14:23:33,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 14:23:33,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:23:33,289 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 14:23:33,289 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 14:23:33,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:23:33,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:23:33,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:23:33,292 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 14:23:33,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-28 14:23:33,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:23:33,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 20)} is VALID [2022-04-28 14:23:33,295 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 20)} #55#return; {2079#(< ~counter~0 20)} is VALID [2022-04-28 14:23:33,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:23:33,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:23:33,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:23:33,297 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 14:23:33,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-28 14:23:33,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-28 14:23:33,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 19)} is VALID [2022-04-28 14:23:33,300 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 19)} #55#return; {2104#(< ~counter~0 19)} is VALID [2022-04-28 14:23:33,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:23:33,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:23:33,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:23:33,300 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 14:23:33,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-28 14:23:33,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-28 14:23:33,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 18)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:23:33,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 18)} #53#return; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:23:33,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:23:33,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:23:33,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:23:33,302 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 18)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-28 14:23:33,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 18)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:23:33,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 18)} call #t~ret6 := main(); {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:23:33,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 18)} {1925#true} #61#return; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:23:33,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 18)} assume true; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:23:33,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:23:33,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 14:23:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:23:33,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:33,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661843221] [2022-04-28 14:23:33,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:33,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415443640] [2022-04-28 14:23:33,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415443640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:23:33,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:23:33,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 14:23:33,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:33,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597478693] [2022-04-28 14:23:33,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597478693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:33,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:33,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:23:33,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65480110] [2022-04-28 14:23:33,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 14:23:33,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:33,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:33,333 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-28 14:23:33,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:23:33,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:23:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:23:33,334 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:33,486 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-28 14:23:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:23:33,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 14:23:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 14:23:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 14:23:33,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 14:23:33,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:33,529 INFO L225 Difference]: With dead ends: 54 [2022-04-28 14:23:33,529 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 14:23:33,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:23:33,530 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:33,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 14:23:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 14:23:33,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:33,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:33,562 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:33,562 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:33,564 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:23:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:23:33,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:33,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:33,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 14:23:33,565 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 14:23:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:33,566 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:23:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:23:33,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:33,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:33,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:33,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 14:23:33,568 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-28 14:23:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:33,568 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 14:23:33,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:23:33,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 14:23:34,036 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-28 14:23:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:23:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 14:23:34,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:34,037 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:34,053 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-28 14:23:34,237 WARN L477 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-28 14:23:34,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:34,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-28 14:23:34,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:34,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [155922867] [2022-04-28 14:23:34,339 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:34,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-28 14:23:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:34,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262434396] [2022-04-28 14:23:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:34,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:34,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079145364] [2022-04-28 14:23:34,361 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:23:34,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:34,365 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-28 14:23:34,366 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-28 14:23:34,398 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:23:34,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:34,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 14:23:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:34,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:34,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:23:34,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:23:34,700 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-28 14:23:34,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:34,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:34,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:34,701 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 14:23:34,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:23:34,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:23:34,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:23:34,702 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:34,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:23:34,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:23:34,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:23:34,703 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 14:23:34,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:23:34,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:23:34,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:23:34,704 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:23:34,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:23:34,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:23:34,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:23:34,706 INFO L272 TraceCheckUtils]: 30: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 14:23:34,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:23:34,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:23:34,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:23:34,707 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:23:34,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 14:23:34,708 INFO L272 TraceCheckUtils]: 36: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 14:23:34,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:23:34,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:23:34,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:23:34,708 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 14:23:34,709 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:34,709 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:34,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-28 14:23:34,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-28 14:23:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:23:34,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:34,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:34,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262434396] [2022-04-28 14:23:34,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:34,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079145364] [2022-04-28 14:23:34,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079145364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:34,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:34,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 14:23:34,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:34,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [155922867] [2022-04-28 14:23:34,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [155922867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:34,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:34,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:23:34,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395046136] [2022-04-28 14:23:34,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:34,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 14:23:34,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:34,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:23:34,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:34,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:23:34,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:34,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:23:34,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:23:34,989 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:23:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:35,298 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 14:23:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:23:35,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 14:23:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:23:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 14:23:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:23:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 14:23:35,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 14:23:35,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:35,335 INFO L225 Difference]: With dead ends: 52 [2022-04-28 14:23:35,335 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 14:23:35,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:23:35,336 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:35,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:23:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 14:23:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 14:23:35,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:35,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:35,398 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:35,398 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:35,399 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 14:23:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:23:35,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:35,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:35,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 14:23:35,400 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 14:23:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:35,401 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 14:23:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:23:35,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:35,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:35,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:35,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-28 14:23:35,402 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-28 14:23:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:35,402 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-28 14:23:35,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:23:35,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-28 14:23:35,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:23:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 14:23:35,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:35,883 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:35,899 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-28 14:23:36,091 WARN L477 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-28 14:23:36,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-28 14:23:36,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:36,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [304201176] [2022-04-28 14:23:36,176 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:36,176 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-28 14:23:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:36,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201538586] [2022-04-28 14:23:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:36,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:36,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733707575] [2022-04-28 14:23:36,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:23:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:36,185 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-28 14:23:36,186 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-28 14:23:36,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:23:36,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:36,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:23:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:36,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:36,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 14:23:36,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:36,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:36,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:36,458 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:36,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:36,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:36,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:36,460 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:36,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:36,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:36,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:36,461 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:36,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:36,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:36,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:36,462 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:36,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:36,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:36,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:36,464 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:36,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:36,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:36,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:36,465 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:36,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {3042#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:36,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-28 14:23:36,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-28 14:23:36,466 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 14:23:36,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:23:36,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-28 14:23:36,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-28 14:23:36,467 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 14:23:36,467 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 14:23:36,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:23:36,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 14:23:36,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 14:23:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:23:36,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:36,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 14:23:36,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 14:23:36,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:23:36,696 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 14:23:36,696 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 14:23:36,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:23:36,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:23:36,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:23:36,697 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:23:36,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-28 14:23:36,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:23:36,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 20)} is VALID [2022-04-28 14:23:36,700 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 20)} #55#return; {3129#(< ~counter~0 20)} is VALID [2022-04-28 14:23:36,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:23:36,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:23:36,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:23:36,701 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:23:36,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-28 14:23:36,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-28 14:23:36,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 19)} is VALID [2022-04-28 14:23:36,702 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 19)} #55#return; {3154#(< ~counter~0 19)} is VALID [2022-04-28 14:23:36,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:23:36,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:23:36,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:23:36,703 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:23:36,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-28 14:23:36,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-28 14:23:36,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 18)} is VALID [2022-04-28 14:23:36,704 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 18)} #55#return; {3179#(< ~counter~0 18)} is VALID [2022-04-28 14:23:36,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:23:36,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:23:36,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:23:36,704 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:23:36,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-28 14:23:36,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-28 14:23:36,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 17)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:23:36,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 17)} #53#return; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:23:36,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:23:36,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:23:36,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:23:36,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 17)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:23:36,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 17)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:23:36,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 17)} call #t~ret6 := main(); {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:23:36,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 17)} {2950#true} #61#return; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:23:36,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 17)} assume true; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:23:36,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:23:36,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 14:23:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:23:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:36,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201538586] [2022-04-28 14:23:36,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:36,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733707575] [2022-04-28 14:23:36,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733707575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:23:36,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:23:36,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 14:23:36,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:36,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [304201176] [2022-04-28 14:23:36,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [304201176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:36,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:36,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:23:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710246684] [2022-04-28 14:23:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:36,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 14:23:36,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:36,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:36,752 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-28 14:23:36,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:23:36,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:36,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:23:36,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:23:36,753 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:36,918 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-28 14:23:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:23:36,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 14:23:36,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 14:23:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 14:23:36,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 14:23:36,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:36,965 INFO L225 Difference]: With dead ends: 62 [2022-04-28 14:23:36,965 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 14:23:36,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:23:36,967 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:36,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 14:23:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 14:23:37,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:37,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:37,012 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:37,012 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:37,014 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 14:23:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:23:37,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:37,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:37,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 14:23:37,014 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 14:23:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:37,015 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 14:23:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:23:37,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:37,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:37,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:37,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 14:23:37,017 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-28 14:23:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:37,017 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 14:23:37,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:23:37,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 14:23:37,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:23:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 14:23:37,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:37,318 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:37,335 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-28 14:23:37,527 WARN L477 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-28 14:23:37,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-28 14:23:37,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:37,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527343906] [2022-04-28 14:23:37,625 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:37,626 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-28 14:23:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:37,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953002125] [2022-04-28 14:23:37,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:37,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:37,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760095227] [2022-04-28 14:23:37,643 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:23:37,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:37,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:37,644 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:37,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 14:23:38,021 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:23:38,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:38,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:23:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:38,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:38,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-28 14:23:38,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3581#true} is VALID [2022-04-28 14:23:38,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:23:38,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-28 14:23:38,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-28 14:23:38,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3581#true} is VALID [2022-04-28 14:23:38,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-28 14:23:38,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:23:38,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:23:38,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:23:38,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-28 14:23:38,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:38,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:38,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:38,344 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 14:23:38,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:23:38,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:23:38,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:23:38,344 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:38,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:38,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:38,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:38,346 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 14:23:38,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:23:38,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:23:38,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:23:38,346 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:38,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:23:38,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:23:38,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:23:38,347 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 14:23:38,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:23:38,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:23:38,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:23:38,348 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:23:38,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:23:38,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:23:38,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:23:38,349 INFO L272 TraceCheckUtils]: 38: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 14:23:38,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:23:38,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:23:38,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:23:38,350 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:23:38,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:23:38,350 INFO L272 TraceCheckUtils]: 44: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 14:23:38,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:23:38,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:23:38,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:23:38,351 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:23:38,351 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:38,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:38,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-28 14:23:38,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-28 14:23:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:23:38,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953002125] [2022-04-28 14:23:38,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:38,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760095227] [2022-04-28 14:23:38,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760095227] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:38,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:38,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 14:23:38,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:38,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527343906] [2022-04-28 14:23:38,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527343906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:38,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:38,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:23:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400092469] [2022-04-28 14:23:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:38,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 14:23:38,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:38,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:23:38,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:38,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:23:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:38,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:23:38,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:23:38,629 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:23:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:39,042 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 14:23:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:23:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 14:23:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:23:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 14:23:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:23:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 14:23:39,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 14:23:39,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:39,090 INFO L225 Difference]: With dead ends: 60 [2022-04-28 14:23:39,090 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 14:23:39,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:23:39,091 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:39,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:23:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 14:23:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 14:23:39,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:39,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:39,141 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:39,141 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:39,142 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 14:23:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:23:39,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:39,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:39,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 14:23:39,143 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 14:23:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:39,146 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 14:23:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:23:39,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:39,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:39,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:39,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-28 14:23:39,147 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-28 14:23:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:39,147 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-28 14:23:39,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:23:39,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-28 14:23:41,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:23:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 14:23:41,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:41,664 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:41,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:41,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 14:23:41,864 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:41,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-28 14:23:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:41,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163288421] [2022-04-28 14:23:41,970 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:41,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-28 14:23:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:41,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088555835] [2022-04-28 14:23:41,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:41,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:41,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911214546] [2022-04-28 14:23:41,979 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:23:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:41,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:41,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:41,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 14:23:42,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 14:23:42,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:42,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 14:23:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:42,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:42,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 14:23:42,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {4156#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,604 INFO L272 TraceCheckUtils]: 6: Hoare triple {4156#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:42,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:42,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:42,607 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:42,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:42,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:42,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:42,608 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:42,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:42,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:42,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:42,610 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:42,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:42,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:42,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:42,611 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:42,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {4215#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:42,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {4215#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:42,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:42,613 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:42,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:42,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:42,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:42,621 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:42,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {4240#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:42,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {4240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:42,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:42,624 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:42,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:42,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:42,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:42,625 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:42,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {4265#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:42,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {4265#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4290#(<= |main_#t~post5| 4)} is VALID [2022-04-28 14:23:42,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-28 14:23:42,626 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 14:23:42,626 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:23:42,626 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-28 14:23:42,626 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-28 14:23:42,626 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 14:23:42,626 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 14:23:42,627 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:23:42,627 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 14:23:42,627 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 14:23:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:23:42,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:42,896 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 14:23:42,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 14:23:42,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:23:42,896 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 14:23:42,896 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 14:23:42,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:23:42,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:23:42,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:23:42,897 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:23:42,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-28 14:23:42,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:23:42,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4352#(< ~counter~0 20)} is VALID [2022-04-28 14:23:42,898 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 20)} #55#return; {4352#(< ~counter~0 20)} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:23:42,898 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-28 14:23:42,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-28 14:23:42,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(< ~counter~0 19)} is VALID [2022-04-28 14:23:42,900 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 19)} #55#return; {4377#(< ~counter~0 19)} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:23:42,900 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-28 14:23:42,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-28 14:23:42,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4402#(< ~counter~0 18)} is VALID [2022-04-28 14:23:42,902 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 18)} #55#return; {4402#(< ~counter~0 18)} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:23:42,902 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-28 14:23:42,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-28 14:23:42,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4427#(< ~counter~0 17)} is VALID [2022-04-28 14:23:42,904 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 17)} #55#return; {4427#(< ~counter~0 17)} is VALID [2022-04-28 14:23:42,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:23:42,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:23:42,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:23:42,904 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:23:42,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 16)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:23:42,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 16)} #53#return; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:23:42,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 16)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:23:42,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 16)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:23:42,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 16)} call #t~ret6 := main(); {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:23:42,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 16)} {4148#true} #61#return; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:23:42,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 16)} assume true; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:23:42,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:23:42,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 14:23:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:23:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:42,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088555835] [2022-04-28 14:23:42,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:42,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911214546] [2022-04-28 14:23:42,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911214546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:23:42,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:23:42,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 14:23:42,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:42,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [163288421] [2022-04-28 14:23:42,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [163288421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:42,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:42,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:23:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360979220] [2022-04-28 14:23:42,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 14:23:42,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:42,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:42,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:42,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:23:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:23:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:23:42,942 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:43,115 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-28 14:23:43,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:23:43,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 14:23:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 14:23:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 14:23:43,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 14:23:43,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:43,163 INFO L225 Difference]: With dead ends: 70 [2022-04-28 14:23:43,163 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 14:23:43,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:23:43,164 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:43,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 14:23:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 14:23:43,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:43,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:43,212 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:43,212 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:43,213 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 14:23:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:23:43,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:43,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:43,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 14:23:43,213 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 14:23:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:43,214 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 14:23:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:23:43,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:43,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:43,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:43,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 14:23:43,215 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 14:23:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:43,216 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 14:23:43,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:23:43,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 14:23:43,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:23:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 14:23:43,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:43,552 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:43,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:43,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 14:23:43,753 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:43,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-28 14:23:43,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:43,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876031057] [2022-04-28 14:23:43,840 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:43,840 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-28 14:23:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:43,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421571012] [2022-04-28 14:23:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:43,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:43,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:43,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718201680] [2022-04-28 14:23:43,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:43,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:43,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:43,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:43,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 14:23:44,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:44,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:44,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 14:23:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:44,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:44,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:44,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:44,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 14:23:44,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:44,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:44,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:44,853 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:44,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:44,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:44,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:44,853 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:44,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:23:44,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:23:44,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:23:44,855 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:44,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:44,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:23:44,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:23:44,856 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:23:44,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-28 14:23:44,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-28 14:23:44,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-28 14:23:44,858 INFO L272 TraceCheckUtils]: 30: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:44,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:44,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:23:44,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:23:44,859 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} #55#return; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-28 14:23:44,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:23:44,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:23:44,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:23:44,861 INFO L272 TraceCheckUtils]: 38: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:44,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:44,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:23:44,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:23:44,862 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #55#return; {5016#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:23:44,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {5016#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:23:44,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:23:44,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:23:44,863 INFO L272 TraceCheckUtils]: 46: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:44,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:44,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:44,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:44,864 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:23:44,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 14:23:44,865 INFO L272 TraceCheckUtils]: 52: Hoare triple {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:44,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:44,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:44,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:44,865 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 14:23:44,866 INFO L272 TraceCheckUtils]: 57: Hoare triple {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:44,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:44,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {5068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 14:23:44,867 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 14:23:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 61 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-28 14:23:44,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:46,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 14:23:46,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {5068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 14:23:46,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:46,040 INFO L272 TraceCheckUtils]: 57: Hoare triple {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:46,040 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} #57#return; {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-28 14:23:46,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:46,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:46,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:46,040 INFO L272 TraceCheckUtils]: 52: Hoare triple {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:46,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} assume !(~c~0 < ~k~0); {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-28 14:23:46,041 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} #55#return; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-28 14:23:46,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:46,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:46,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:46,042 INFO L272 TraceCheckUtils]: 46: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:46,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-28 14:23:46,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-28 14:23:46,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {5128#(or (not (< main_~c~0 main_~k~0)) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-28 14:23:46,045 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #55#return; {5128#(or (not (< main_~c~0 main_~k~0)) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 14:23:46,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:23:46,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {5142#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:23:46,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {5142#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:23:46,046 INFO L272 TraceCheckUtils]: 38: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:46,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !!(#t~post5 < 20);havoc #t~post5; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 14:23:46,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 14:23:46,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 14:23:46,485 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #55#return; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 14:23:46,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:46,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:46,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:46,485 INFO L272 TraceCheckUtils]: 30: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:46,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !!(#t~post5 < 20);havoc #t~post5; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 14:23:46,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 14:23:48,502 WARN L290 TraceCheckUtils]: 27: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is UNKNOWN [2022-04-28 14:23:48,503 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} #55#return; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-28 14:23:48,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:48,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:48,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:48,504 INFO L272 TraceCheckUtils]: 22: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:48,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-28 14:23:48,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-28 14:23:49,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-28 14:23:49,002 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} #55#return; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-28 14:23:49,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:49,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:49,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:49,003 INFO L272 TraceCheckUtils]: 14: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:49,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-28 14:23:49,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-28 14:23:49,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-28 14:23:49,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4879#true} is VALID [2022-04-28 14:23:49,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 14:23:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 20 proven. 47 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 14:23:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:49,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421571012] [2022-04-28 14:23:49,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:49,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718201680] [2022-04-28 14:23:49,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718201680] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:23:49,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:23:49,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 14:23:49,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:49,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876031057] [2022-04-28 14:23:49,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876031057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:49,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:49,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:23:49,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174173373] [2022-04-28 14:23:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:49,008 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-28 14:23:49,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:49,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:23:49,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:49,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:23:49,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:49,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:23:49,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:23:49,045 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:23:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:49,900 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 14:23:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:23:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-28 14:23:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:23:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-04-28 14:23:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:23:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-04-28 14:23:49,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 61 transitions. [2022-04-28 14:23:49,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:49,960 INFO L225 Difference]: With dead ends: 68 [2022-04-28 14:23:49,960 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 14:23:49,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:23:49,961 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:49,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 255 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:23:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 14:23:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 14:23:50,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:50,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:50,018 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:50,019 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:50,020 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 14:23:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:23:50,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:50,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:50,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 14:23:50,020 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 14:23:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:50,021 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 14:23:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:23:50,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:50,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:50,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:50,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 14:23:50,023 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-28 14:23:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:50,023 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 14:23:50,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:23:50,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 14:23:50,310 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-28 14:23:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:23:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 14:23:50,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:50,311 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:50,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:50,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 14:23:50,516 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:50,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-28 14:23:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:50,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1981692059] [2022-04-28 14:23:50,594 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:50,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-28 14:23:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:50,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812628987] [2022-04-28 14:23:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:50,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:50,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989079874] [2022-04-28 14:23:50,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:50,610 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:50,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 14:23:50,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:50,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:50,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:23:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:50,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:50,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {5655#true} call ULTIMATE.init(); {5655#true} is VALID [2022-04-28 14:23:50,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {5655#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {5663#(<= ~counter~0 0)} assume true; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5663#(<= ~counter~0 0)} {5655#true} #61#return; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {5663#(<= ~counter~0 0)} call #t~ret6 := main(); {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {5663#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {5663#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {5663#(<= ~counter~0 0)} ~cond := #in~cond; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {5663#(<= ~counter~0 0)} assume !(0 == ~cond); {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {5663#(<= ~counter~0 0)} assume true; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5663#(<= ~counter~0 0)} {5663#(<= ~counter~0 0)} #53#return; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {5663#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:50,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {5663#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:50,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {5697#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:50,924 INFO L272 TraceCheckUtils]: 14: Hoare triple {5697#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5697#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:50,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {5697#(<= ~counter~0 1)} ~cond := #in~cond; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:50,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {5697#(<= ~counter~0 1)} assume !(0 == ~cond); {5697#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:50,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {5697#(<= ~counter~0 1)} assume true; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:50,925 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5697#(<= ~counter~0 1)} {5697#(<= ~counter~0 1)} #55#return; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:50,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {5697#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:50,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {5697#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:50,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {5722#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:50,927 INFO L272 TraceCheckUtils]: 22: Hoare triple {5722#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5722#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:50,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {5722#(<= ~counter~0 2)} ~cond := #in~cond; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:50,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {5722#(<= ~counter~0 2)} assume !(0 == ~cond); {5722#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:50,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {5722#(<= ~counter~0 2)} assume true; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:50,928 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5722#(<= ~counter~0 2)} {5722#(<= ~counter~0 2)} #55#return; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:50,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {5722#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:50,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {5722#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:50,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {5747#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:50,929 INFO L272 TraceCheckUtils]: 30: Hoare triple {5747#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5747#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:50,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {5747#(<= ~counter~0 3)} ~cond := #in~cond; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:50,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {5747#(<= ~counter~0 3)} assume !(0 == ~cond); {5747#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:50,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {5747#(<= ~counter~0 3)} assume true; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:50,931 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5747#(<= ~counter~0 3)} {5747#(<= ~counter~0 3)} #55#return; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:50,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {5747#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:50,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {5747#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:50,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {5772#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:50,944 INFO L272 TraceCheckUtils]: 38: Hoare triple {5772#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5772#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:50,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {5772#(<= ~counter~0 4)} ~cond := #in~cond; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:50,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {5772#(<= ~counter~0 4)} assume !(0 == ~cond); {5772#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:50,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {5772#(<= ~counter~0 4)} assume true; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:50,945 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5772#(<= ~counter~0 4)} {5772#(<= ~counter~0 4)} #55#return; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:50,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {5772#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:50,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {5772#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:50,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {5797#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:50,947 INFO L272 TraceCheckUtils]: 46: Hoare triple {5797#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5797#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:50,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {5797#(<= ~counter~0 5)} ~cond := #in~cond; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:50,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {5797#(<= ~counter~0 5)} assume !(0 == ~cond); {5797#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:50,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {5797#(<= ~counter~0 5)} assume true; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:50,948 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5797#(<= ~counter~0 5)} {5797#(<= ~counter~0 5)} #55#return; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:50,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {5797#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:50,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {5797#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5822#(<= |main_#t~post5| 5)} is VALID [2022-04-28 14:23:50,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {5822#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L272 TraceCheckUtils]: 54: Hoare triple {5656#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L290 TraceCheckUtils]: 55: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L290 TraceCheckUtils]: 56: Hoare triple {5656#false} assume !(0 == ~cond); {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L290 TraceCheckUtils]: 57: Hoare triple {5656#false} assume true; {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5656#false} {5656#false} #57#return; {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L272 TraceCheckUtils]: 59: Hoare triple {5656#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L290 TraceCheckUtils]: 60: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L290 TraceCheckUtils]: 61: Hoare triple {5656#false} assume 0 == ~cond; {5656#false} is VALID [2022-04-28 14:23:50,949 INFO L290 TraceCheckUtils]: 62: Hoare triple {5656#false} assume !false; {5656#false} is VALID [2022-04-28 14:23:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:23:50,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:51,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {5656#false} assume !false; {5656#false} is VALID [2022-04-28 14:23:51,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {5656#false} assume 0 == ~cond; {5656#false} is VALID [2022-04-28 14:23:51,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-28 14:23:51,252 INFO L272 TraceCheckUtils]: 59: Hoare triple {5656#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-28 14:23:51,252 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5655#true} {5656#false} #57#return; {5656#false} is VALID [2022-04-28 14:23:51,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 14:23:51,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 14:23:51,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 14:23:51,252 INFO L272 TraceCheckUtils]: 54: Hoare triple {5656#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 14:23:51,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {5880#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5656#false} is VALID [2022-04-28 14:23:51,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {5884#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5880#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:23:51,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {5884#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5884#(< ~counter~0 20)} is VALID [2022-04-28 14:23:51,253 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5655#true} {5884#(< ~counter~0 20)} #55#return; {5884#(< ~counter~0 20)} is VALID [2022-04-28 14:23:51,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 14:23:51,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 14:23:51,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 14:23:51,254 INFO L272 TraceCheckUtils]: 46: Hoare triple {5884#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 14:23:51,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {5884#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5884#(< ~counter~0 20)} is VALID [2022-04-28 14:23:51,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {5909#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5884#(< ~counter~0 20)} is VALID [2022-04-28 14:23:51,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {5909#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5909#(< ~counter~0 19)} is VALID [2022-04-28 14:23:51,255 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5655#true} {5909#(< ~counter~0 19)} #55#return; {5909#(< ~counter~0 19)} is VALID [2022-04-28 14:23:51,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 14:23:51,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 14:23:51,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 14:23:51,255 INFO L272 TraceCheckUtils]: 38: Hoare triple {5909#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 14:23:51,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {5909#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5909#(< ~counter~0 19)} is VALID [2022-04-28 14:23:51,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {5934#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5909#(< ~counter~0 19)} is VALID [2022-04-28 14:23:51,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {5934#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5934#(< ~counter~0 18)} is VALID [2022-04-28 14:23:51,257 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5655#true} {5934#(< ~counter~0 18)} #55#return; {5934#(< ~counter~0 18)} is VALID [2022-04-28 14:23:51,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 14:23:51,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 14:23:51,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 14:23:51,257 INFO L272 TraceCheckUtils]: 30: Hoare triple {5934#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 14:23:51,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {5934#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5934#(< ~counter~0 18)} is VALID [2022-04-28 14:23:51,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {5959#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5934#(< ~counter~0 18)} is VALID [2022-04-28 14:23:51,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {5959#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5959#(< ~counter~0 17)} is VALID [2022-04-28 14:23:51,258 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5655#true} {5959#(< ~counter~0 17)} #55#return; {5959#(< ~counter~0 17)} is VALID [2022-04-28 14:23:51,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 14:23:51,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 14:23:51,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 14:23:51,259 INFO L272 TraceCheckUtils]: 22: Hoare triple {5959#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 14:23:51,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {5959#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5959#(< ~counter~0 17)} is VALID [2022-04-28 14:23:51,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {5984#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5959#(< ~counter~0 17)} is VALID [2022-04-28 14:23:51,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {5984#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5984#(< ~counter~0 16)} is VALID [2022-04-28 14:23:51,260 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5655#true} {5984#(< ~counter~0 16)} #55#return; {5984#(< ~counter~0 16)} is VALID [2022-04-28 14:23:51,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 14:23:51,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 14:23:51,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 14:23:51,260 INFO L272 TraceCheckUtils]: 14: Hoare triple {5984#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 14:23:51,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {5984#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {5984#(< ~counter~0 16)} is VALID [2022-04-28 14:23:51,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {6009#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5984#(< ~counter~0 16)} is VALID [2022-04-28 14:23:51,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {6009#(< ~counter~0 15)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6009#(< ~counter~0 15)} is VALID [2022-04-28 14:23:51,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5655#true} {6009#(< ~counter~0 15)} #53#return; {6009#(< ~counter~0 15)} is VALID [2022-04-28 14:23:51,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 14:23:51,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 14:23:51,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 14:23:51,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {6009#(< ~counter~0 15)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5655#true} is VALID [2022-04-28 14:23:51,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {6009#(< ~counter~0 15)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6009#(< ~counter~0 15)} is VALID [2022-04-28 14:23:51,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {6009#(< ~counter~0 15)} call #t~ret6 := main(); {6009#(< ~counter~0 15)} is VALID [2022-04-28 14:23:51,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6009#(< ~counter~0 15)} {5655#true} #61#return; {6009#(< ~counter~0 15)} is VALID [2022-04-28 14:23:51,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {6009#(< ~counter~0 15)} assume true; {6009#(< ~counter~0 15)} is VALID [2022-04-28 14:23:51,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {5655#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6009#(< ~counter~0 15)} is VALID [2022-04-28 14:23:51,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {5655#true} call ULTIMATE.init(); {5655#true} is VALID [2022-04-28 14:23:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 14:23:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:51,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812628987] [2022-04-28 14:23:51,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:51,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989079874] [2022-04-28 14:23:51,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989079874] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:23:51,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:23:51,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 14:23:51,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:51,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1981692059] [2022-04-28 14:23:51,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1981692059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:51,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:51,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:23:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824345878] [2022-04-28 14:23:51,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-28 14:23:51,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:51,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:51,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:51,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:23:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:23:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:23:51,304 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:51,529 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-28 14:23:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:23:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-28 14:23:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 14:23:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 14:23:51,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-28 14:23:51,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:51,583 INFO L225 Difference]: With dead ends: 78 [2022-04-28 14:23:51,583 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 14:23:51,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:23:51,583 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:51,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 14:23:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 14:23:51,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:51,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:51,656 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:51,656 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:51,657 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 14:23:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:23:51,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:51,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:51,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-28 14:23:51,658 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-28 14:23:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:51,659 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 14:23:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:23:51,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:51,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:51,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:51,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-28 14:23:51,660 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-28 14:23:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:51,660 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-28 14:23:51,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:23:51,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-28 14:23:53,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:23:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 14:23:53,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:53,749 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:53,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:53,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 14:23:53,951 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:53,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-28 14:23:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:53,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1261368027] [2022-04-28 14:23:54,032 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:54,033 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-28 14:23:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:54,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795125057] [2022-04-28 14:23:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:54,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:54,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416710313] [2022-04-28 14:23:54,041 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:23:54,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:54,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:54,042 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:54,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 14:23:54,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:23:54,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:54,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:23:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:54,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:54,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {6486#true} call ULTIMATE.init(); {6486#true} is VALID [2022-04-28 14:23:54,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {6486#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6486#true} is VALID [2022-04-28 14:23:54,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6486#true} {6486#true} #61#return; {6486#true} is VALID [2022-04-28 14:23:54,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {6486#true} call #t~ret6 := main(); {6486#true} is VALID [2022-04-28 14:23:54,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {6486#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6486#true} is VALID [2022-04-28 14:23:54,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {6486#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6486#true} is VALID [2022-04-28 14:23:54,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 14:23:54,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 14:23:54,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,487 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6486#true} {6486#true} #53#return; {6486#true} is VALID [2022-04-28 14:23:54,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {6486#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:54,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:54,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:54,488 INFO L272 TraceCheckUtils]: 14: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 14:23:54,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 14:23:54,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 14:23:54,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,489 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6486#true} {6524#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:54,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:23:54,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:23:54,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:23:54,490 INFO L272 TraceCheckUtils]: 22: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 14:23:54,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 14:23:54,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 14:23:54,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,490 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6486#true} {6549#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:23:54,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:23:54,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:23:54,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:23:54,491 INFO L272 TraceCheckUtils]: 30: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 14:23:54,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 14:23:54,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 14:23:54,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,492 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6486#true} {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:23:54,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 14:23:54,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 14:23:54,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 14:23:54,493 INFO L272 TraceCheckUtils]: 38: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 14:23:54,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 14:23:54,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 14:23:54,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,494 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6486#true} {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #55#return; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 14:23:54,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 14:23:54,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 14:23:54,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 14:23:54,495 INFO L272 TraceCheckUtils]: 46: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 14:23:54,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 14:23:54,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 14:23:54,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,495 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6486#true} {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #55#return; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 14:23:54,496 INFO L290 TraceCheckUtils]: 51: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:23:54,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:23:54,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:23:54,496 INFO L272 TraceCheckUtils]: 54: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 14:23:54,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 14:23:54,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 14:23:54,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,497 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6486#true} {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #55#return; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:23:54,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:23:54,498 INFO L272 TraceCheckUtils]: 60: Hoare triple {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 14:23:54,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 14:23:54,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 14:23:54,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 14:23:54,498 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6486#true} {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:23:54,499 INFO L272 TraceCheckUtils]: 65: Hoare triple {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:54,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {6693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:54,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {6697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6487#false} is VALID [2022-04-28 14:23:54,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {6487#false} assume !false; {6487#false} is VALID [2022-04-28 14:23:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:23:54,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:54,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:54,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795125057] [2022-04-28 14:23:54,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:54,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416710313] [2022-04-28 14:23:54,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416710313] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:54,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:54,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:23:54,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:54,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1261368027] [2022-04-28 14:23:54,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1261368027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:54,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:54,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:23:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814324700] [2022-04-28 14:23:54,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-28 14:23:54,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:54,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:23:54,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:54,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:23:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:54,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:23:54,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:23:54,772 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:23:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:55,343 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:23:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:23:55,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-28 14:23:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:23:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 14:23:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:23:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 14:23:55,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 14:23:55,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:55,399 INFO L225 Difference]: With dead ends: 76 [2022-04-28 14:23:55,399 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 14:23:55,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:23:55,400 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:55,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:23:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 14:23:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 14:23:55,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:55,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:23:55,465 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:23:55,465 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:23:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:55,466 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 14:23:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:23:55,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:55,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:55,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-28 14:23:55,467 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-28 14:23:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:55,468 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 14:23:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:23:55,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:55,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:55,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:55,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:23:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 14:23:55,469 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-28 14:23:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:55,469 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 14:23:55,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:23:55,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 14:23:57,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:23:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 14:23:57,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:57,852 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:57,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:58,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 14:23:58,055 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-28 14:23:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:58,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [22458980] [2022-04-28 14:23:58,151 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:58,151 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-28 14:23:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:58,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7959643] [2022-04-28 14:23:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:58,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:58,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:58,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632056906] [2022-04-28 14:23:58,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:23:58,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:58,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:58,168 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:58,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 14:23:58,210 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:23:58,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:58,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:23:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:58,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:58,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {7199#true} call ULTIMATE.init(); {7199#true} is VALID [2022-04-28 14:23:58,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {7199#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {7207#(<= ~counter~0 0)} assume true; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7207#(<= ~counter~0 0)} {7199#true} #61#return; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {7207#(<= ~counter~0 0)} call #t~ret6 := main(); {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {7207#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {7207#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {7207#(<= ~counter~0 0)} ~cond := #in~cond; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {7207#(<= ~counter~0 0)} assume !(0 == ~cond); {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {7207#(<= ~counter~0 0)} assume true; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7207#(<= ~counter~0 0)} {7207#(<= ~counter~0 0)} #53#return; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {7207#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:58,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {7207#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:58,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {7241#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:58,535 INFO L272 TraceCheckUtils]: 14: Hoare triple {7241#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7241#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:58,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {7241#(<= ~counter~0 1)} ~cond := #in~cond; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:58,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {7241#(<= ~counter~0 1)} assume !(0 == ~cond); {7241#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:58,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {7241#(<= ~counter~0 1)} assume true; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:58,536 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7241#(<= ~counter~0 1)} {7241#(<= ~counter~0 1)} #55#return; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:58,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {7241#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:58,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {7241#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:58,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {7266#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:58,538 INFO L272 TraceCheckUtils]: 22: Hoare triple {7266#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7266#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:58,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {7266#(<= ~counter~0 2)} ~cond := #in~cond; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:58,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {7266#(<= ~counter~0 2)} assume !(0 == ~cond); {7266#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:58,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {7266#(<= ~counter~0 2)} assume true; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:58,539 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7266#(<= ~counter~0 2)} {7266#(<= ~counter~0 2)} #55#return; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:58,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {7266#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 14:23:58,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {7266#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:58,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {7291#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:58,540 INFO L272 TraceCheckUtils]: 30: Hoare triple {7291#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7291#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:58,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {7291#(<= ~counter~0 3)} ~cond := #in~cond; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:58,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {7291#(<= ~counter~0 3)} assume !(0 == ~cond); {7291#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:58,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {7291#(<= ~counter~0 3)} assume true; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:58,541 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7291#(<= ~counter~0 3)} {7291#(<= ~counter~0 3)} #55#return; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:58,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {7291#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 14:23:58,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {7291#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:58,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {7316#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:58,543 INFO L272 TraceCheckUtils]: 38: Hoare triple {7316#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7316#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:58,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {7316#(<= ~counter~0 4)} ~cond := #in~cond; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:58,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {7316#(<= ~counter~0 4)} assume !(0 == ~cond); {7316#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:58,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {7316#(<= ~counter~0 4)} assume true; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:58,544 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7316#(<= ~counter~0 4)} {7316#(<= ~counter~0 4)} #55#return; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:58,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {7316#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 14:23:58,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {7316#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:58,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {7341#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:58,546 INFO L272 TraceCheckUtils]: 46: Hoare triple {7341#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7341#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:58,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {7341#(<= ~counter~0 5)} ~cond := #in~cond; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:58,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {7341#(<= ~counter~0 5)} assume !(0 == ~cond); {7341#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:58,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {7341#(<= ~counter~0 5)} assume true; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:58,547 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7341#(<= ~counter~0 5)} {7341#(<= ~counter~0 5)} #55#return; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:58,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {7341#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 14:23:58,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {7341#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 14:23:58,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {7366#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 14:23:58,548 INFO L272 TraceCheckUtils]: 54: Hoare triple {7366#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7366#(<= ~counter~0 6)} is VALID [2022-04-28 14:23:58,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {7366#(<= ~counter~0 6)} ~cond := #in~cond; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 14:23:58,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {7366#(<= ~counter~0 6)} assume !(0 == ~cond); {7366#(<= ~counter~0 6)} is VALID [2022-04-28 14:23:58,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {7366#(<= ~counter~0 6)} assume true; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 14:23:58,550 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7366#(<= ~counter~0 6)} {7366#(<= ~counter~0 6)} #55#return; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 14:23:58,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {7366#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 14:23:58,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {7366#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7391#(<= |main_#t~post5| 6)} is VALID [2022-04-28 14:23:58,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {7391#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L272 TraceCheckUtils]: 62: Hoare triple {7200#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {7200#false} assume !(0 == ~cond); {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {7200#false} assume true; {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7200#false} {7200#false} #57#return; {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L272 TraceCheckUtils]: 67: Hoare triple {7200#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {7200#false} assume 0 == ~cond; {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L290 TraceCheckUtils]: 70: Hoare triple {7200#false} assume !false; {7200#false} is VALID [2022-04-28 14:23:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:23:58,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:58,898 INFO L290 TraceCheckUtils]: 70: Hoare triple {7200#false} assume !false; {7200#false} is VALID [2022-04-28 14:23:58,899 INFO L290 TraceCheckUtils]: 69: Hoare triple {7200#false} assume 0 == ~cond; {7200#false} is VALID [2022-04-28 14:23:58,899 INFO L290 TraceCheckUtils]: 68: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-28 14:23:58,899 INFO L272 TraceCheckUtils]: 67: Hoare triple {7200#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-28 14:23:58,899 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7199#true} {7200#false} #57#return; {7200#false} is VALID [2022-04-28 14:23:58,899 INFO L290 TraceCheckUtils]: 65: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 14:23:58,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 14:23:58,899 INFO L290 TraceCheckUtils]: 63: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 14:23:58,899 INFO L272 TraceCheckUtils]: 62: Hoare triple {7200#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 14:23:58,899 INFO L290 TraceCheckUtils]: 61: Hoare triple {7449#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7200#false} is VALID [2022-04-28 14:23:58,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {7453#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7449#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:23:58,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {7453#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7453#(< ~counter~0 20)} is VALID [2022-04-28 14:23:58,901 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7199#true} {7453#(< ~counter~0 20)} #55#return; {7453#(< ~counter~0 20)} is VALID [2022-04-28 14:23:58,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 14:23:58,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 14:23:58,901 INFO L290 TraceCheckUtils]: 55: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 14:23:58,901 INFO L272 TraceCheckUtils]: 54: Hoare triple {7453#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 14:23:58,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {7453#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {7453#(< ~counter~0 20)} is VALID [2022-04-28 14:23:58,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {7478#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7453#(< ~counter~0 20)} is VALID [2022-04-28 14:23:58,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {7478#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7478#(< ~counter~0 19)} is VALID [2022-04-28 14:23:58,902 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7199#true} {7478#(< ~counter~0 19)} #55#return; {7478#(< ~counter~0 19)} is VALID [2022-04-28 14:23:58,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 14:23:58,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 14:23:58,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 14:23:58,903 INFO L272 TraceCheckUtils]: 46: Hoare triple {7478#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 14:23:58,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {7478#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {7478#(< ~counter~0 19)} is VALID [2022-04-28 14:23:58,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {7503#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7478#(< ~counter~0 19)} is VALID [2022-04-28 14:23:58,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {7503#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7503#(< ~counter~0 18)} is VALID [2022-04-28 14:23:58,904 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7199#true} {7503#(< ~counter~0 18)} #55#return; {7503#(< ~counter~0 18)} is VALID [2022-04-28 14:23:58,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 14:23:58,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 14:23:58,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 14:23:58,904 INFO L272 TraceCheckUtils]: 38: Hoare triple {7503#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 14:23:58,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {7503#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {7503#(< ~counter~0 18)} is VALID [2022-04-28 14:23:58,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {7528#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7503#(< ~counter~0 18)} is VALID [2022-04-28 14:23:58,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {7528#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7528#(< ~counter~0 17)} is VALID [2022-04-28 14:23:58,906 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7199#true} {7528#(< ~counter~0 17)} #55#return; {7528#(< ~counter~0 17)} is VALID [2022-04-28 14:23:58,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 14:23:58,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 14:23:58,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 14:23:58,906 INFO L272 TraceCheckUtils]: 30: Hoare triple {7528#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 14:23:58,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {7528#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {7528#(< ~counter~0 17)} is VALID [2022-04-28 14:23:58,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {7553#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7528#(< ~counter~0 17)} is VALID [2022-04-28 14:23:58,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {7553#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7553#(< ~counter~0 16)} is VALID [2022-04-28 14:23:58,908 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7199#true} {7553#(< ~counter~0 16)} #55#return; {7553#(< ~counter~0 16)} is VALID [2022-04-28 14:23:58,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 14:23:58,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 14:23:58,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 14:23:58,908 INFO L272 TraceCheckUtils]: 22: Hoare triple {7553#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 14:23:58,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {7553#(< ~counter~0 16)} is VALID [2022-04-28 14:23:58,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7553#(< ~counter~0 16)} is VALID [2022-04-28 14:23:58,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {7578#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7578#(< ~counter~0 15)} is VALID [2022-04-28 14:23:58,913 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7199#true} {7578#(< ~counter~0 15)} #55#return; {7578#(< ~counter~0 15)} is VALID [2022-04-28 14:23:58,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 14:23:58,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 14:23:58,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 14:23:58,913 INFO L272 TraceCheckUtils]: 14: Hoare triple {7578#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 14:23:58,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {7578#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {7578#(< ~counter~0 15)} is VALID [2022-04-28 14:23:58,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {7603#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7578#(< ~counter~0 15)} is VALID [2022-04-28 14:23:58,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {7603#(< ~counter~0 14)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7603#(< ~counter~0 14)} is VALID [2022-04-28 14:23:58,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7199#true} {7603#(< ~counter~0 14)} #53#return; {7603#(< ~counter~0 14)} is VALID [2022-04-28 14:23:58,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 14:23:58,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 14:23:58,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 14:23:58,915 INFO L272 TraceCheckUtils]: 6: Hoare triple {7603#(< ~counter~0 14)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7199#true} is VALID [2022-04-28 14:23:58,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {7603#(< ~counter~0 14)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7603#(< ~counter~0 14)} is VALID [2022-04-28 14:23:58,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {7603#(< ~counter~0 14)} call #t~ret6 := main(); {7603#(< ~counter~0 14)} is VALID [2022-04-28 14:23:58,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7603#(< ~counter~0 14)} {7199#true} #61#return; {7603#(< ~counter~0 14)} is VALID [2022-04-28 14:23:58,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {7603#(< ~counter~0 14)} assume true; {7603#(< ~counter~0 14)} is VALID [2022-04-28 14:23:58,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {7199#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7603#(< ~counter~0 14)} is VALID [2022-04-28 14:23:58,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {7199#true} call ULTIMATE.init(); {7199#true} is VALID [2022-04-28 14:23:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:23:58,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:58,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7959643] [2022-04-28 14:23:58,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:58,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632056906] [2022-04-28 14:23:58,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632056906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:23:58,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:23:58,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 14:23:58,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:58,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [22458980] [2022-04-28 14:23:58,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [22458980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:58,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:58,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:23:58,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170458965] [2022-04-28 14:23:58,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:58,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-28 14:23:58,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:58,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:58,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:58,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:23:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:23:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:23:58,963 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:59,215 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-28 14:23:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:23:59,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-28 14:23:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 14:23:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 14:23:59,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-28 14:23:59,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:59,274 INFO L225 Difference]: With dead ends: 86 [2022-04-28 14:23:59,274 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:23:59,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:23:59,275 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:59,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:23:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:23:59,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:59,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:23:59,354 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:23:59,354 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:23:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:59,355 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 14:23:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:23:59,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:59,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:59,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-28 14:23:59,356 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-28 14:23:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:59,357 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 14:23:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:23:59,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:59,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:59,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:59,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:23:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-28 14:23:59,358 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-28 14:23:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:59,358 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-28 14:23:59,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:23:59,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-28 14:23:59,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:23:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 14:23:59,654 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:59,654 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:59,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:59,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:59,863 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:59,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-28 14:23:59,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:59,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543663830] [2022-04-28 14:23:59,942 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:59,942 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-28 14:23:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:59,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648740283] [2022-04-28 14:23:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:59,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:59,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040534635] [2022-04-28 14:23:59,952 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:23:59,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:59,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:59,953 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:59,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 14:24:15,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:24:15,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:24:15,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 14:24:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:24:15,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:24:16,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {8130#true} call ULTIMATE.init(); {8130#true} is VALID [2022-04-28 14:24:16,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {8130#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8130#true} is VALID [2022-04-28 14:24:16,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8130#true} {8130#true} #61#return; {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {8130#true} call #t~ret6 := main(); {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {8130#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {8130#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8130#true} {8130#true} #53#return; {8130#true} is VALID [2022-04-28 14:24:16,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {8130#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:16,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:16,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:16,039 INFO L272 TraceCheckUtils]: 14: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,040 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8130#true} {8168#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:16,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:24:16,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:24:16,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:24:16,041 INFO L272 TraceCheckUtils]: 22: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,041 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8130#true} {8193#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:24:16,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:24:16,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:24:16,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:24:16,043 INFO L272 TraceCheckUtils]: 30: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,043 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8130#true} {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:24:16,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:24:16,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:24:16,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:24:16,044 INFO L272 TraceCheckUtils]: 38: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,045 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8130#true} {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #55#return; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:24:16,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:24:16,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:24:16,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:24:16,046 INFO L272 TraceCheckUtils]: 46: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,046 INFO L290 TraceCheckUtils]: 47: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,047 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8130#true} {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #55#return; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:24:16,047 INFO L290 TraceCheckUtils]: 51: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:24:16,047 INFO L290 TraceCheckUtils]: 52: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:24:16,048 INFO L290 TraceCheckUtils]: 53: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:24:16,048 INFO L272 TraceCheckUtils]: 54: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,048 INFO L290 TraceCheckUtils]: 55: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,048 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8130#true} {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} #55#return; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:24:16,049 INFO L290 TraceCheckUtils]: 59: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:24:16,049 INFO L290 TraceCheckUtils]: 60: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:24:16,050 INFO L290 TraceCheckUtils]: 61: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:24:16,050 INFO L272 TraceCheckUtils]: 62: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,050 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8130#true} {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:24:16,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 14:24:16,051 INFO L272 TraceCheckUtils]: 68: Hoare triple {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 14:24:16,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 14:24:16,051 INFO L290 TraceCheckUtils]: 70: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 14:24:16,051 INFO L290 TraceCheckUtils]: 71: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 14:24:16,052 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8130#true} {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 14:24:16,052 INFO L272 TraceCheckUtils]: 73: Hoare triple {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:24:16,052 INFO L290 TraceCheckUtils]: 74: Hoare triple {8362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:24:16,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {8366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8131#false} is VALID [2022-04-28 14:24:16,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {8131#false} assume !false; {8131#false} is VALID [2022-04-28 14:24:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 14:24:16,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:24:16,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:24:16,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648740283] [2022-04-28 14:24:16,341 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:24:16,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040534635] [2022-04-28 14:24:16,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040534635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:24:16,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:24:16,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 14:24:16,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:24:16,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543663830] [2022-04-28 14:24:16,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543663830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:24:16,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:24:16,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:24:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204297868] [2022-04-28 14:24:16,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:24:16,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-28 14:24:16,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:24:16,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:24:16,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:16,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:24:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:24:16,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:24:16,384 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:24:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:17,082 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 14:24:17,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:24:17,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-28 14:24:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:24:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:24:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 14:24:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:24:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 14:24:17,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-28 14:24:17,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:17,136 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:24:17,136 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 14:24:17,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:24:17,137 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:24:17,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 371 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:24:17,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 14:24:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 14:24:17,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:24:17,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:17,218 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:17,218 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:17,219 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 14:24:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:24:17,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:17,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:17,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-28 14:24:17,219 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-28 14:24:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:17,220 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 14:24:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:24:17,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:17,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:17,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:24:17,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:24:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 14:24:17,222 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-28 14:24:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:24:17,222 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 14:24:17,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:24:17,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 14:24:17,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:24:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 14:24:17,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:24:17,644 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:24:17,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 14:24:17,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 14:24:17,847 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:24:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:24:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-28 14:24:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:17,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93996517] [2022-04-28 14:24:17,940 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:24:17,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:24:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-28 14:24:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:24:17,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555369185] [2022-04-28 14:24:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:24:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:24:17,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:24:17,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560005710] [2022-04-28 14:24:17,950 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:24:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:24:17,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:24:17,951 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:24:17,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 14:24:35,006 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 14:24:35,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:24:35,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 14:24:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:24:35,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:24:35,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {8916#true} call ULTIMATE.init(); {8916#true} is VALID [2022-04-28 14:24:35,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {8916#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {8924#(<= ~counter~0 0)} assume true; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8924#(<= ~counter~0 0)} {8916#true} #61#return; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {8924#(<= ~counter~0 0)} call #t~ret6 := main(); {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {8924#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {8924#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {8924#(<= ~counter~0 0)} ~cond := #in~cond; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {8924#(<= ~counter~0 0)} assume !(0 == ~cond); {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {8924#(<= ~counter~0 0)} assume true; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8924#(<= ~counter~0 0)} {8924#(<= ~counter~0 0)} #53#return; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {8924#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:35,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {8924#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:35,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {8958#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:35,382 INFO L272 TraceCheckUtils]: 14: Hoare triple {8958#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8958#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:35,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {8958#(<= ~counter~0 1)} ~cond := #in~cond; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:35,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {8958#(<= ~counter~0 1)} assume !(0 == ~cond); {8958#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:35,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {8958#(<= ~counter~0 1)} assume true; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:35,383 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8958#(<= ~counter~0 1)} {8958#(<= ~counter~0 1)} #55#return; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:35,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {8958#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:35,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {8958#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:35,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {8983#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:35,385 INFO L272 TraceCheckUtils]: 22: Hoare triple {8983#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8983#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:35,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {8983#(<= ~counter~0 2)} ~cond := #in~cond; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:35,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {8983#(<= ~counter~0 2)} assume !(0 == ~cond); {8983#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:35,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {8983#(<= ~counter~0 2)} assume true; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:35,386 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8983#(<= ~counter~0 2)} {8983#(<= ~counter~0 2)} #55#return; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:35,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {8983#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:35,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {8983#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:35,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {9008#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:35,387 INFO L272 TraceCheckUtils]: 30: Hoare triple {9008#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9008#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:35,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {9008#(<= ~counter~0 3)} ~cond := #in~cond; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:35,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {9008#(<= ~counter~0 3)} assume !(0 == ~cond); {9008#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:35,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {9008#(<= ~counter~0 3)} assume true; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:35,388 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9008#(<= ~counter~0 3)} {9008#(<= ~counter~0 3)} #55#return; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:35,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {9008#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:35,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {9008#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:35,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {9033#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:35,390 INFO L272 TraceCheckUtils]: 38: Hoare triple {9033#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9033#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:35,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {9033#(<= ~counter~0 4)} ~cond := #in~cond; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:35,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {9033#(<= ~counter~0 4)} assume !(0 == ~cond); {9033#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:35,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {9033#(<= ~counter~0 4)} assume true; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:35,391 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9033#(<= ~counter~0 4)} {9033#(<= ~counter~0 4)} #55#return; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:35,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {9033#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:35,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {9033#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:35,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {9058#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:35,392 INFO L272 TraceCheckUtils]: 46: Hoare triple {9058#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9058#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:35,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {9058#(<= ~counter~0 5)} ~cond := #in~cond; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:35,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {9058#(<= ~counter~0 5)} assume !(0 == ~cond); {9058#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:35,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {9058#(<= ~counter~0 5)} assume true; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:35,393 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9058#(<= ~counter~0 5)} {9058#(<= ~counter~0 5)} #55#return; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:35,394 INFO L290 TraceCheckUtils]: 51: Hoare triple {9058#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:35,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {9058#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:35,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {9083#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:35,395 INFO L272 TraceCheckUtils]: 54: Hoare triple {9083#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9083#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:35,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {9083#(<= ~counter~0 6)} ~cond := #in~cond; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:35,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {9083#(<= ~counter~0 6)} assume !(0 == ~cond); {9083#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:35,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {9083#(<= ~counter~0 6)} assume true; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:35,396 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9083#(<= ~counter~0 6)} {9083#(<= ~counter~0 6)} #55#return; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:35,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {9083#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:35,397 INFO L290 TraceCheckUtils]: 60: Hoare triple {9083#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:35,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {9108#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:35,397 INFO L272 TraceCheckUtils]: 62: Hoare triple {9108#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9108#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:35,398 INFO L290 TraceCheckUtils]: 63: Hoare triple {9108#(<= ~counter~0 7)} ~cond := #in~cond; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:35,398 INFO L290 TraceCheckUtils]: 64: Hoare triple {9108#(<= ~counter~0 7)} assume !(0 == ~cond); {9108#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:35,398 INFO L290 TraceCheckUtils]: 65: Hoare triple {9108#(<= ~counter~0 7)} assume true; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:35,399 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9108#(<= ~counter~0 7)} {9108#(<= ~counter~0 7)} #55#return; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:35,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {9108#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:35,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {9108#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9133#(<= |main_#t~post5| 7)} is VALID [2022-04-28 14:24:35,399 INFO L290 TraceCheckUtils]: 69: Hoare triple {9133#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L272 TraceCheckUtils]: 70: Hoare triple {8917#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {8917#false} assume !(0 == ~cond); {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {8917#false} assume true; {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8917#false} {8917#false} #57#return; {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L272 TraceCheckUtils]: 75: Hoare triple {8917#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L290 TraceCheckUtils]: 76: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L290 TraceCheckUtils]: 77: Hoare triple {8917#false} assume 0 == ~cond; {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L290 TraceCheckUtils]: 78: Hoare triple {8917#false} assume !false; {8917#false} is VALID [2022-04-28 14:24:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:24:35,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:24:35,786 INFO L290 TraceCheckUtils]: 78: Hoare triple {8917#false} assume !false; {8917#false} is VALID [2022-04-28 14:24:35,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {8917#false} assume 0 == ~cond; {8917#false} is VALID [2022-04-28 14:24:35,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-28 14:24:35,786 INFO L272 TraceCheckUtils]: 75: Hoare triple {8917#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-28 14:24:35,786 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8916#true} {8917#false} #57#return; {8917#false} is VALID [2022-04-28 14:24:35,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,786 INFO L272 TraceCheckUtils]: 70: Hoare triple {8917#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,787 INFO L290 TraceCheckUtils]: 69: Hoare triple {9191#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {8917#false} is VALID [2022-04-28 14:24:35,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {9195#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9191#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:24:35,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {9195#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9195#(< ~counter~0 20)} is VALID [2022-04-28 14:24:35,788 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8916#true} {9195#(< ~counter~0 20)} #55#return; {9195#(< ~counter~0 20)} is VALID [2022-04-28 14:24:35,788 INFO L290 TraceCheckUtils]: 65: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,788 INFO L290 TraceCheckUtils]: 64: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,788 INFO L272 TraceCheckUtils]: 62: Hoare triple {9195#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {9195#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9195#(< ~counter~0 20)} is VALID [2022-04-28 14:24:35,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {9220#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9195#(< ~counter~0 20)} is VALID [2022-04-28 14:24:35,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {9220#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9220#(< ~counter~0 19)} is VALID [2022-04-28 14:24:35,790 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8916#true} {9220#(< ~counter~0 19)} #55#return; {9220#(< ~counter~0 19)} is VALID [2022-04-28 14:24:35,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,790 INFO L272 TraceCheckUtils]: 54: Hoare triple {9220#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {9220#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9220#(< ~counter~0 19)} is VALID [2022-04-28 14:24:35,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {9245#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9220#(< ~counter~0 19)} is VALID [2022-04-28 14:24:35,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {9245#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9245#(< ~counter~0 18)} is VALID [2022-04-28 14:24:35,801 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8916#true} {9245#(< ~counter~0 18)} #55#return; {9245#(< ~counter~0 18)} is VALID [2022-04-28 14:24:35,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,801 INFO L272 TraceCheckUtils]: 46: Hoare triple {9245#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {9245#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9245#(< ~counter~0 18)} is VALID [2022-04-28 14:24:35,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {9270#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9245#(< ~counter~0 18)} is VALID [2022-04-28 14:24:35,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {9270#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9270#(< ~counter~0 17)} is VALID [2022-04-28 14:24:35,802 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8916#true} {9270#(< ~counter~0 17)} #55#return; {9270#(< ~counter~0 17)} is VALID [2022-04-28 14:24:35,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,803 INFO L272 TraceCheckUtils]: 38: Hoare triple {9270#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {9270#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9270#(< ~counter~0 17)} is VALID [2022-04-28 14:24:35,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {9295#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9270#(< ~counter~0 17)} is VALID [2022-04-28 14:24:35,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {9295#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9295#(< ~counter~0 16)} is VALID [2022-04-28 14:24:35,804 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8916#true} {9295#(< ~counter~0 16)} #55#return; {9295#(< ~counter~0 16)} is VALID [2022-04-28 14:24:35,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,804 INFO L272 TraceCheckUtils]: 30: Hoare triple {9295#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {9295#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9295#(< ~counter~0 16)} is VALID [2022-04-28 14:24:35,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9295#(< ~counter~0 16)} is VALID [2022-04-28 14:24:35,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {9320#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9320#(< ~counter~0 15)} is VALID [2022-04-28 14:24:35,806 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8916#true} {9320#(< ~counter~0 15)} #55#return; {9320#(< ~counter~0 15)} is VALID [2022-04-28 14:24:35,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,806 INFO L272 TraceCheckUtils]: 22: Hoare triple {9320#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {9320#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9320#(< ~counter~0 15)} is VALID [2022-04-28 14:24:35,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {9345#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9320#(< ~counter~0 15)} is VALID [2022-04-28 14:24:35,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {9345#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9345#(< ~counter~0 14)} is VALID [2022-04-28 14:24:35,808 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8916#true} {9345#(< ~counter~0 14)} #55#return; {9345#(< ~counter~0 14)} is VALID [2022-04-28 14:24:35,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,808 INFO L272 TraceCheckUtils]: 14: Hoare triple {9345#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {9345#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9345#(< ~counter~0 14)} is VALID [2022-04-28 14:24:35,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {9370#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9345#(< ~counter~0 14)} is VALID [2022-04-28 14:24:35,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {9370#(< ~counter~0 13)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9370#(< ~counter~0 13)} is VALID [2022-04-28 14:24:35,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8916#true} {9370#(< ~counter~0 13)} #53#return; {9370#(< ~counter~0 13)} is VALID [2022-04-28 14:24:35,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 14:24:35,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 14:24:35,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 14:24:35,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {9370#(< ~counter~0 13)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8916#true} is VALID [2022-04-28 14:24:35,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {9370#(< ~counter~0 13)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9370#(< ~counter~0 13)} is VALID [2022-04-28 14:24:35,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {9370#(< ~counter~0 13)} call #t~ret6 := main(); {9370#(< ~counter~0 13)} is VALID [2022-04-28 14:24:35,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9370#(< ~counter~0 13)} {8916#true} #61#return; {9370#(< ~counter~0 13)} is VALID [2022-04-28 14:24:35,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {9370#(< ~counter~0 13)} assume true; {9370#(< ~counter~0 13)} is VALID [2022-04-28 14:24:35,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {8916#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9370#(< ~counter~0 13)} is VALID [2022-04-28 14:24:35,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {8916#true} call ULTIMATE.init(); {8916#true} is VALID [2022-04-28 14:24:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 14:24:35,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:24:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555369185] [2022-04-28 14:24:35,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:24:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560005710] [2022-04-28 14:24:35,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560005710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:24:35,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:24:35,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 14:24:35,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:24:35,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93996517] [2022-04-28 14:24:35,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93996517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:24:35,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:24:35,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:24:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465582620] [2022-04-28 14:24:35,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:24:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-28 14:24:35,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:24:35,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:24:35,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:35,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:24:35,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:35,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:24:35,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:24:35,865 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:24:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:36,192 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-28 14:24:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:24:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-28 14:24:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:24:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:24:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 14:24:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:24:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 14:24:36,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-28 14:24:36,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:36,276 INFO L225 Difference]: With dead ends: 94 [2022-04-28 14:24:36,276 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 14:24:36,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:24:36,277 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:24:36,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:24:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 14:24:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 14:24:36,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:24:36,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:36,358 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:36,358 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:36,359 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 14:24:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:24:36,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:36,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:36,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 14:24:36,359 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 14:24:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:36,360 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 14:24:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:24:36,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:36,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:36,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:24:36,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:24:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-28 14:24:36,362 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-28 14:24:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:24:36,362 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-28 14:24:36,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:24:36,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-28 14:24:36,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:24:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 14:24:36,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:24:36,865 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:24:36,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 14:24:37,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 14:24:37,074 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:24:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:24:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-28 14:24:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:37,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494830297] [2022-04-28 14:24:37,164 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:24:37,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:24:37,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-28 14:24:37,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:24:37,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025512179] [2022-04-28 14:24:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:24:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:24:37,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:24:37,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107577631] [2022-04-28 14:24:37,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:24:37,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:24:37,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:24:37,175 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:24:37,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 14:24:43,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:24:43,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:24:43,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 14:24:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:24:43,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:24:43,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {9947#true} call ULTIMATE.init(); {9947#true} is VALID [2022-04-28 14:24:43,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {9947#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9947#true} is VALID [2022-04-28 14:24:43,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9947#true} {9947#true} #61#return; {9947#true} is VALID [2022-04-28 14:24:43,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {9947#true} call #t~ret6 := main(); {9947#true} is VALID [2022-04-28 14:24:43,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {9947#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9947#true} is VALID [2022-04-28 14:24:43,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {9947#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9947#true} {9947#true} #53#return; {9947#true} is VALID [2022-04-28 14:24:43,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {9947#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:43,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:43,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:43,438 INFO L272 TraceCheckUtils]: 14: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,439 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9947#true} {9985#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:43,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:24:43,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:24:43,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:24:43,440 INFO L272 TraceCheckUtils]: 22: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,440 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9947#true} {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:24:43,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:24:43,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:24:43,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:24:43,442 INFO L272 TraceCheckUtils]: 30: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,442 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9947#true} {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:24:43,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:24:43,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:24:43,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:24:43,443 INFO L272 TraceCheckUtils]: 38: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,444 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9947#true} {10060#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:24:43,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:24:43,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:24:43,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:24:43,445 INFO L272 TraceCheckUtils]: 46: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,446 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9947#true} {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #55#return; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:24:43,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:24:43,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:24:43,447 INFO L290 TraceCheckUtils]: 53: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:24:43,447 INFO L272 TraceCheckUtils]: 54: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,448 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9947#true} {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:24:43,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:24:43,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:24:43,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:24:43,449 INFO L272 TraceCheckUtils]: 62: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,450 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9947#true} {10135#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:24:43,450 INFO L290 TraceCheckUtils]: 67: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:24:43,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:24:43,451 INFO L290 TraceCheckUtils]: 69: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:24:43,451 INFO L272 TraceCheckUtils]: 70: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,451 INFO L290 TraceCheckUtils]: 71: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,452 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9947#true} {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #55#return; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:24:43,452 INFO L290 TraceCheckUtils]: 75: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:24:43,452 INFO L272 TraceCheckUtils]: 76: Hoare triple {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 14:24:43,453 INFO L290 TraceCheckUtils]: 77: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 14:24:43,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 14:24:43,453 INFO L290 TraceCheckUtils]: 79: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 14:24:43,453 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9947#true} {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:24:43,454 INFO L272 TraceCheckUtils]: 81: Hoare triple {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:24:43,454 INFO L290 TraceCheckUtils]: 82: Hoare triple {10204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:24:43,454 INFO L290 TraceCheckUtils]: 83: Hoare triple {10208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9948#false} is VALID [2022-04-28 14:24:43,454 INFO L290 TraceCheckUtils]: 84: Hoare triple {9948#false} assume !false; {9948#false} is VALID [2022-04-28 14:24:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 14:24:43,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:24:43,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:24:43,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025512179] [2022-04-28 14:24:43,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:24:43,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107577631] [2022-04-28 14:24:43,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107577631] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:24:43,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:24:43,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 14:24:43,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:24:43,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494830297] [2022-04-28 14:24:43,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494830297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:24:43,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:24:43,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:24:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126348774] [2022-04-28 14:24:43,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:24:43,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-28 14:24:43,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:24:43,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:24:43,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:43,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:24:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:43,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:24:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:24:43,834 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:24:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:44,709 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 14:24:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 14:24:44,709 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-28 14:24:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:24:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:24:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 14:24:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:24:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 14:24:44,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-28 14:24:44,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:44,763 INFO L225 Difference]: With dead ends: 92 [2022-04-28 14:24:44,763 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 14:24:44,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:24:44,763 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:24:44,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 431 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:24:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 14:24:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 14:24:44,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:24:44,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:44,847 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:44,848 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:44,849 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 14:24:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:24:44,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:44,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:44,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-28 14:24:44,849 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-28 14:24:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:44,850 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 14:24:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:24:44,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:44,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:44,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:24:44,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:24:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-28 14:24:44,852 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-28 14:24:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:24:44,852 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-28 14:24:44,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:24:44,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-28 14:24:48,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:24:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 14:24:48,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:24:48,857 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:24:48,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 14:24:49,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 14:24:49,064 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:24:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:24:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-28 14:24:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:49,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275634677] [2022-04-28 14:24:49,140 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:24:49,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:24:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-28 14:24:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:24:49,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214004284] [2022-04-28 14:24:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:24:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:24:49,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:24:49,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882432321] [2022-04-28 14:24:49,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:24:49,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:24:49,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:24:49,151 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:24:49,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 14:24:49,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:24:49,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:24:49,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:24:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:24:49,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:24:49,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {10806#true} call ULTIMATE.init(); {10806#true} is VALID [2022-04-28 14:24:49,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {10806#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {10814#(<= ~counter~0 0)} assume true; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10814#(<= ~counter~0 0)} {10806#true} #61#return; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {10814#(<= ~counter~0 0)} call #t~ret6 := main(); {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {10814#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,605 INFO L272 TraceCheckUtils]: 6: Hoare triple {10814#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {10814#(<= ~counter~0 0)} ~cond := #in~cond; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {10814#(<= ~counter~0 0)} assume !(0 == ~cond); {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {10814#(<= ~counter~0 0)} assume true; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10814#(<= ~counter~0 0)} {10814#(<= ~counter~0 0)} #53#return; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {10814#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:49,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {10814#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:49,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {10848#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:49,608 INFO L272 TraceCheckUtils]: 14: Hoare triple {10848#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10848#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:49,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {10848#(<= ~counter~0 1)} ~cond := #in~cond; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:49,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {10848#(<= ~counter~0 1)} assume !(0 == ~cond); {10848#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:49,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {10848#(<= ~counter~0 1)} assume true; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:49,609 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10848#(<= ~counter~0 1)} {10848#(<= ~counter~0 1)} #55#return; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:49,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {10848#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:49,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {10848#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:49,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {10873#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:49,610 INFO L272 TraceCheckUtils]: 22: Hoare triple {10873#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10873#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:49,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {10873#(<= ~counter~0 2)} ~cond := #in~cond; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:49,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {10873#(<= ~counter~0 2)} assume !(0 == ~cond); {10873#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:49,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {10873#(<= ~counter~0 2)} assume true; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:49,612 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10873#(<= ~counter~0 2)} {10873#(<= ~counter~0 2)} #55#return; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:49,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {10873#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:49,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {10873#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:49,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {10898#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:49,613 INFO L272 TraceCheckUtils]: 30: Hoare triple {10898#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10898#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:49,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {10898#(<= ~counter~0 3)} ~cond := #in~cond; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:49,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {10898#(<= ~counter~0 3)} assume !(0 == ~cond); {10898#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:49,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {10898#(<= ~counter~0 3)} assume true; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:49,614 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10898#(<= ~counter~0 3)} {10898#(<= ~counter~0 3)} #55#return; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:49,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {10898#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:49,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {10898#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:49,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {10923#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:49,616 INFO L272 TraceCheckUtils]: 38: Hoare triple {10923#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10923#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:49,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {10923#(<= ~counter~0 4)} ~cond := #in~cond; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:49,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {10923#(<= ~counter~0 4)} assume !(0 == ~cond); {10923#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:49,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {10923#(<= ~counter~0 4)} assume true; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:49,617 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10923#(<= ~counter~0 4)} {10923#(<= ~counter~0 4)} #55#return; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:49,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {10923#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:49,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {10923#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:49,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {10948#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:49,618 INFO L272 TraceCheckUtils]: 46: Hoare triple {10948#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10948#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:49,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {10948#(<= ~counter~0 5)} ~cond := #in~cond; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:49,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {10948#(<= ~counter~0 5)} assume !(0 == ~cond); {10948#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:49,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {10948#(<= ~counter~0 5)} assume true; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:49,619 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10948#(<= ~counter~0 5)} {10948#(<= ~counter~0 5)} #55#return; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:49,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {10948#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:49,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {10948#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:49,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {10973#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:49,621 INFO L272 TraceCheckUtils]: 54: Hoare triple {10973#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10973#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:49,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {10973#(<= ~counter~0 6)} ~cond := #in~cond; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:49,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {10973#(<= ~counter~0 6)} assume !(0 == ~cond); {10973#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:49,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {10973#(<= ~counter~0 6)} assume true; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:49,631 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10973#(<= ~counter~0 6)} {10973#(<= ~counter~0 6)} #55#return; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:49,632 INFO L290 TraceCheckUtils]: 59: Hoare triple {10973#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:49,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {10973#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:49,633 INFO L290 TraceCheckUtils]: 61: Hoare triple {10998#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:49,633 INFO L272 TraceCheckUtils]: 62: Hoare triple {10998#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10998#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:49,633 INFO L290 TraceCheckUtils]: 63: Hoare triple {10998#(<= ~counter~0 7)} ~cond := #in~cond; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:49,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {10998#(<= ~counter~0 7)} assume !(0 == ~cond); {10998#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:49,634 INFO L290 TraceCheckUtils]: 65: Hoare triple {10998#(<= ~counter~0 7)} assume true; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:49,634 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10998#(<= ~counter~0 7)} {10998#(<= ~counter~0 7)} #55#return; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:49,634 INFO L290 TraceCheckUtils]: 67: Hoare triple {10998#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:49,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {10998#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:49,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {11023#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:49,636 INFO L272 TraceCheckUtils]: 70: Hoare triple {11023#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11023#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:49,636 INFO L290 TraceCheckUtils]: 71: Hoare triple {11023#(<= ~counter~0 8)} ~cond := #in~cond; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:49,636 INFO L290 TraceCheckUtils]: 72: Hoare triple {11023#(<= ~counter~0 8)} assume !(0 == ~cond); {11023#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:49,636 INFO L290 TraceCheckUtils]: 73: Hoare triple {11023#(<= ~counter~0 8)} assume true; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:49,637 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11023#(<= ~counter~0 8)} {11023#(<= ~counter~0 8)} #55#return; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:49,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {11023#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:49,637 INFO L290 TraceCheckUtils]: 76: Hoare triple {11023#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11048#(<= |main_#t~post5| 8)} is VALID [2022-04-28 14:24:49,638 INFO L290 TraceCheckUtils]: 77: Hoare triple {11048#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L272 TraceCheckUtils]: 78: Hoare triple {10807#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L290 TraceCheckUtils]: 80: Hoare triple {10807#false} assume !(0 == ~cond); {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L290 TraceCheckUtils]: 81: Hoare triple {10807#false} assume true; {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10807#false} {10807#false} #57#return; {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L272 TraceCheckUtils]: 83: Hoare triple {10807#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {10807#false} assume 0 == ~cond; {10807#false} is VALID [2022-04-28 14:24:49,638 INFO L290 TraceCheckUtils]: 86: Hoare triple {10807#false} assume !false; {10807#false} is VALID [2022-04-28 14:24:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:24:49,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:24:50,079 INFO L290 TraceCheckUtils]: 86: Hoare triple {10807#false} assume !false; {10807#false} is VALID [2022-04-28 14:24:50,079 INFO L290 TraceCheckUtils]: 85: Hoare triple {10807#false} assume 0 == ~cond; {10807#false} is VALID [2022-04-28 14:24:50,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-28 14:24:50,079 INFO L272 TraceCheckUtils]: 83: Hoare triple {10807#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-28 14:24:50,079 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10806#true} {10807#false} #57#return; {10807#false} is VALID [2022-04-28 14:24:50,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,079 INFO L272 TraceCheckUtils]: 78: Hoare triple {10807#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {11106#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10807#false} is VALID [2022-04-28 14:24:50,080 INFO L290 TraceCheckUtils]: 76: Hoare triple {11110#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11106#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:24:50,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {11110#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11110#(< ~counter~0 20)} is VALID [2022-04-28 14:24:50,081 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10806#true} {11110#(< ~counter~0 20)} #55#return; {11110#(< ~counter~0 20)} is VALID [2022-04-28 14:24:50,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,081 INFO L290 TraceCheckUtils]: 71: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,081 INFO L272 TraceCheckUtils]: 70: Hoare triple {11110#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,081 INFO L290 TraceCheckUtils]: 69: Hoare triple {11110#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11110#(< ~counter~0 20)} is VALID [2022-04-28 14:24:50,082 INFO L290 TraceCheckUtils]: 68: Hoare triple {11135#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11110#(< ~counter~0 20)} is VALID [2022-04-28 14:24:50,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {11135#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11135#(< ~counter~0 19)} is VALID [2022-04-28 14:24:50,082 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10806#true} {11135#(< ~counter~0 19)} #55#return; {11135#(< ~counter~0 19)} is VALID [2022-04-28 14:24:50,083 INFO L290 TraceCheckUtils]: 65: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,083 INFO L272 TraceCheckUtils]: 62: Hoare triple {11135#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {11135#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11135#(< ~counter~0 19)} is VALID [2022-04-28 14:24:50,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {11160#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11135#(< ~counter~0 19)} is VALID [2022-04-28 14:24:50,084 INFO L290 TraceCheckUtils]: 59: Hoare triple {11160#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11160#(< ~counter~0 18)} is VALID [2022-04-28 14:24:50,084 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10806#true} {11160#(< ~counter~0 18)} #55#return; {11160#(< ~counter~0 18)} is VALID [2022-04-28 14:24:50,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,084 INFO L290 TraceCheckUtils]: 55: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,084 INFO L272 TraceCheckUtils]: 54: Hoare triple {11160#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {11160#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11160#(< ~counter~0 18)} is VALID [2022-04-28 14:24:50,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {11185#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11160#(< ~counter~0 18)} is VALID [2022-04-28 14:24:50,085 INFO L290 TraceCheckUtils]: 51: Hoare triple {11185#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11185#(< ~counter~0 17)} is VALID [2022-04-28 14:24:50,086 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10806#true} {11185#(< ~counter~0 17)} #55#return; {11185#(< ~counter~0 17)} is VALID [2022-04-28 14:24:50,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,086 INFO L272 TraceCheckUtils]: 46: Hoare triple {11185#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {11185#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11185#(< ~counter~0 17)} is VALID [2022-04-28 14:24:50,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {11210#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11185#(< ~counter~0 17)} is VALID [2022-04-28 14:24:50,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {11210#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11210#(< ~counter~0 16)} is VALID [2022-04-28 14:24:50,088 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10806#true} {11210#(< ~counter~0 16)} #55#return; {11210#(< ~counter~0 16)} is VALID [2022-04-28 14:24:50,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,088 INFO L272 TraceCheckUtils]: 38: Hoare triple {11210#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {11210#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {11210#(< ~counter~0 16)} is VALID [2022-04-28 14:24:50,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {11235#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11210#(< ~counter~0 16)} is VALID [2022-04-28 14:24:50,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {11235#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11235#(< ~counter~0 15)} is VALID [2022-04-28 14:24:50,092 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10806#true} {11235#(< ~counter~0 15)} #55#return; {11235#(< ~counter~0 15)} is VALID [2022-04-28 14:24:50,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,093 INFO L272 TraceCheckUtils]: 30: Hoare triple {11235#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {11235#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {11235#(< ~counter~0 15)} is VALID [2022-04-28 14:24:50,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {11260#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11235#(< ~counter~0 15)} is VALID [2022-04-28 14:24:50,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {11260#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11260#(< ~counter~0 14)} is VALID [2022-04-28 14:24:50,094 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10806#true} {11260#(< ~counter~0 14)} #55#return; {11260#(< ~counter~0 14)} is VALID [2022-04-28 14:24:50,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,095 INFO L272 TraceCheckUtils]: 22: Hoare triple {11260#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {11260#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {11260#(< ~counter~0 14)} is VALID [2022-04-28 14:24:50,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {11285#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11260#(< ~counter~0 14)} is VALID [2022-04-28 14:24:50,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {11285#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11285#(< ~counter~0 13)} is VALID [2022-04-28 14:24:50,096 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10806#true} {11285#(< ~counter~0 13)} #55#return; {11285#(< ~counter~0 13)} is VALID [2022-04-28 14:24:50,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,097 INFO L272 TraceCheckUtils]: 14: Hoare triple {11285#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {11285#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {11285#(< ~counter~0 13)} is VALID [2022-04-28 14:24:50,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {11310#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11285#(< ~counter~0 13)} is VALID [2022-04-28 14:24:50,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {11310#(< ~counter~0 12)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11310#(< ~counter~0 12)} is VALID [2022-04-28 14:24:50,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10806#true} {11310#(< ~counter~0 12)} #53#return; {11310#(< ~counter~0 12)} is VALID [2022-04-28 14:24:50,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 14:24:50,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 14:24:50,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 14:24:50,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {11310#(< ~counter~0 12)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10806#true} is VALID [2022-04-28 14:24:50,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {11310#(< ~counter~0 12)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11310#(< ~counter~0 12)} is VALID [2022-04-28 14:24:50,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {11310#(< ~counter~0 12)} call #t~ret6 := main(); {11310#(< ~counter~0 12)} is VALID [2022-04-28 14:24:50,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11310#(< ~counter~0 12)} {10806#true} #61#return; {11310#(< ~counter~0 12)} is VALID [2022-04-28 14:24:50,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {11310#(< ~counter~0 12)} assume true; {11310#(< ~counter~0 12)} is VALID [2022-04-28 14:24:50,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {10806#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11310#(< ~counter~0 12)} is VALID [2022-04-28 14:24:50,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {10806#true} call ULTIMATE.init(); {10806#true} is VALID [2022-04-28 14:24:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 14:24:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:24:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214004284] [2022-04-28 14:24:50,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:24:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882432321] [2022-04-28 14:24:50,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882432321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:24:50,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:24:50,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 14:24:50,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:24:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275634677] [2022-04-28 14:24:50,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275634677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:24:50,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:24:50,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:24:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768116660] [2022-04-28 14:24:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:24:50,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-28 14:24:50,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:24:50,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:50,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:50,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:24:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:24:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 14:24:50,159 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:50,494 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-28 14:24:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 14:24:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-28 14:24:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:24:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 14:24:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 14:24:50,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-28 14:24:50,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:50,571 INFO L225 Difference]: With dead ends: 102 [2022-04-28 14:24:50,571 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 14:24:50,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-28 14:24:50,572 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:24:50,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:24:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 14:24:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 14:24:50,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:24:50,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:50,690 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:50,691 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:50,692 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 14:24:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:24:50,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:50,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:50,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-28 14:24:50,692 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-28 14:24:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:50,693 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 14:24:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:24:50,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:50,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:50,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:24:50,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:24:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-28 14:24:50,695 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-28 14:24:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:24:50,695 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-28 14:24:50,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:24:50,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-28 14:24:51,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:24:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 14:24:51,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:24:51,067 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:24:51,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 14:24:51,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:24:51,268 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:24:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:24:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-28 14:24:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:51,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953971171] [2022-04-28 14:24:51,354 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:24:51,354 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:24:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-28 14:24:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:24:51,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661490805] [2022-04-28 14:24:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:24:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:24:51,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:24:51,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424298001] [2022-04-28 14:24:51,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:24:51,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:24:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:24:51,368 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:24:51,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 14:24:51,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:24:51,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:24:51,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 14:24:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:24:51,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:24:51,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {11937#true} call ULTIMATE.init(); {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {11937#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11937#true} {11937#true} #61#return; {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {11937#true} call #t~ret6 := main(); {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {11937#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {11937#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11937#true} {11937#true} #53#return; {11937#true} is VALID [2022-04-28 14:24:51,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {11937#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:51,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:51,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:51,914 INFO L272 TraceCheckUtils]: 14: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,916 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11937#true} {11975#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:24:51,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:24:51,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:24:51,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:24:51,917 INFO L272 TraceCheckUtils]: 22: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,918 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11937#true} {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:24:51,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:24:51,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:24:51,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:24:51,919 INFO L272 TraceCheckUtils]: 30: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,919 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11937#true} {12025#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:24:51,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:24:51,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:24:51,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:24:51,921 INFO L272 TraceCheckUtils]: 38: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,921 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11937#true} {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #55#return; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:24:51,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:24:51,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:24:51,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:24:51,922 INFO L272 TraceCheckUtils]: 46: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,923 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11937#true} {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #55#return; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:24:51,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:24:51,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:24:51,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:24:51,924 INFO L272 TraceCheckUtils]: 54: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,927 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11937#true} {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #55#return; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:24:51,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-28 14:24:51,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-28 14:24:51,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-28 14:24:51,929 INFO L272 TraceCheckUtils]: 62: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,929 INFO L290 TraceCheckUtils]: 63: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,929 INFO L290 TraceCheckUtils]: 64: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,929 INFO L290 TraceCheckUtils]: 65: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,929 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11937#true} {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} #55#return; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-28 14:24:51,930 INFO L290 TraceCheckUtils]: 67: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:24:51,930 INFO L290 TraceCheckUtils]: 68: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:24:51,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:24:51,931 INFO L272 TraceCheckUtils]: 70: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,931 INFO L290 TraceCheckUtils]: 71: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,931 INFO L290 TraceCheckUtils]: 72: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,931 INFO L290 TraceCheckUtils]: 73: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,931 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11937#true} {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #55#return; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:24:51,932 INFO L290 TraceCheckUtils]: 75: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 14:24:51,932 INFO L290 TraceCheckUtils]: 76: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 14:24:51,933 INFO L290 TraceCheckUtils]: 77: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 14:24:51,933 INFO L272 TraceCheckUtils]: 78: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,933 INFO L290 TraceCheckUtils]: 79: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,933 INFO L290 TraceCheckUtils]: 80: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,933 INFO L290 TraceCheckUtils]: 81: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,933 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11937#true} {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #55#return; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 14:24:51,934 INFO L290 TraceCheckUtils]: 83: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-28 14:24:51,934 INFO L272 TraceCheckUtils]: 84: Hoare triple {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 14:24:51,934 INFO L290 TraceCheckUtils]: 85: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 14:24:51,935 INFO L290 TraceCheckUtils]: 86: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 14:24:51,935 INFO L290 TraceCheckUtils]: 87: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 14:24:51,935 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11937#true} {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} #57#return; {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-28 14:24:51,936 INFO L272 TraceCheckUtils]: 89: Hoare triple {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12219#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:24:51,936 INFO L290 TraceCheckUtils]: 90: Hoare triple {12219#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12223#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:24:51,936 INFO L290 TraceCheckUtils]: 91: Hoare triple {12223#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11938#false} is VALID [2022-04-28 14:24:51,937 INFO L290 TraceCheckUtils]: 92: Hoare triple {11938#false} assume !false; {11938#false} is VALID [2022-04-28 14:24:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:24:51,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:24:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:24:52,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661490805] [2022-04-28 14:24:52,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:24:52,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424298001] [2022-04-28 14:24:52,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424298001] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:24:52,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:24:52,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 14:24:52,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:24:52,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1953971171] [2022-04-28 14:24:52,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1953971171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:24:52,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:24:52,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:24:52,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435549514] [2022-04-28 14:24:52,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:24:52,191 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-28 14:24:52,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:24:52,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:24:52,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:52,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:24:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:52,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:24:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:24:52,243 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:24:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:53,296 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-28 14:24:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:24:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-28 14:24:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:24:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:24:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 14:24:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:24:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 14:24:53,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-28 14:24:53,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:53,357 INFO L225 Difference]: With dead ends: 100 [2022-04-28 14:24:53,357 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 14:24:53,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:24:53,358 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:24:53,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 493 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:24:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 14:24:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 14:24:53,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:24:53,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:24:53,467 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:24:53,467 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:24:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:53,469 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 14:24:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:24:53,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:53,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:53,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-28 14:24:53,470 INFO L87 Difference]: Start difference. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-28 14:24:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:53,471 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 14:24:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:24:53,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:53,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:53,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:24:53,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:24:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:24:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-28 14:24:53,473 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-28 14:24:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:24:53,473 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-28 14:24:53,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:24:53,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-28 14:24:53,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:24:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 14:24:53,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:24:53,818 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:24:53,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 14:24:54,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:24:54,035 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:24:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:24:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-28 14:24:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:54,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347253227] [2022-04-28 14:24:54,124 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:24:54,124 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:24:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-28 14:24:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:24:54,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195622653] [2022-04-28 14:24:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:24:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:24:54,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:24:54,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533658659] [2022-04-28 14:24:54,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:24:54,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:24:54,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:24:54,136 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:24:54,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 14:24:54,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:24:54,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:24:54,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 14:24:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:24:54,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:24:54,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {12869#true} call ULTIMATE.init(); {12869#true} is VALID [2022-04-28 14:24:54,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {12869#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {12877#(<= ~counter~0 0)} assume true; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12877#(<= ~counter~0 0)} {12869#true} #61#return; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {12877#(<= ~counter~0 0)} call #t~ret6 := main(); {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {12877#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {12877#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {12877#(<= ~counter~0 0)} ~cond := #in~cond; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {12877#(<= ~counter~0 0)} assume !(0 == ~cond); {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {12877#(<= ~counter~0 0)} assume true; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,620 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12877#(<= ~counter~0 0)} {12877#(<= ~counter~0 0)} #53#return; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {12877#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 14:24:54,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {12877#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:54,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {12911#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:54,621 INFO L272 TraceCheckUtils]: 14: Hoare triple {12911#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12911#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:54,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {12911#(<= ~counter~0 1)} ~cond := #in~cond; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:54,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {12911#(<= ~counter~0 1)} assume !(0 == ~cond); {12911#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:54,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {12911#(<= ~counter~0 1)} assume true; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:54,622 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12911#(<= ~counter~0 1)} {12911#(<= ~counter~0 1)} #55#return; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:54,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {12911#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 14:24:54,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {12911#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:54,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {12936#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:54,624 INFO L272 TraceCheckUtils]: 22: Hoare triple {12936#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12936#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:54,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {12936#(<= ~counter~0 2)} ~cond := #in~cond; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:54,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {12936#(<= ~counter~0 2)} assume !(0 == ~cond); {12936#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:54,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {12936#(<= ~counter~0 2)} assume true; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:54,625 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12936#(<= ~counter~0 2)} {12936#(<= ~counter~0 2)} #55#return; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:54,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {12936#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 14:24:54,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {12936#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:54,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {12961#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:54,626 INFO L272 TraceCheckUtils]: 30: Hoare triple {12961#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12961#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:54,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {12961#(<= ~counter~0 3)} ~cond := #in~cond; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:54,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {12961#(<= ~counter~0 3)} assume !(0 == ~cond); {12961#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:54,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {12961#(<= ~counter~0 3)} assume true; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:54,627 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12961#(<= ~counter~0 3)} {12961#(<= ~counter~0 3)} #55#return; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:54,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {12961#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 14:24:54,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {12961#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:54,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {12986#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:54,629 INFO L272 TraceCheckUtils]: 38: Hoare triple {12986#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12986#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:54,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {12986#(<= ~counter~0 4)} ~cond := #in~cond; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:54,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {12986#(<= ~counter~0 4)} assume !(0 == ~cond); {12986#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:54,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {12986#(<= ~counter~0 4)} assume true; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:54,630 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12986#(<= ~counter~0 4)} {12986#(<= ~counter~0 4)} #55#return; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:54,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {12986#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 14:24:54,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {12986#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:54,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {13011#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:54,631 INFO L272 TraceCheckUtils]: 46: Hoare triple {13011#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13011#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:54,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {13011#(<= ~counter~0 5)} ~cond := #in~cond; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:54,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {13011#(<= ~counter~0 5)} assume !(0 == ~cond); {13011#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:54,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {13011#(<= ~counter~0 5)} assume true; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:54,633 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13011#(<= ~counter~0 5)} {13011#(<= ~counter~0 5)} #55#return; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:54,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {13011#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 14:24:54,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {13011#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:54,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {13036#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:54,634 INFO L272 TraceCheckUtils]: 54: Hoare triple {13036#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13036#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:54,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {13036#(<= ~counter~0 6)} ~cond := #in~cond; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:54,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {13036#(<= ~counter~0 6)} assume !(0 == ~cond); {13036#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:54,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {13036#(<= ~counter~0 6)} assume true; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:54,635 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13036#(<= ~counter~0 6)} {13036#(<= ~counter~0 6)} #55#return; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:54,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {13036#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 14:24:54,636 INFO L290 TraceCheckUtils]: 60: Hoare triple {13036#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:54,636 INFO L290 TraceCheckUtils]: 61: Hoare triple {13061#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:54,637 INFO L272 TraceCheckUtils]: 62: Hoare triple {13061#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13061#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:54,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {13061#(<= ~counter~0 7)} ~cond := #in~cond; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:54,637 INFO L290 TraceCheckUtils]: 64: Hoare triple {13061#(<= ~counter~0 7)} assume !(0 == ~cond); {13061#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:54,637 INFO L290 TraceCheckUtils]: 65: Hoare triple {13061#(<= ~counter~0 7)} assume true; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:54,638 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13061#(<= ~counter~0 7)} {13061#(<= ~counter~0 7)} #55#return; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:54,638 INFO L290 TraceCheckUtils]: 67: Hoare triple {13061#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 14:24:54,638 INFO L290 TraceCheckUtils]: 68: Hoare triple {13061#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:54,639 INFO L290 TraceCheckUtils]: 69: Hoare triple {13086#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:54,639 INFO L272 TraceCheckUtils]: 70: Hoare triple {13086#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13086#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:54,639 INFO L290 TraceCheckUtils]: 71: Hoare triple {13086#(<= ~counter~0 8)} ~cond := #in~cond; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:54,640 INFO L290 TraceCheckUtils]: 72: Hoare triple {13086#(<= ~counter~0 8)} assume !(0 == ~cond); {13086#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:54,640 INFO L290 TraceCheckUtils]: 73: Hoare triple {13086#(<= ~counter~0 8)} assume true; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:54,640 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13086#(<= ~counter~0 8)} {13086#(<= ~counter~0 8)} #55#return; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:54,640 INFO L290 TraceCheckUtils]: 75: Hoare triple {13086#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 14:24:54,641 INFO L290 TraceCheckUtils]: 76: Hoare triple {13086#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 14:24:54,641 INFO L290 TraceCheckUtils]: 77: Hoare triple {13111#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 14:24:54,642 INFO L272 TraceCheckUtils]: 78: Hoare triple {13111#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13111#(<= ~counter~0 9)} is VALID [2022-04-28 14:24:54,642 INFO L290 TraceCheckUtils]: 79: Hoare triple {13111#(<= ~counter~0 9)} ~cond := #in~cond; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 14:24:54,642 INFO L290 TraceCheckUtils]: 80: Hoare triple {13111#(<= ~counter~0 9)} assume !(0 == ~cond); {13111#(<= ~counter~0 9)} is VALID [2022-04-28 14:24:54,642 INFO L290 TraceCheckUtils]: 81: Hoare triple {13111#(<= ~counter~0 9)} assume true; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 14:24:54,643 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13111#(<= ~counter~0 9)} {13111#(<= ~counter~0 9)} #55#return; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 14:24:54,643 INFO L290 TraceCheckUtils]: 83: Hoare triple {13111#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 14:24:54,643 INFO L290 TraceCheckUtils]: 84: Hoare triple {13111#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13136#(<= |main_#t~post5| 9)} is VALID [2022-04-28 14:24:54,644 INFO L290 TraceCheckUtils]: 85: Hoare triple {13136#(<= |main_#t~post5| 9)} assume !(#t~post5 < 20);havoc #t~post5; {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L272 TraceCheckUtils]: 86: Hoare triple {12870#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L290 TraceCheckUtils]: 87: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L290 TraceCheckUtils]: 88: Hoare triple {12870#false} assume !(0 == ~cond); {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L290 TraceCheckUtils]: 89: Hoare triple {12870#false} assume true; {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12870#false} {12870#false} #57#return; {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L272 TraceCheckUtils]: 91: Hoare triple {12870#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L290 TraceCheckUtils]: 92: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L290 TraceCheckUtils]: 93: Hoare triple {12870#false} assume 0 == ~cond; {12870#false} is VALID [2022-04-28 14:24:54,644 INFO L290 TraceCheckUtils]: 94: Hoare triple {12870#false} assume !false; {12870#false} is VALID [2022-04-28 14:24:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:24:54,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:24:55,132 INFO L290 TraceCheckUtils]: 94: Hoare triple {12870#false} assume !false; {12870#false} is VALID [2022-04-28 14:24:55,133 INFO L290 TraceCheckUtils]: 93: Hoare triple {12870#false} assume 0 == ~cond; {12870#false} is VALID [2022-04-28 14:24:55,133 INFO L290 TraceCheckUtils]: 92: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-28 14:24:55,133 INFO L272 TraceCheckUtils]: 91: Hoare triple {12870#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-28 14:24:55,133 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12869#true} {12870#false} #57#return; {12870#false} is VALID [2022-04-28 14:24:55,133 INFO L290 TraceCheckUtils]: 89: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,133 INFO L290 TraceCheckUtils]: 88: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,133 INFO L290 TraceCheckUtils]: 87: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,133 INFO L272 TraceCheckUtils]: 86: Hoare triple {12870#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,133 INFO L290 TraceCheckUtils]: 85: Hoare triple {13194#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {12870#false} is VALID [2022-04-28 14:24:55,134 INFO L290 TraceCheckUtils]: 84: Hoare triple {13198#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13194#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:24:55,134 INFO L290 TraceCheckUtils]: 83: Hoare triple {13198#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13198#(< ~counter~0 20)} is VALID [2022-04-28 14:24:55,134 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12869#true} {13198#(< ~counter~0 20)} #55#return; {13198#(< ~counter~0 20)} is VALID [2022-04-28 14:24:55,134 INFO L290 TraceCheckUtils]: 81: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,135 INFO L290 TraceCheckUtils]: 80: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,135 INFO L290 TraceCheckUtils]: 79: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,135 INFO L272 TraceCheckUtils]: 78: Hoare triple {13198#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,135 INFO L290 TraceCheckUtils]: 77: Hoare triple {13198#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {13198#(< ~counter~0 20)} is VALID [2022-04-28 14:24:55,136 INFO L290 TraceCheckUtils]: 76: Hoare triple {13223#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13198#(< ~counter~0 20)} is VALID [2022-04-28 14:24:55,136 INFO L290 TraceCheckUtils]: 75: Hoare triple {13223#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13223#(< ~counter~0 19)} is VALID [2022-04-28 14:24:55,136 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12869#true} {13223#(< ~counter~0 19)} #55#return; {13223#(< ~counter~0 19)} is VALID [2022-04-28 14:24:55,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,137 INFO L272 TraceCheckUtils]: 70: Hoare triple {13223#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,137 INFO L290 TraceCheckUtils]: 69: Hoare triple {13223#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {13223#(< ~counter~0 19)} is VALID [2022-04-28 14:24:55,137 INFO L290 TraceCheckUtils]: 68: Hoare triple {13248#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13223#(< ~counter~0 19)} is VALID [2022-04-28 14:24:55,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {13248#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13248#(< ~counter~0 18)} is VALID [2022-04-28 14:24:55,138 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12869#true} {13248#(< ~counter~0 18)} #55#return; {13248#(< ~counter~0 18)} is VALID [2022-04-28 14:24:55,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,138 INFO L272 TraceCheckUtils]: 62: Hoare triple {13248#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,145 INFO L290 TraceCheckUtils]: 61: Hoare triple {13248#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {13248#(< ~counter~0 18)} is VALID [2022-04-28 14:24:55,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {13273#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13248#(< ~counter~0 18)} is VALID [2022-04-28 14:24:55,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {13273#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13273#(< ~counter~0 17)} is VALID [2022-04-28 14:24:55,146 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12869#true} {13273#(< ~counter~0 17)} #55#return; {13273#(< ~counter~0 17)} is VALID [2022-04-28 14:24:55,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,146 INFO L272 TraceCheckUtils]: 54: Hoare triple {13273#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {13273#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {13273#(< ~counter~0 17)} is VALID [2022-04-28 14:24:55,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {13298#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13273#(< ~counter~0 17)} is VALID [2022-04-28 14:24:55,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {13298#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13298#(< ~counter~0 16)} is VALID [2022-04-28 14:24:55,148 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12869#true} {13298#(< ~counter~0 16)} #55#return; {13298#(< ~counter~0 16)} is VALID [2022-04-28 14:24:55,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,148 INFO L272 TraceCheckUtils]: 46: Hoare triple {13298#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {13298#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {13298#(< ~counter~0 16)} is VALID [2022-04-28 14:24:55,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {13323#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13298#(< ~counter~0 16)} is VALID [2022-04-28 14:24:55,149 INFO L290 TraceCheckUtils]: 43: Hoare triple {13323#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13323#(< ~counter~0 15)} is VALID [2022-04-28 14:24:55,149 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12869#true} {13323#(< ~counter~0 15)} #55#return; {13323#(< ~counter~0 15)} is VALID [2022-04-28 14:24:55,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,150 INFO L272 TraceCheckUtils]: 38: Hoare triple {13323#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {13323#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {13323#(< ~counter~0 15)} is VALID [2022-04-28 14:24:55,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {13348#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13323#(< ~counter~0 15)} is VALID [2022-04-28 14:24:55,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {13348#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13348#(< ~counter~0 14)} is VALID [2022-04-28 14:24:55,151 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12869#true} {13348#(< ~counter~0 14)} #55#return; {13348#(< ~counter~0 14)} is VALID [2022-04-28 14:24:55,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,151 INFO L272 TraceCheckUtils]: 30: Hoare triple {13348#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {13348#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {13348#(< ~counter~0 14)} is VALID [2022-04-28 14:24:55,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {13373#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13348#(< ~counter~0 14)} is VALID [2022-04-28 14:24:55,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {13373#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13373#(< ~counter~0 13)} is VALID [2022-04-28 14:24:55,153 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12869#true} {13373#(< ~counter~0 13)} #55#return; {13373#(< ~counter~0 13)} is VALID [2022-04-28 14:24:55,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,153 INFO L272 TraceCheckUtils]: 22: Hoare triple {13373#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {13373#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {13373#(< ~counter~0 13)} is VALID [2022-04-28 14:24:55,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {13398#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13373#(< ~counter~0 13)} is VALID [2022-04-28 14:24:55,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {13398#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13398#(< ~counter~0 12)} is VALID [2022-04-28 14:24:55,155 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12869#true} {13398#(< ~counter~0 12)} #55#return; {13398#(< ~counter~0 12)} is VALID [2022-04-28 14:24:55,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,155 INFO L272 TraceCheckUtils]: 14: Hoare triple {13398#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {13398#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {13398#(< ~counter~0 12)} is VALID [2022-04-28 14:24:55,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {13423#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13398#(< ~counter~0 12)} is VALID [2022-04-28 14:24:55,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {13423#(< ~counter~0 11)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13423#(< ~counter~0 11)} is VALID [2022-04-28 14:24:55,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12869#true} {13423#(< ~counter~0 11)} #53#return; {13423#(< ~counter~0 11)} is VALID [2022-04-28 14:24:55,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 14:24:55,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 14:24:55,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 14:24:55,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {13423#(< ~counter~0 11)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12869#true} is VALID [2022-04-28 14:24:55,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {13423#(< ~counter~0 11)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13423#(< ~counter~0 11)} is VALID [2022-04-28 14:24:55,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {13423#(< ~counter~0 11)} call #t~ret6 := main(); {13423#(< ~counter~0 11)} is VALID [2022-04-28 14:24:55,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13423#(< ~counter~0 11)} {12869#true} #61#return; {13423#(< ~counter~0 11)} is VALID [2022-04-28 14:24:55,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {13423#(< ~counter~0 11)} assume true; {13423#(< ~counter~0 11)} is VALID [2022-04-28 14:24:55,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {12869#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13423#(< ~counter~0 11)} is VALID [2022-04-28 14:24:55,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {12869#true} call ULTIMATE.init(); {12869#true} is VALID [2022-04-28 14:24:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 20 proven. 162 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:24:55,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:24:55,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195622653] [2022-04-28 14:24:55,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:24:55,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533658659] [2022-04-28 14:24:55,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533658659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:24:55,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:24:55,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 14:24:55,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:24:55,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347253227] [2022-04-28 14:24:55,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347253227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:24:55,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:24:55,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:24:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838973083] [2022-04-28 14:24:55,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:24:55,160 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-28 14:24:55,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:24:55,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:55,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:55,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:24:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:24:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:24:55,243 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:55,627 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-28 14:24:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 14:24:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-28 14:24:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:24:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 14:24:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 14:24:55,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-28 14:24:55,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:55,717 INFO L225 Difference]: With dead ends: 110 [2022-04-28 14:24:55,717 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 14:24:55,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 14:24:55,717 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:24:55,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:24:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 14:24:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 14:24:55,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:24:55,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:24:55,832 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:24:55,832 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:24:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:55,833 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 14:24:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:24:55,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:55,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:55,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-28 14:24:55,834 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-28 14:24:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:24:55,835 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 14:24:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:24:55,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:24:55,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:24:55,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:24:55,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:24:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:24:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-28 14:24:55,836 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-28 14:24:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:24:55,836 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-28 14:24:55,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:24:55,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-28 14:24:58,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 101 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:24:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:24:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 14:24:58,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:24:58,203 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:24:58,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 14:24:58,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 14:24:58,403 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:24:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:24:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-28 14:24:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:24:58,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662084897] [2022-04-28 14:24:58,480 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:24:58,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:24:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-28 14:24:58,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:24:58,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537242296] [2022-04-28 14:24:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:24:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:24:58,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:24:58,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19250240] [2022-04-28 14:24:58,491 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:24:58,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:24:58,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:24:58,495 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:24:58,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process