/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/ps4-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:21:18,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:21:18,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:21:18,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:21:18,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:21:18,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:21:18,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:21:18,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:21:18,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:21:18,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:21:18,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:21:18,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:21:18,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:21:18,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:21:18,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:21:18,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:21:18,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:21:18,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:21:18,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:21:18,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:21:18,697 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:21:18,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:21:18,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:21:18,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:21:18,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:21:18,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:21:18,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:21:18,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:21:18,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:21:18,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:21:18,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:21:18,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:21:18,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:21:18,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:21:18,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:21:18,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:21:18,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:21:18,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:21:18,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:21:18,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:21:18,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:21:18,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:21:18,716 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:21:18,724 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:21:18,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:21:18,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:21:18,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:21:18,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:21:18,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:21:18,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:21:18,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:21:18,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:21:18,726 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:21:18,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:21:18,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:21:18,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:21:18,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:21:18,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:21:18,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:21:18,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:21:18,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:21:18,727 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:21:18,727 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:21:18,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:21:18,728 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:21:18,728 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:21:18,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:21:18,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:21:18,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:21:18,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:21:18,927 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:21:18,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound10.c [2022-04-28 14:21:18,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f302e84d/1c22988c6dcd4b2dab087fa7c2e864b6/FLAG058baacf4 [2022-04-28 14:21:19,304 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:21:19,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound10.c [2022-04-28 14:21:19,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f302e84d/1c22988c6dcd4b2dab087fa7c2e864b6/FLAG058baacf4 [2022-04-28 14:21:19,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f302e84d/1c22988c6dcd4b2dab087fa7c2e864b6 [2022-04-28 14:21:19,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:21:19,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:21:19,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:21:19,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:21:19,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:21:19,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4b94e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19, skipping insertion in model container [2022-04-28 14:21:19,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:21:19,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:21:19,862 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/ps4-ll_valuebound10.c[458,471] [2022-04-28 14:21:19,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:21:19,877 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:21:19,884 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/ps4-ll_valuebound10.c[458,471] [2022-04-28 14:21:19,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:21:19,896 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:21:19,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19 WrapperNode [2022-04-28 14:21:19,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:21:19,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:21:19,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:21:19,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:21:19,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:21:19,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:21:19,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:21:19,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:21:19,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (1/1) ... [2022-04-28 14:21:19,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:21:19,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:19,958 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:21:19,976 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:21:19,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:21:19,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:21:19,985 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:21:19,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:21:19,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:21:19,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:21:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:21:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:21:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:21:20,032 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:21:20,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:21:20,129 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:21:20,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:21:20,133 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:21:20,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:21:20 BoogieIcfgContainer [2022-04-28 14:21:20,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:21:20,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:21:20,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:21:20,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:21:20,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:21:19" (1/3) ... [2022-04-28 14:21:20,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370b49d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:21:20, skipping insertion in model container [2022-04-28 14:21:20,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:21:19" (2/3) ... [2022-04-28 14:21:20,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370b49d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:21:20, skipping insertion in model container [2022-04-28 14:21:20,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:21:20" (3/3) ... [2022-04-28 14:21:20,139 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound10.c [2022-04-28 14:21:20,148 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:21:20,148 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:21:20,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:21:20,188 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@6eb65beb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e505e4e [2022-04-28 14:21:20,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:21:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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:21:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:21:20,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:20,198 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:21:20,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:20,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-28 14:21:20,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:20,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330405729] [2022-04-28 14:21:20,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:21:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-28 14:21:20,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:20,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818394572] [2022-04-28 14:21:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:20,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:21:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:20,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#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); {31#true} is VALID [2022-04-28 14:21:20,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 14:21:20,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 14:21:20,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:21:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:20,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 14:21:20,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 14:21:20,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 14:21:20,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 14:21:20,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:21:20,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#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); {31#true} is VALID [2022-04-28 14:21:20,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 14:21:20,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 14:21:20,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 14:21:20,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#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; {31#true} is VALID [2022-04-28 14:21:20,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {31#true} is VALID [2022-04-28 14:21:20,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 14:21:20,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 14:21:20,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 14:21:20,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 14:21:20,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-28 14:21:20,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-28 14:21:20,361 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-28 14:21:20,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 14:21:20,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 14:21:20,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 14:21:20,362 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:21:20,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:20,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818394572] [2022-04-28 14:21:20,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818394572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:20,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:20,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:21:20,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:20,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330405729] [2022-04-28 14:21:20,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330405729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:20,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:20,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:21:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735906293] [2022-04-28 14:21:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:20,372 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:21:20,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:20,375 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:21:20,406 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:21:20,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:21:20,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:21:20,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:21:20,427 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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:21:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:20,546 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 14:21:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:21:20,548 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:21:20,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:20,549 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:21:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 14:21:20,557 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:21:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 14:21:20,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-28 14:21:20,633 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:21:20,639 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:21:20,639 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 14:21:20,641 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:21:20,648 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:20,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:21:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 14:21:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 14:21:20,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:20,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:21:20,675 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:21:20,676 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:21:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:20,685 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 14:21:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:21:20,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:20,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:20,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 23 states. [2022-04-28 14:21:20,687 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 23 states. [2022-04-28 14:21:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:20,690 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 14:21:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:21:20,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:20,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:20,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:20,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:21:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 14:21:20,699 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-28 14:21:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:20,699 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 14:21:20,699 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:21:20,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 14:21:20,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:21:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:21:20,728 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:20,728 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:21:20,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:21:20,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-28 14:21:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:20,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [594218936] [2022-04-28 14:21:20,734 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:21:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-28 14:21:20,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200316404] [2022-04-28 14:21:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:20,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:20,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:20,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705940974] [2022-04-28 14:21:20,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:21:20,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:20,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:20,779 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:21:20,780 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:21:20,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:21:20,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:20,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:21:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:20,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:20,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-28 14:21:20,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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); {229#true} is VALID [2022-04-28 14:21:20,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 14:21:20,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-28 14:21:20,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-28 14:21:20,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#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; {229#true} is VALID [2022-04-28 14:21:20,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {229#true} is VALID [2022-04-28 14:21:20,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-28 14:21:20,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-28 14:21:20,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 14:21:20,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-28 14:21:20,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:20,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:20,955 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:20,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:20,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-28 14:21:20,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-28 14:21:20,957 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:21:20,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:21:20,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200316404] [2022-04-28 14:21:20,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705940974] [2022-04-28 14:21:20,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705940974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:20,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:20,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:21:20,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:20,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [594218936] [2022-04-28 14:21:20,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [594218936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:20,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:20,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:21:20,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820802841] [2022-04-28 14:21:20,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:20,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-28 14:21:20,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:20,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:21:20,972 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:21:20,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:21:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:20,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:21:20,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:21:20,974 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:21:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:21,073 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 14:21:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:21:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-28 14:21:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:21:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:21:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:21:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:21:21,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 14:21:21,113 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:21:21,115 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:21:21,115 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 14:21:21,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:21:21,117 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:21,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:21:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 14:21:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 14:21:21,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:21,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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:21:21,137 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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:21:21,137 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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:21:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:21,142 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 14:21:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:21:21,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:21,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:21,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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 30 states. [2022-04-28 14:21:21,143 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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 30 states. [2022-04-28 14:21:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:21,147 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 14:21:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:21:21,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:21,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:21,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:21,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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:21:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 14:21:21,151 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 14:21:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:21,152 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 14:21:21,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:21:21,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 14:21:21,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:21:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:21:21,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:21,185 INFO L195 NwaCegarLoop]: trace histogram [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:21:21,205 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:21:21,399 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:21:21,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-28 14:21:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [982638691] [2022-04-28 14:21:21,528 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:21,529 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:21,529 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-28 14:21:21,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:21,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688094981] [2022-04-28 14:21:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:21,539 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:21,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449177567] [2022-04-28 14:21:21,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:21:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:21,540 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:21:21,541 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:21:21,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:21:21,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:21,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:21:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:21,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:21,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 14:21:21,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-28 14:21:21,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:21:21,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 14:21:21,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 14:21:21,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-28 14:21:21,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {474#true} is VALID [2022-04-28 14:21:21,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:21:21,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:21:21,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:21:21,729 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 14:21:21,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:21,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:21,730 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-28 14:21:21,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:21:21,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:21:21,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:21:21,731 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:21,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(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 + ~x~0; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-28 14:21:21,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-28 14:21:21,733 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:21,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:21,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 14:21:21,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 14:21:21,734 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:21:21,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:25,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 14:21:25,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 14:21:25,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:25,444 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:25,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:21:25,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~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 + ~x~0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:21:25,519 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:21:25,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:21:25,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:21:25,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:21:25,519 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-28 14:21:25,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:21:25,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:21:25,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 14:21:25,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:21:25,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:21:25,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:21:25,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {474#true} is VALID [2022-04-28 14:21:25,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-28 14:21:25,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 14:21:25,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 14:21:25,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:21:25,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-28 14:21:25,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 14:21:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:21:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:25,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688094981] [2022-04-28 14:21:25,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:25,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449177567] [2022-04-28 14:21:25,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449177567] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:25,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:25,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:21:25,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [982638691] [2022-04-28 14:21:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [982638691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:25,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:25,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:21:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899234214] [2022-04-28 14:21:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:25,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2022-04-28 14:21:25,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:25,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:21:25,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:25,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:21:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:21:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:21:25,550 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:21:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:25,662 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 14:21:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:21:25,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2022-04-28 14:21:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:21:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 14:21:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:21:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 14:21:25,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 14:21:25,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:25,695 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:21:25,695 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 14:21:25,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:21:25,696 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:25,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:21:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 14:21:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 14:21:25,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:25,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:21:25,708 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:21:25,708 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:21:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:25,709 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 14:21:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:21:25,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:25,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:25,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-28 14:21:25,710 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-28 14:21:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:25,711 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 14:21:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:21:25,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:25,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:25,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:25,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:21:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 14:21:25,713 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-28 14:21:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:25,713 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 14:21:25,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:21:25,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 14:21:25,747 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:21:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:21:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:21:25,747 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:25,747 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:25,763 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:21:25,955 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:21:25,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-28 14:21:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:25,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513767497] [2022-04-28 14:21:26,182 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:26,183 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-28 14:21:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:26,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510140537] [2022-04-28 14:21:26,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:26,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:26,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1749727159] [2022-04-28 14:21:26,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:21:26,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:26,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:26,206 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:21:26,207 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:21:26,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:21:26,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:26,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:21:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:26,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:26,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-28 14:21:26,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#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); {822#true} is VALID [2022-04-28 14:21:26,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:21:26,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-28 14:21:26,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 14:21:26,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#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; {822#true} is VALID [2022-04-28 14:21:26,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {822#true} is VALID [2022-04-28 14:21:26,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:21:26,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:21:26,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:21:26,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-28 14:21:26,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:26,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:26,518 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-28 14:21:26,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:21:26,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:21:26,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:21:26,518 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:26,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(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 + ~x~0; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:21:26,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:21:26,519 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-28 14:21:26,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:21:26,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:21:26,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:21:26,520 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:21:26,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:21:26,521 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:26,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:26,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-28 14:21:26,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 14:21:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:21:26,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:26,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510140537] [2022-04-28 14:21:26,759 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:26,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749727159] [2022-04-28 14:21:26,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749727159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:26,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:26,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:21:26,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:26,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1513767497] [2022-04-28 14:21:26,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1513767497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:26,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:26,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:21:26,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421506363] [2022-04-28 14:21:26,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 14:21:26,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:26,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:21:26,777 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:21:26,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:21:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:26,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:21:26,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:21:26,778 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:21:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:26,945 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 14:21:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:21:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 14:21:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:21:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 14:21:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:21:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 14:21:26,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-28 14:21:26,973 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:21:26,974 INFO L225 Difference]: With dead ends: 39 [2022-04-28 14:21:26,975 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:21:26,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 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:21:26,975 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:26,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:21:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:21:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 14:21:26,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:26,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:21:26,991 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:21:26,991 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:21:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:26,992 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 14:21:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:21:26,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:26,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:26,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 34 states. [2022-04-28 14:21:26,993 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 34 states. [2022-04-28 14:21:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:27,002 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 14:21:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:21:27,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:27,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:27,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:27,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:21:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 14:21:27,006 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-28 14:21:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:27,007 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 14:21:27,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:21:27,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 14:21:27,041 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:21:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:21:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:21:27,042 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:27,042 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:27,061 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:21:27,258 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:21:27,258 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-28 14:21:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:27,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [124047212] [2022-04-28 14:21:27,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:27,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-28 14:21:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:27,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793525542] [2022-04-28 14:21:27,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:27,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:27,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526392309] [2022-04-28 14:21:27,347 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:21:27,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:27,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:27,351 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:21:27,352 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:21:27,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:21:27,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:27,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 14:21:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:27,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:27,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-28 14:21:27,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#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); {1178#true} is VALID [2022-04-28 14:21:27,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:21:27,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-28 14:21:27,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-28 14:21:27,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#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; {1178#true} is VALID [2022-04-28 14:21:27,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:21:27,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:21:27,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:21:27,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:21:27,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-28 14:21:27,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:27,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:27,725 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:21:27,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:21:27,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:21:27,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:21:27,726 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:27,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(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 + ~x~0; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 14:21:27,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 14:21:27,727 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:21:27,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:21:27,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:21:27,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:21:27,727 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 14:21:27,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~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 + ~x~0; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:21:27,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:21:27,729 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:21:27,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1270#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:27,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {1270#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:21:27,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:21:27,730 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} #54#return; {1281#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:21:27,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {1281#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1285#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 14:21:27,731 INFO L272 TraceCheckUtils]: 33: Hoare triple {1285#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:27,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {1289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:27,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-28 14:21:27,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-28 14:21:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 14:21:27,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:42,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:42,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793525542] [2022-04-28 14:21:42,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:42,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526392309] [2022-04-28 14:21:42,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526392309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:42,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:42,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:21:42,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:42,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [124047212] [2022-04-28 14:21:42,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [124047212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:42,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:42,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:21:42,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945039253] [2022-04-28 14:21:42,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 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:21:42,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:42,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:21:42,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:21:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:21:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:21:42,239 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:21:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:42,624 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-04-28 14:21:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:21:42,624 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 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:21:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:21:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 14:21:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:21:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 14:21:42,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-28 14:21:42,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:42,659 INFO L225 Difference]: With dead ends: 46 [2022-04-28 14:21:42,659 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 14:21:42,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:21:42,660 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:42,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:21:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 14:21:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 14:21:42,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:42,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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:21:42,684 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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:21:42,684 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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:21:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:42,686 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-28 14:21:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-28 14:21:42,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:42,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:42,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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 41 states. [2022-04-28 14:21:42,687 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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 41 states. [2022-04-28 14:21:42,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:42,688 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-28 14:21:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-28 14:21:42,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:42,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:42,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:42,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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:21:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-28 14:21:42,690 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2022-04-28 14:21:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:42,690 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-28 14:21:42,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:21:42,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-28 14:21:42,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-28 14:21:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:21:42,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:42,741 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:42,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 14:21:42,942 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:21:42,942 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-28 14:21:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:42,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494711685] [2022-04-28 14:21:43,046 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:43,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-28 14:21:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:43,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111123563] [2022-04-28 14:21:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:43,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:43,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947424039] [2022-04-28 14:21:43,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:21:43,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:43,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:43,057 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:21:43,058 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:21:43,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:21:43,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:43,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:21:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:43,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:43,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {1605#true} call ULTIMATE.init(); {1605#true} is VALID [2022-04-28 14:21:43,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#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); {1605#true} is VALID [2022-04-28 14:21:43,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:21:43,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#true} {1605#true} #60#return; {1605#true} is VALID [2022-04-28 14:21:43,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#true} call #t~ret5 := main(); {1605#true} is VALID [2022-04-28 14:21:43,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#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; {1605#true} is VALID [2022-04-28 14:21:43,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:21:43,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:21:43,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:21:43,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:21:43,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#true} {1605#true} #52#return; {1605#true} is VALID [2022-04-28 14:21:43,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {1605#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:43,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:43,418 INFO L272 TraceCheckUtils]: 13: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:21:43,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:21:43,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:21:43,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:21:43,419 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1605#true} {1643#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:43,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {1643#(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 + ~x~0; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:21:43,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:21:43,420 INFO L272 TraceCheckUtils]: 20: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:21:43,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:21:43,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:21:43,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:21:43,421 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1605#true} {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:21:43,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {1665#(and (= (+ (- 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 + ~x~0; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:43,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:43,422 INFO L272 TraceCheckUtils]: 27: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:21:43,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:21:43,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:21:43,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:21:43,423 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1605#true} {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:43,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 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 + ~x~0; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:21:43,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:21:43,423 INFO L272 TraceCheckUtils]: 34: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:21:43,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:21:43,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:21:43,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:21:43,424 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1605#true} {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:21:43,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1731#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:21:43,425 INFO L272 TraceCheckUtils]: 40: Hoare triple {1731#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:43,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {1735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:43,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {1739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1606#false} is VALID [2022-04-28 14:21:43,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {1606#false} assume !false; {1606#false} is VALID [2022-04-28 14:21:43,426 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:21:43,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:43,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111123563] [2022-04-28 14:21:43,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:43,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947424039] [2022-04-28 14:21:43,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947424039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:43,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:43,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 14:21:43,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:43,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494711685] [2022-04-28 14:21:43,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494711685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:43,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:43,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:21:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906412714] [2022-04-28 14:21:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:43,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 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 44 [2022-04-28 14:21:43,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:43,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 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:21:43,671 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:21:43,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:21:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:43,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:21:43,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:21:43,672 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 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:21:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:43,956 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-28 14:21:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:21:43,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 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 44 [2022-04-28 14:21:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 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:21:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 14:21:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 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:21:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 14:21:43,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 14:21:43,988 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:21:43,989 INFO L225 Difference]: With dead ends: 49 [2022-04-28 14:21:43,989 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 14:21:43,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 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:21:43,990 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:43,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:21:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 14:21:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 14:21:44,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:44,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:21:44,010 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:21:44,010 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:21:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:44,011 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:21:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:21:44,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:44,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:44,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 44 states. [2022-04-28 14:21:44,012 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 44 states. [2022-04-28 14:21:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:44,013 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:21:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:21:44,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:44,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:44,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:44,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:21:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 14:21:44,015 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 44 [2022-04-28 14:21:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:44,015 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 14:21:44,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 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:21:44,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 14:21:44,064 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:21:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:21:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 14:21:44,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:44,065 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:44,083 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:21:44,271 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:21:44,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:44,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-28 14:21:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:44,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1712856870] [2022-04-28 14:21:44,352 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:44,352 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-28 14:21:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:44,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457329263] [2022-04-28 14:21:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:44,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:44,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948463163] [2022-04-28 14:21:44,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:21:44,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:44,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:44,372 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:21:44,373 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:21:44,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:21:44,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:44,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:21:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:44,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:44,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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); {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #60#return; {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret5 := main(); {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#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; {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:21:44,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #52#return; {2065#true} is VALID [2022-04-28 14:21:44,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:44,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:44,801 INFO L272 TraceCheckUtils]: 13: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:21:44,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:21:44,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:21:44,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:21:44,802 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2103#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:44,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {2103#(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 + ~x~0; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:21:44,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:21:44,803 INFO L272 TraceCheckUtils]: 20: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:21:44,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:21:44,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:21:44,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:21:44,803 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2065#true} {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:21:44,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {2125#(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 + ~x~0; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:44,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:44,804 INFO L272 TraceCheckUtils]: 27: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:21:44,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:21:44,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:21:44,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:21:44,805 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2065#true} {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:44,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 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 + ~x~0; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 14:21:44,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 14:21:44,805 INFO L272 TraceCheckUtils]: 34: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:21:44,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:21:44,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:21:44,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:21:44,806 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2065#true} {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 14:21:44,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:21:44,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:21:44,807 INFO L272 TraceCheckUtils]: 41: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:21:44,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:21:44,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:21:44,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:21:44,808 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2065#true} {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:21:44,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2213#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 14:21:44,809 INFO L272 TraceCheckUtils]: 47: Hoare triple {2213#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:44,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {2217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:44,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {2221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-28 14:21:44,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-28 14:21:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:21:44,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457329263] [2022-04-28 14:21:45,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948463163] [2022-04-28 14:21:45,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948463163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:45,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:45,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 14:21:45,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:45,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1712856870] [2022-04-28 14:21:45,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1712856870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:45,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:45,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:21:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059676671] [2022-04-28 14:21:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:45,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 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 51 [2022-04-28 14:21:45,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:45,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 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:21:45,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:21:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:45,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:21:45,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:21:45,066 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 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:21:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:45,409 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-28 14:21:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:21:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 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 51 [2022-04-28 14:21:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 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:21:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 14:21:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 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:21:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 14:21:45,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-28 14:21:45,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:45,450 INFO L225 Difference]: With dead ends: 52 [2022-04-28 14:21:45,450 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 14:21:45,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:21:45,451 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:45,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:21:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 14:21:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 14:21:45,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:45,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:21:45,484 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:21:45,484 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:21:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:45,486 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 14:21:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 14:21:45,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:45,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:45,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-28 14:21:45,486 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-28 14:21:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:45,487 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 14:21:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 14:21:45,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:45,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:45,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:45,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:21:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-28 14:21:45,489 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 51 [2022-04-28 14:21:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:45,489 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-28 14:21:45,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 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:21:45,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-28 14:21:45,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 14:21:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 14:21:45,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:45,544 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:45,560 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:21:45,759 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:21:45,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:45,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-28 14:21:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:45,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944348779] [2022-04-28 14:21:45,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:45,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-28 14:21:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:45,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753704617] [2022-04-28 14:21:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:45,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:45,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394169378] [2022-04-28 14:21:45,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:21:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:45,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:45,861 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:21:45,862 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:21:45,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:21:45,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:45,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:21:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:45,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:46,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2022-04-28 14:21:46,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {2565#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); {2565#true} is VALID [2022-04-28 14:21:46,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:21:46,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #60#return; {2565#true} is VALID [2022-04-28 14:21:46,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret5 := main(); {2565#true} is VALID [2022-04-28 14:21:46,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {2565#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; {2565#true} is VALID [2022-04-28 14:21:46,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {2565#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:21:46,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:21:46,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:21:46,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:21:46,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2565#true} {2565#true} #52#return; {2565#true} is VALID [2022-04-28 14:21:46,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {2565#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:46,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:46,302 INFO L272 TraceCheckUtils]: 13: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:21:46,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:21:46,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:21:46,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:21:46,303 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2565#true} {2603#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:46,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {2603#(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 + ~x~0; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:46,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:46,304 INFO L272 TraceCheckUtils]: 20: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:21:46,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:21:46,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:21:46,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:21:46,305 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2565#true} {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:46,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {2625#(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 + ~x~0; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:21:46,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:21:46,305 INFO L272 TraceCheckUtils]: 27: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:21:46,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:21:46,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:21:46,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:21:46,306 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2565#true} {2647#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:21:46,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {2647#(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 + ~x~0; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:21:46,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:21:46,307 INFO L272 TraceCheckUtils]: 34: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:21:46,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:21:46,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:21:46,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:21:46,308 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2565#true} {2669#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:21:46,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {2669#(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 + ~x~0; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:21:46,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:21:46,308 INFO L272 TraceCheckUtils]: 41: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:21:46,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:21:46,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:21:46,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:21:46,309 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2565#true} {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:21:46,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~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 + ~x~0; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 14:21:46,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !false; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 14:21:46,310 INFO L272 TraceCheckUtils]: 48: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:21:46,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:21:46,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:21:46,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:21:46,311 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2565#true} {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #54#return; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 14:21:46,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2735#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 14:21:46,312 INFO L272 TraceCheckUtils]: 54: Hoare triple {2735#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:46,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2743#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:46,313 INFO L290 TraceCheckUtils]: 56: Hoare triple {2743#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2566#false} is VALID [2022-04-28 14:21:46,313 INFO L290 TraceCheckUtils]: 57: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2022-04-28 14:21:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 14:21:46,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:46,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753704617] [2022-04-28 14:21:46,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:46,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394169378] [2022-04-28 14:21:46,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394169378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:46,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:46,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:21:46,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:46,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944348779] [2022-04-28 14:21:46,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944348779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:46,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:46,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:21:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906901150] [2022-04-28 14:21:46,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:46,536 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-28 14:21:46,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:46,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:21:46,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:46,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:21:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:21:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:21:46,563 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:21:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:47,012 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-28 14:21:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:21:47,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-28 14:21:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:21:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 14:21:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:21:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 14:21:47,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-28 14:21:47,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:47,064 INFO L225 Difference]: With dead ends: 55 [2022-04-28 14:21:47,064 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 14:21:47,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 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:21:47,065 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:47,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:21:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 14:21:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 14:21:47,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:47,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:21:47,091 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:21:47,091 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:21:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:47,094 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 14:21:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 14:21:47,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:47,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:47,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 50 states. [2022-04-28 14:21:47,094 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 50 states. [2022-04-28 14:21:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:47,096 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 14:21:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 14:21:47,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:47,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:47,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:47,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:21:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 14:21:47,097 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 58 [2022-04-28 14:21:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:47,097 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 14:21:47,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:21:47,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 14:21:47,159 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:21:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 14:21:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 14:21:47,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:47,160 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:47,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 14:21:47,360 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:21:47,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:47,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-28 14:21:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:47,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1886840977] [2022-04-28 14:21:47,467 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:47,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:47,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-28 14:21:47,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:47,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199093136] [2022-04-28 14:21:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:47,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:47,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347540984] [2022-04-28 14:21:47,475 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:21:47,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:47,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:47,476 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:21:47,477 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:21:47,608 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:21:47,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:47,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 14:21:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:47,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:47,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {3105#true} call ULTIMATE.init(); {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {3105#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); {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3105#true} {3105#true} #60#return; {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {3105#true} call #t~ret5 := main(); {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {3105#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; {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {3105#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3105#true} {3105#true} #52#return; {3105#true} is VALID [2022-04-28 14:21:47,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {3105#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3143#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:47,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {3143#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3143#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:47,952 INFO L272 TraceCheckUtils]: 13: Hoare triple {3143#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:21:47,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:21:47,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:21:47,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,956 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3105#true} {3143#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3143#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:47,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {3143#(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 + ~x~0; {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:47,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:47,957 INFO L272 TraceCheckUtils]: 20: Hoare triple {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:21:47,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:21:47,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:21:47,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,966 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3105#true} {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3165#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:47,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {3165#(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 + ~x~0; {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:21:47,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:21:47,967 INFO L272 TraceCheckUtils]: 27: Hoare triple {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:21:47,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:21:47,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:21:47,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,968 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3105#true} {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {3187#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:21:47,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {3187#(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 + ~x~0; {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:21:47,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:21:47,969 INFO L272 TraceCheckUtils]: 34: Hoare triple {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:21:47,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:21:47,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:21:47,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,970 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3105#true} {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #54#return; {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:21:47,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {3209#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) 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 + ~x~0; {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-28 14:21:47,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-28 14:21:47,971 INFO L272 TraceCheckUtils]: 41: Hoare triple {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:21:47,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:21:47,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:21:47,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,971 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3105#true} {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #54#return; {3231#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-28 14:21:47,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {3231#(and (= (+ main_~y~0 (- 4)) 0) (= 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 + ~x~0; {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:21:47,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:21:47,972 INFO L272 TraceCheckUtils]: 48: Hoare triple {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:21:47,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:21:47,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:21:47,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,973 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3105#true} {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3253#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:21:47,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {3253#(and (= 5 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 + ~x~0; {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:21:47,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:21:47,974 INFO L272 TraceCheckUtils]: 55: Hoare triple {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:21:47,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:21:47,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:21:47,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:21:47,975 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3105#true} {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #54#return; {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:21:47,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {3275#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3297#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 14:21:47,976 INFO L272 TraceCheckUtils]: 61: Hoare triple {3297#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:47,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {3301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:47,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {3305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3106#false} is VALID [2022-04-28 14:21:47,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {3106#false} assume !false; {3106#false} is VALID [2022-04-28 14:21:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:21:47,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:48,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:48,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199093136] [2022-04-28 14:21:48,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:48,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347540984] [2022-04-28 14:21:48,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347540984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:48,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:48,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 14:21:48,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:48,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1886840977] [2022-04-28 14:21:48,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1886840977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:48,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:48,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:21:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046055100] [2022-04-28 14:21:48,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 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 65 [2022-04-28 14:21:48,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:48,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 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:21:48,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:48,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:21:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:21:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:21:48,237 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 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:21:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:48,795 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-28 14:21:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:21:48,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 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 65 [2022-04-28 14:21:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 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:21:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 14:21:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 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:21:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 14:21:48,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-28 14:21:48,840 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:21:48,841 INFO L225 Difference]: With dead ends: 58 [2022-04-28 14:21:48,841 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 14:21:48,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:21:48,846 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:48,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:21:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 14:21:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 14:21:48,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:48,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:21:48,881 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:21:48,881 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:21:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:48,884 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-28 14:21:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-28 14:21:48,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:48,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:48,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 53 states. [2022-04-28 14:21:48,891 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 53 states. [2022-04-28 14:21:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:48,893 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-28 14:21:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-28 14:21:48,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:48,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:48,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:48,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:21:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-04-28 14:21:48,895 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 65 [2022-04-28 14:21:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:48,895 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-04-28 14:21:48,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 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:21:48,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 58 transitions. [2022-04-28 14:21:48,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-28 14:21:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 14:21:48,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:48,962 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:48,969 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:21:49,162 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:21:49,164 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 13 times [2022-04-28 14:21:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:49,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005515617] [2022-04-28 14:21:49,249 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:49,250 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 14 times [2022-04-28 14:21:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:49,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273064645] [2022-04-28 14:21:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:49,258 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:49,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143191190] [2022-04-28 14:21:49,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:21:49,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:49,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:49,259 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:21:49,260 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:21:49,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:21:49,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:49,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 14:21:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:49,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:49,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {3685#true} call ULTIMATE.init(); {3685#true} is VALID [2022-04-28 14:21:49,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {3685#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); {3685#true} is VALID [2022-04-28 14:21:49,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3685#true} {3685#true} #60#return; {3685#true} is VALID [2022-04-28 14:21:49,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {3685#true} call #t~ret5 := main(); {3685#true} is VALID [2022-04-28 14:21:49,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {3685#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; {3685#true} is VALID [2022-04-28 14:21:49,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {3685#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3685#true} {3685#true} #52#return; {3685#true} is VALID [2022-04-28 14:21:49,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {3685#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3723#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:49,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {3723#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3723#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:49,819 INFO L272 TraceCheckUtils]: 13: Hoare triple {3723#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,820 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3685#true} {3723#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3723#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:49,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {3723#(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 + ~x~0; {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:49,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:49,820 INFO L272 TraceCheckUtils]: 20: Hoare triple {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,821 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3685#true} {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3745#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:21:49,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {3745#(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 + ~x~0; {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:21:49,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:21:49,822 INFO L272 TraceCheckUtils]: 27: Hoare triple {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,822 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3685#true} {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3767#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:21:49,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {3767#(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 + ~x~0; {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 14:21:49,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 14:21:49,823 INFO L272 TraceCheckUtils]: 34: Hoare triple {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,824 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3685#true} {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #54#return; {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 14:21:49,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {3789#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 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 + ~x~0; {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:21:49,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:21:49,825 INFO L272 TraceCheckUtils]: 41: Hoare triple {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,843 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3685#true} {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3811#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:21:49,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {3811#(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 + ~x~0; {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:21:49,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:21:49,844 INFO L272 TraceCheckUtils]: 48: Hoare triple {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,845 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3685#true} {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {3833#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:21:49,845 INFO L290 TraceCheckUtils]: 53: Hoare triple {3833#(and (= (+ (- 1) main_~c~0) 4) (= 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 + ~x~0; {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:21:49,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:21:49,846 INFO L272 TraceCheckUtils]: 55: Hoare triple {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,847 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3685#true} {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:21:49,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {3855#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 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 + ~x~0; {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-28 14:21:49,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-28 14:21:49,847 INFO L272 TraceCheckUtils]: 62: Hoare triple {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3685#true} is VALID [2022-04-28 14:21:49,847 INFO L290 TraceCheckUtils]: 63: Hoare triple {3685#true} ~cond := #in~cond; {3685#true} is VALID [2022-04-28 14:21:49,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {3685#true} assume !(0 == ~cond); {3685#true} is VALID [2022-04-28 14:21:49,848 INFO L290 TraceCheckUtils]: 65: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-04-28 14:21:49,848 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3685#true} {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #54#return; {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-28 14:21:49,849 INFO L290 TraceCheckUtils]: 67: Hoare triple {3877#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3899#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-28 14:21:49,849 INFO L272 TraceCheckUtils]: 68: Hoare triple {3899#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:49,850 INFO L290 TraceCheckUtils]: 69: Hoare triple {3903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:49,850 INFO L290 TraceCheckUtils]: 70: Hoare triple {3907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3686#false} is VALID [2022-04-28 14:21:49,850 INFO L290 TraceCheckUtils]: 71: Hoare triple {3686#false} assume !false; {3686#false} is VALID [2022-04-28 14:21:49,851 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:21:49,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:50,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:50,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273064645] [2022-04-28 14:21:50,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:50,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143191190] [2022-04-28 14:21:50,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143191190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:50,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:50,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 14:21:50,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:50,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005515617] [2022-04-28 14:21:50,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005515617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:50,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:50,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:21:50,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340362268] [2022-04-28 14:21:50,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:50,100 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 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 72 [2022-04-28 14:21:50,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:50,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 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:21:50,133 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:21:50,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:21:50,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:21:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:21:50,133 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 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:21:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:50,771 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-04-28 14:21:50,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 14:21:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 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 72 [2022-04-28 14:21:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 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:21:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 14:21:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 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:21:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 14:21:50,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 14:21:50,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:50,822 INFO L225 Difference]: With dead ends: 61 [2022-04-28 14:21:50,822 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 14:21:50,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:21:50,823 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:50,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:21:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 14:21:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 14:21:50,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:50,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:21:50,859 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:21:50,859 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:21:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:50,860 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-28 14:21:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-28 14:21:50,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:50,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:50,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 56 states. [2022-04-28 14:21:50,860 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 56 states. [2022-04-28 14:21:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:50,861 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-28 14:21:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-28 14:21:50,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:50,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:50,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:50,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:21:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-04-28 14:21:50,863 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 72 [2022-04-28 14:21:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:50,863 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-04-28 14:21:50,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 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:21:50,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 62 transitions. [2022-04-28 14:21:50,938 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:21:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-28 14:21:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 14:21:50,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:50,939 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:50,946 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:21:51,144 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:21:51,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 15 times [2022-04-28 14:21:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:51,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1576777742] [2022-04-28 14:21:51,244 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:51,244 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 16 times [2022-04-28 14:21:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:51,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494439086] [2022-04-28 14:21:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:51,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:51,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1183280622] [2022-04-28 14:21:51,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:21:51,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:51,264 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:21:51,265 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:21:51,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:21:51,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:51,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 14:21:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:51,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:52,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {4305#true} call ULTIMATE.init(); {4305#true} is VALID [2022-04-28 14:21:52,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#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); {4305#true} is VALID [2022-04-28 14:21:52,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#true} {4305#true} #60#return; {4305#true} is VALID [2022-04-28 14:21:52,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#true} call #t~ret5 := main(); {4305#true} is VALID [2022-04-28 14:21:52,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#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; {4305#true} is VALID [2022-04-28 14:21:52,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#true} {4305#true} #52#return; {4305#true} is VALID [2022-04-28 14:21:52,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4343#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:52,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {4343#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4343#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:52,322 INFO L272 TraceCheckUtils]: 13: Hoare triple {4343#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,322 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4305#true} {4343#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4343#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:52,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {4343#(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 + ~x~0; {4365#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:21:52,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {4365#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4365#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:21:52,323 INFO L272 TraceCheckUtils]: 20: Hoare triple {4365#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,324 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4305#true} {4365#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {4365#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:21:52,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {4365#(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 + ~x~0; {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:21:52,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:21:52,324 INFO L272 TraceCheckUtils]: 27: Hoare triple {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,325 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4305#true} {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {4387#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:21:52,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {4387#(and (= (+ (- 1) main_~y~0) 1) (= 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 + ~x~0; {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:21:52,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:21:52,326 INFO L272 TraceCheckUtils]: 34: Hoare triple {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,326 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4305#true} {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {4409#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:21:52,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {4409#(and (= (+ (- 2) main_~y~0) 1) (= 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 + ~x~0; {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:21:52,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:21:52,331 INFO L272 TraceCheckUtils]: 41: Hoare triple {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,331 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4305#true} {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:21:52,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {4431#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~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 + ~x~0; {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 14:21:52,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 14:21:52,332 INFO L272 TraceCheckUtils]: 48: Hoare triple {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,333 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4305#true} {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 14:21:52,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {4453#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~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 + ~x~0; {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 14:21:52,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !false; {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 14:21:52,334 INFO L272 TraceCheckUtils]: 55: Hoare triple {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,334 INFO L290 TraceCheckUtils]: 58: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,335 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4305#true} {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #54#return; {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 14:21:52,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {4475#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~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 + ~x~0; {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 14:21:52,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} assume !false; {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 14:21:52,336 INFO L272 TraceCheckUtils]: 62: Hoare triple {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,336 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4305#true} {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} #54#return; {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 14:21:52,337 INFO L290 TraceCheckUtils]: 67: Hoare triple {4497#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 14:21:52,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 14:21:52,338 INFO L272 TraceCheckUtils]: 69: Hoare triple {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4305#true} is VALID [2022-04-28 14:21:52,338 INFO L290 TraceCheckUtils]: 70: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-28 14:21:52,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-28 14:21:52,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-28 14:21:52,338 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4305#true} {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #54#return; {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 14:21:52,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {4519#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4541#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 14:21:52,339 INFO L272 TraceCheckUtils]: 75: Hoare triple {4541#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:52,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {4545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:52,340 INFO L290 TraceCheckUtils]: 77: Hoare triple {4549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4306#false} is VALID [2022-04-28 14:21:52,340 INFO L290 TraceCheckUtils]: 78: Hoare triple {4306#false} assume !false; {4306#false} is VALID [2022-04-28 14:21:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 14:21:52,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:52,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494439086] [2022-04-28 14:21:52,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:52,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183280622] [2022-04-28 14:21:52,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183280622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:52,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:52,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 14:21:52,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:52,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1576777742] [2022-04-28 14:21:52,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1576777742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:52,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:52,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:21:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153102988] [2022-04-28 14:21:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:52,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 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 79 [2022-04-28 14:21:52,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:52,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 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:21:52,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:52,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:21:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:21:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:21:52,603 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 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:21:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:53,357 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-28 14:21:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:21:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 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 79 [2022-04-28 14:21:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 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:21:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 14:21:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 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:21:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 14:21:53,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-28 14:21:53,403 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:21:53,403 INFO L225 Difference]: With dead ends: 64 [2022-04-28 14:21:53,404 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:21:53,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:21:53,404 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:53,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:21:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:21:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 14:21:53,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:53,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:21:53,437 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:21:53,437 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:21:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:53,438 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-28 14:21:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-28 14:21:53,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:53,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:53,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:21:53,438 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:21:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:53,440 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-28 14:21:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-28 14:21:53,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:53,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:53,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:53,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:21:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-04-28 14:21:53,441 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 79 [2022-04-28 14:21:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:53,441 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-04-28 14:21:53,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 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:21:53,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2022-04-28 14:21:53,525 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:21:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-28 14:21:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 14:21:53,526 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:53,526 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:53,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 14:21:53,731 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:21:53,731 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 17 times [2022-04-28 14:21:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:53,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2101292286] [2022-04-28 14:21:53,804 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:53,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 18 times [2022-04-28 14:21:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:53,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069832136] [2022-04-28 14:21:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:53,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:53,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015948403] [2022-04-28 14:21:53,819 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:21:53,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:53,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:53,819 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:21:53,820 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:21:54,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 14:21:54,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:54,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 14:21:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:54,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:54,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {4965#true} call ULTIMATE.init(); {4965#true} is VALID [2022-04-28 14:21:54,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {4965#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); {4965#true} is VALID [2022-04-28 14:21:54,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4965#true} {4965#true} #60#return; {4965#true} is VALID [2022-04-28 14:21:54,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {4965#true} call #t~ret5 := main(); {4965#true} is VALID [2022-04-28 14:21:54,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {4965#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; {4965#true} is VALID [2022-04-28 14:21:54,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {4965#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4965#true} {4965#true} #52#return; {4965#true} is VALID [2022-04-28 14:21:54,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {4965#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5003#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:54,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {5003#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5003#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:54,541 INFO L272 TraceCheckUtils]: 13: Hoare triple {5003#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,541 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4965#true} {5003#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5003#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:54,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {5003#(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 + ~x~0; {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:21:54,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:21:54,542 INFO L272 TraceCheckUtils]: 20: Hoare triple {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,543 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4965#true} {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {5025#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:21:54,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {5025#(and (= (+ (- 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 + ~x~0; {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:21:54,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:21:54,543 INFO L272 TraceCheckUtils]: 27: Hoare triple {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,544 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4965#true} {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {5047#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:21:54,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {5047#(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 + ~x~0; {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:21:54,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:21:54,545 INFO L272 TraceCheckUtils]: 34: Hoare triple {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,546 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4965#true} {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {5069#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:21:54,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {5069#(and (= main_~y~0 3) (= (+ (- 1) 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 + ~x~0; {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:21:54,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:21:54,547 INFO L272 TraceCheckUtils]: 41: Hoare triple {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,547 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4965#true} {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {5091#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:21:54,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {5091#(and (= 3 (+ (- 1) main_~y~0)) (= 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 + ~x~0; {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:21:54,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:21:54,548 INFO L272 TraceCheckUtils]: 48: Hoare triple {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,548 INFO L290 TraceCheckUtils]: 50: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,548 INFO L290 TraceCheckUtils]: 51: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,549 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4965#true} {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {5113#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:21:54,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {5113#(and (= (+ (- 2) 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 + ~x~0; {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:54,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:54,550 INFO L272 TraceCheckUtils]: 55: Hoare triple {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,550 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4965#true} {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {5135#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:21:54,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {5135#(and (= main_~y~0 6) (= 4 (+ (- 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 + ~x~0; {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 14:21:54,551 INFO L290 TraceCheckUtils]: 61: Hoare triple {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 14:21:54,551 INFO L272 TraceCheckUtils]: 62: Hoare triple {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,551 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4965#true} {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {5157#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 14:21:54,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {5157#(and (= 7 main_~y~0) (= 7 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 + ~x~0; {5179#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:21:54,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {5179#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5179#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:21:54,552 INFO L272 TraceCheckUtils]: 69: Hoare triple {5179#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,553 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4965#true} {5179#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {5179#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:21:54,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {5179#(and (= main_~y~0 8) (= main_~c~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 + ~x~0; {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:21:54,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:21:54,554 INFO L272 TraceCheckUtils]: 76: Hoare triple {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 14:21:54,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 14:21:54,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 14:21:54,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 14:21:54,554 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4965#true} {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:21:54,555 INFO L290 TraceCheckUtils]: 81: Hoare triple {5201#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5223#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 14:21:54,555 INFO L272 TraceCheckUtils]: 82: Hoare triple {5223#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:54,556 INFO L290 TraceCheckUtils]: 83: Hoare triple {5227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:54,556 INFO L290 TraceCheckUtils]: 84: Hoare triple {5231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4966#false} is VALID [2022-04-28 14:21:54,556 INFO L290 TraceCheckUtils]: 85: Hoare triple {4966#false} assume !false; {4966#false} is VALID [2022-04-28 14:21:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:21:54,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:54,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:54,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069832136] [2022-04-28 14:21:54,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:54,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015948403] [2022-04-28 14:21:54,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015948403] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:21:54,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:21:54,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 14:21:54,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:54,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2101292286] [2022-04-28 14:21:54,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2101292286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:54,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:54,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:21:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382547614] [2022-04-28 14:21:54,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:54,774 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 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 86 [2022-04-28 14:21:54,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:54,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 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:21:54,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:54,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:21:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:21:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:21:54,812 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 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:21:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:55,682 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-28 14:21:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 14:21:55,682 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 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 86 [2022-04-28 14:21:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 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:21:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 14:21:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 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:21:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 14:21:55,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-28 14:21:55,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:55,729 INFO L225 Difference]: With dead ends: 67 [2022-04-28 14:21:55,729 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 14:21:55,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:21:55,729 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:55,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 395 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:21:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 14:21:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 14:21:55,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:21:55,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:21:55,779 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:21:55,779 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:21:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:55,780 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-28 14:21:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-28 14:21:55,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:55,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:55,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 62 states. [2022-04-28 14:21:55,781 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 62 states. [2022-04-28 14:21:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:55,782 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-28 14:21:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-28 14:21:55,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:21:55,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:21:55,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:21:55,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:21:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:21:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-04-28 14:21:55,784 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 86 [2022-04-28 14:21:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:21:55,784 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-04-28 14:21:55,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 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:21:55,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 70 transitions. [2022-04-28 14:21:55,862 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:21:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-28 14:21:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 14:21:55,863 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:21:55,863 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:21:55,867 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:21:56,067 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:21:56,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:21:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:21:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 19 times [2022-04-28 14:21:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:56,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [180360657] [2022-04-28 14:21:56,131 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:21:56,131 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:21:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 20 times [2022-04-28 14:21:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:21:56,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588457750] [2022-04-28 14:21:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:21:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:21:56,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:21:56,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478082950] [2022-04-28 14:21:56,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:21:56,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:21:56,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:21:56,141 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:21:56,142 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:21:56,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:21:56,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:21:56,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 14:21:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:21:56,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:21:57,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {5665#true} call ULTIMATE.init(); {5665#true} is VALID [2022-04-28 14:21:57,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {5665#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); {5665#true} is VALID [2022-04-28 14:21:57,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5665#true} {5665#true} #60#return; {5665#true} is VALID [2022-04-28 14:21:57,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {5665#true} call #t~ret5 := main(); {5665#true} is VALID [2022-04-28 14:21:57,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {5665#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; {5665#true} is VALID [2022-04-28 14:21:57,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {5665#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {5665#true} ~cond := #in~cond; {5691#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:21:57,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {5691#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5695#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:21:57,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {5695#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5695#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:21:57,747 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5695#(not (= |assume_abort_if_not_#in~cond| 0))} {5665#true} #52#return; {5702#(and (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:21:57,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {5702#(and (<= main_~k~0 10) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:57,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} assume !false; {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:57,748 INFO L272 TraceCheckUtils]: 13: Hoare triple {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,749 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5665#true} {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} #54#return; {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-28 14:21:57,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {5706#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~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 + ~x~0; {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:21:57,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} assume !false; {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:21:57,750 INFO L272 TraceCheckUtils]: 20: Hoare triple {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,751 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5665#true} {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} #54#return; {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:21:57,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {5728#(and (<= 1 main_~c~0) (<= main_~k~0 10) (= (+ (- 1) main_~y~0) 0) (<= 0 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 + ~x~0; {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:21:57,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:21:57,752 INFO L272 TraceCheckUtils]: 27: Hoare triple {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,752 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5665#true} {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:21:57,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {5750#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~k~0) (<= 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 + ~x~0; {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:21:57,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:21:57,753 INFO L272 TraceCheckUtils]: 34: Hoare triple {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,754 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5665#true} {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:21:57,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {5772#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} is VALID [2022-04-28 14:21:57,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} assume !false; {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} is VALID [2022-04-28 14:21:57,755 INFO L272 TraceCheckUtils]: 41: Hoare triple {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,755 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5665#true} {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} #54#return; {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 main_~c~0))} is VALID [2022-04-28 14:21:57,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {5794#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~y~0 4) (<= 4 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 + ~x~0; {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:21:57,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} assume !false; {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:21:57,756 INFO L272 TraceCheckUtils]: 48: Hoare triple {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,757 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5665#true} {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} #54#return; {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:21:57,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {5816#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= 5 main_~y~0) (<= 5 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 + ~x~0; {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:21:57,758 INFO L290 TraceCheckUtils]: 54: Hoare triple {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:21:57,758 INFO L272 TraceCheckUtils]: 55: Hoare triple {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,759 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5665#true} {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:21:57,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {5838#(and (= main_~y~0 6) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 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 + ~x~0; {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:21:57,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:21:57,775 INFO L272 TraceCheckUtils]: 62: Hoare triple {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,776 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5665#true} {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:21:57,776 INFO L290 TraceCheckUtils]: 67: Hoare triple {5860#(and (= 7 main_~y~0) (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 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 + ~x~0; {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:21:57,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:21:57,777 INFO L272 TraceCheckUtils]: 69: Hoare triple {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,777 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5665#true} {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:21:57,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {5882#(and (<= main_~k~0 10) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 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 + ~x~0; {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} is VALID [2022-04-28 14:21:57,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} assume !false; {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} is VALID [2022-04-28 14:21:57,778 INFO L272 TraceCheckUtils]: 76: Hoare triple {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,779 INFO L290 TraceCheckUtils]: 79: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,779 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5665#true} {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} #54#return; {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 main_~k~0))} is VALID [2022-04-28 14:21:57,780 INFO L290 TraceCheckUtils]: 81: Hoare triple {5904#(and (<= 9 main_~c~0) (<= main_~k~0 10) (= main_~y~0 9) (<= 0 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 + ~x~0; {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:21:57,780 INFO L290 TraceCheckUtils]: 82: Hoare triple {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} assume !false; {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:21:57,780 INFO L272 TraceCheckUtils]: 83: Hoare triple {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:57,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:57,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:57,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:57,781 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5665#true} {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #54#return; {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:21:57,781 INFO L290 TraceCheckUtils]: 88: Hoare triple {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:21:57,782 INFO L272 TraceCheckUtils]: 89: Hoare triple {5926#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:57,782 INFO L290 TraceCheckUtils]: 90: Hoare triple {5951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:57,782 INFO L290 TraceCheckUtils]: 91: Hoare triple {5955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5666#false} is VALID [2022-04-28 14:21:57,782 INFO L290 TraceCheckUtils]: 92: Hoare triple {5666#false} assume !false; {5666#false} is VALID [2022-04-28 14:21:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 14:21:57,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:21:58,769 INFO L290 TraceCheckUtils]: 92: Hoare triple {5666#false} assume !false; {5666#false} is VALID [2022-04-28 14:21:58,770 INFO L290 TraceCheckUtils]: 91: Hoare triple {5955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5666#false} is VALID [2022-04-28 14:21:58,770 INFO L290 TraceCheckUtils]: 90: Hoare triple {5951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:21:58,770 INFO L272 TraceCheckUtils]: 89: Hoare triple {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:21:58,771 INFO L290 TraceCheckUtils]: 88: Hoare triple {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} assume !(~c~0 < ~k~0); {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-28 14:21:58,771 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5665#true} {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} #54#return; {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-28 14:21:58,771 INFO L290 TraceCheckUtils]: 86: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,771 INFO L290 TraceCheckUtils]: 85: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,771 INFO L290 TraceCheckUtils]: 84: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,771 INFO L272 TraceCheckUtils]: 83: Hoare triple {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,772 INFO L290 TraceCheckUtils]: 82: Hoare triple {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} assume !false; {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-28 14:21:58,773 INFO L290 TraceCheckUtils]: 81: Hoare triple {5996#(or (not (< main_~c~0 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 + ~x~0; {5971#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-28 14:21:58,774 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5665#true} {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #54#return; {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 14:21:58,774 INFO L290 TraceCheckUtils]: 79: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,774 INFO L272 TraceCheckUtils]: 76: Hoare triple {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !false; {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 14:21:58,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ 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 + ~x~0; {5996#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 14:21:58,777 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5665#true} {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #54#return; {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 14:21:58,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,777 INFO L272 TraceCheckUtils]: 69: Hoare triple {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !false; {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 14:21:58,779 INFO L290 TraceCheckUtils]: 67: Hoare triple {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~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 + ~x~0; {6018#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 14:21:58,780 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5665#true} {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} #54#return; {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-28 14:21:58,780 INFO L290 TraceCheckUtils]: 65: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,780 INFO L272 TraceCheckUtils]: 62: Hoare triple {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} assume !false; {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-28 14:21:58,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~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 + ~x~0; {6040#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-28 14:21:58,782 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5665#true} {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} #54#return; {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-28 14:21:58,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,783 INFO L272 TraceCheckUtils]: 55: Hoare triple {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} assume !false; {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-28 14:21:58,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ 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 + ~x~0; {6062#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-28 14:21:58,785 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5665#true} {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} #54#return; {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-28 14:21:58,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,785 INFO L272 TraceCheckUtils]: 48: Hoare triple {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} assume !false; {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-28 14:21:58,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) 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 + ~x~0; {6084#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-28 14:21:58,788 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5665#true} {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} #54#return; {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-28 14:21:58,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,788 INFO L272 TraceCheckUtils]: 41: Hoare triple {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} assume !false; {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-28 14:21:58,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ 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 + ~x~0; {6106#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-28 14:21:58,791 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5665#true} {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} #54#return; {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-28 14:21:58,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,791 INFO L272 TraceCheckUtils]: 34: Hoare triple {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} assume !false; {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-28 14:21:58,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 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 + ~x~0; {6128#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-28 14:21:58,793 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5665#true} {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} #54#return; {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-28 14:21:58,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} assume !false; {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-28 14:21:58,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~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 + ~x~0; {6150#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-28 14:21:58,796 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5665#true} {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} #54#return; {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-28 14:21:58,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,797 INFO L272 TraceCheckUtils]: 20: Hoare triple {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} assume !false; {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-28 14:21:58,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~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 + ~x~0; {6172#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-28 14:21:58,799 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5665#true} {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} #54#return; {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-28 14:21:58,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {5665#true} assume !(0 == ~cond); {5665#true} is VALID [2022-04-28 14:21:58,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {5665#true} ~cond := #in~cond; {5665#true} is VALID [2022-04-28 14:21:58,799 INFO L272 TraceCheckUtils]: 13: Hoare triple {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} assume !false; {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-28 14:21:58,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {6216#(or (<= main_~k~0 9) (= (* main_~k~0 10) 100))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6194#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-28 14:21:58,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5695#(not (= |assume_abort_if_not_#in~cond| 0))} {5665#true} #52#return; {6216#(or (<= main_~k~0 9) (= (* main_~k~0 10) 100))} is VALID [2022-04-28 14:21:58,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {5695#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5695#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:21:58,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {6229#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {5695#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:21:58,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {5665#true} ~cond := #in~cond; {6229#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 14:21:58,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {5665#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {5665#true} is VALID [2022-04-28 14:21:58,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {5665#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; {5665#true} is VALID [2022-04-28 14:21:58,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {5665#true} call #t~ret5 := main(); {5665#true} is VALID [2022-04-28 14:21:58,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5665#true} {5665#true} #60#return; {5665#true} is VALID [2022-04-28 14:21:58,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {5665#true} assume true; {5665#true} is VALID [2022-04-28 14:21:58,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {5665#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); {5665#true} is VALID [2022-04-28 14:21:58,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {5665#true} call ULTIMATE.init(); {5665#true} is VALID [2022-04-28 14:21:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 14:21:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:21:58,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588457750] [2022-04-28 14:21:58,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:21:58,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478082950] [2022-04-28 14:21:58,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478082950] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:21:58,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:21:58,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2022-04-28 14:21:58,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:21:58,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [180360657] [2022-04-28 14:21:58,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [180360657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:21:58,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:21:58,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 14:21:58,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410488470] [2022-04-28 14:21:58,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:21:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-28 14:21:58,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:21:58,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:21:58,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:58,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 14:21:58,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:21:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 14:21:58,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-04-28 14:21:58,849 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:21:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:21:59,899 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-04-28 14:21:59,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:21:59,899 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-28 14:21:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:21:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:21:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-28 14:21:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:21:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-28 14:21:59,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2022-04-28 14:21:59,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:21:59,956 INFO L225 Difference]: With dead ends: 70 [2022-04-28 14:21:59,957 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 14:21:59,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 14:21:59,957 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 19 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:21:59,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 338 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:21:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 14:22:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 14:22:00,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:00,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:22:00,033 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:22:00,033 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:22:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:00,034 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-28 14:22:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-04-28 14:22:00,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:00,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:00,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 65 states. [2022-04-28 14:22:00,036 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 65 states. [2022-04-28 14:22:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:00,038 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-28 14:22:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-04-28 14:22:00,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:00,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:00,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:00,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:22:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-04-28 14:22:00,041 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 93 [2022-04-28 14:22:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:00,042 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-04-28 14:22:00,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:22:00,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 74 transitions. [2022-04-28 14:22:00,136 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:22:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-04-28 14:22:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 14:22:00,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:00,137 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:00,141 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:22:00,341 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:22:00,341 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 21 times [2022-04-28 14:22:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:00,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690668481] [2022-04-28 14:22:00,428 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:00,428 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:00,428 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 22 times [2022-04-28 14:22:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:00,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924252911] [2022-04-28 14:22:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:00,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:00,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428012581] [2022-04-28 14:22:00,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:22:00,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:00,438 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:22:00,439 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:22:00,487 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:22:00,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:00,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:22:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:00,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:01,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {6657#true} call ULTIMATE.init(); {6657#true} is VALID [2022-04-28 14:22:01,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {6657#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); {6657#true} is VALID [2022-04-28 14:22:01,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6657#true} {6657#true} #60#return; {6657#true} is VALID [2022-04-28 14:22:01,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {6657#true} call #t~ret5 := main(); {6657#true} is VALID [2022-04-28 14:22:01,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {6657#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; {6657#true} is VALID [2022-04-28 14:22:01,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {6657#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {6657#true} ~cond := #in~cond; {6683#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:22:01,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {6683#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6687#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:22:01,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {6687#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6687#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:22:01,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6687#(not (= |assume_abort_if_not_#in~cond| 0))} {6657#true} #52#return; {6694#(and (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {6694#(and (<= main_~k~0 10) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:22:01,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:22:01,161 INFO L272 TraceCheckUtils]: 13: Hoare triple {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,162 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6657#true} {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:22:01,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {6698#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 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 + ~x~0; {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,163 INFO L272 TraceCheckUtils]: 20: Hoare triple {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,164 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6657#true} {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {6720#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 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 + ~x~0; {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:22:01,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:22:01,165 INFO L272 TraceCheckUtils]: 27: Hoare triple {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,178 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6657#true} {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:22:01,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {6742#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 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 + ~x~0; {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:22:01,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:22:01,179 INFO L272 TraceCheckUtils]: 34: Hoare triple {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,180 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6657#true} {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:22:01,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {6764#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 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 + ~x~0; {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:22:01,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:22:01,181 INFO L272 TraceCheckUtils]: 41: Hoare triple {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,182 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6657#true} {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:22:01,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {6786#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 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 + ~x~0; {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:22:01,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:22:01,183 INFO L272 TraceCheckUtils]: 48: Hoare triple {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,184 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6657#true} {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:22:01,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {6808#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 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 + ~x~0; {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:22:01,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:22:01,185 INFO L272 TraceCheckUtils]: 55: Hoare triple {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,185 INFO L290 TraceCheckUtils]: 58: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,186 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6657#true} {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:22:01,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {6830#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 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 + ~x~0; {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:22:01,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:22:01,187 INFO L272 TraceCheckUtils]: 62: Hoare triple {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,187 INFO L290 TraceCheckUtils]: 63: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,187 INFO L290 TraceCheckUtils]: 64: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,187 INFO L290 TraceCheckUtils]: 65: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,188 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6657#true} {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:22:01,188 INFO L290 TraceCheckUtils]: 67: Hoare triple {6852#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 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 + ~x~0; {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:22:01,189 INFO L290 TraceCheckUtils]: 68: Hoare triple {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:22:01,189 INFO L272 TraceCheckUtils]: 69: Hoare triple {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,189 INFO L290 TraceCheckUtils]: 70: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,189 INFO L290 TraceCheckUtils]: 71: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,189 INFO L290 TraceCheckUtils]: 72: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,190 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6657#true} {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:22:01,190 INFO L290 TraceCheckUtils]: 74: Hoare triple {6874#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 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 + ~x~0; {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,191 INFO L290 TraceCheckUtils]: 75: Hoare triple {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,191 INFO L272 TraceCheckUtils]: 76: Hoare triple {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,191 INFO L290 TraceCheckUtils]: 77: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,191 INFO L290 TraceCheckUtils]: 78: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,191 INFO L290 TraceCheckUtils]: 79: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,192 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6657#true} {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,192 INFO L290 TraceCheckUtils]: 81: Hoare triple {6896#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 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 + ~x~0; {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,193 INFO L290 TraceCheckUtils]: 82: Hoare triple {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,193 INFO L272 TraceCheckUtils]: 83: Hoare triple {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6657#true} is VALID [2022-04-28 14:22:01,193 INFO L290 TraceCheckUtils]: 84: Hoare triple {6657#true} ~cond := #in~cond; {6657#true} is VALID [2022-04-28 14:22:01,193 INFO L290 TraceCheckUtils]: 85: Hoare triple {6657#true} assume !(0 == ~cond); {6657#true} is VALID [2022-04-28 14:22:01,193 INFO L290 TraceCheckUtils]: 86: Hoare triple {6657#true} assume true; {6657#true} is VALID [2022-04-28 14:22:01,194 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6657#true} {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:01,194 INFO L290 TraceCheckUtils]: 88: Hoare triple {6918#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 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 + ~x~0; {6658#false} is VALID [2022-04-28 14:22:01,194 INFO L290 TraceCheckUtils]: 89: Hoare triple {6658#false} assume !false; {6658#false} is VALID [2022-04-28 14:22:01,194 INFO L272 TraceCheckUtils]: 90: Hoare triple {6658#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L290 TraceCheckUtils]: 91: Hoare triple {6658#false} ~cond := #in~cond; {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L290 TraceCheckUtils]: 92: Hoare triple {6658#false} assume !(0 == ~cond); {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L290 TraceCheckUtils]: 93: Hoare triple {6658#false} assume true; {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6658#false} {6658#false} #54#return; {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L290 TraceCheckUtils]: 95: Hoare triple {6658#false} assume !(~c~0 < ~k~0); {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L272 TraceCheckUtils]: 96: Hoare triple {6658#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L290 TraceCheckUtils]: 97: Hoare triple {6658#false} ~cond := #in~cond; {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L290 TraceCheckUtils]: 98: Hoare triple {6658#false} assume 0 == ~cond; {6658#false} is VALID [2022-04-28 14:22:01,195 INFO L290 TraceCheckUtils]: 99: Hoare triple {6658#false} assume !false; {6658#false} is VALID [2022-04-28 14:22:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-28 14:22:01,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:22:01,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:01,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924252911] [2022-04-28 14:22:01,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:01,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428012581] [2022-04-28 14:22:01,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428012581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:01,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:01,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 14:22:01,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:01,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690668481] [2022-04-28 14:22:01,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690668481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:01,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:01,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 14:22:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378735235] [2022-04-28 14:22:01,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-28 14:22:01,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:01,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:01,246 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:22:01,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 14:22:01,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 14:22:01,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:22:01,247 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:01,611 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-28 14:22:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:22:01,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-28 14:22:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-28 14:22:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-28 14:22:01,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 70 transitions. [2022-04-28 14:22:01,671 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:22:01,672 INFO L225 Difference]: With dead ends: 69 [2022-04-28 14:22:01,672 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:22:01,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:22:01,673 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:01,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:22:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:22:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:22:01,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:01,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:22:01,673 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:22:01,673 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:22:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:01,674 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:22:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:22:01,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:01,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:01,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:22:01,674 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:22:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:01,674 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:22:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:22:01,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:01,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:01,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:01,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:22:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:22:01,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2022-04-28 14:22:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:01,674 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:22:01,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:01,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:22:01,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:22:01,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:01,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:22:01,694 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:22:01,883 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:22:01,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:22:02,883 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 14:22:02,883 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 14:22:02,883 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 14:22:02,883 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-28 14:22:02,884 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 14:22:02,884 INFO L895 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:22:02,884 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:22:02,884 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-28 14:22:02,884 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (<= 10 main_~c~0) .cse0 (= main_~y~0 10) (< 9 main_~k~0) .cse1) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and (= 7 main_~y~0) .cse0 (= 7 main_~c~0) .cse1 (< 6 main_~k~0)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and (< 7 main_~k~0) .cse0 (= main_~y~0 8) (= main_~c~0 8) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (<= 9 main_~c~0) .cse0 (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse1))) [2022-04-28 14:22:02,884 INFO L895 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (<= 10 main_~c~0) .cse0 (= main_~y~0 10) (< 9 main_~k~0) .cse1) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and (= 7 main_~y~0) .cse0 (= 7 main_~c~0) .cse1 (< 6 main_~k~0)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and (< 7 main_~k~0) .cse0 (= main_~y~0 8) (= main_~c~0 8) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (<= 9 main_~c~0) .cse0 (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse1))) [2022-04-28 14:22:02,884 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (<= 10 main_~c~0) .cse0 (= main_~y~0 10) (< 9 main_~k~0) .cse1) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and (= 7 main_~y~0) .cse0 (= 7 main_~c~0) .cse1 (< 6 main_~k~0)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and (< 7 main_~k~0) .cse0 (= main_~y~0 8) (= main_~c~0 8) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (<= 9 main_~c~0) .cse0 (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse1))) [2022-04-28 14:22:02,884 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-28 14:22:02,884 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse0) (and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0) .cse0) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0) .cse0) (and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0) .cse0 (<= main_~c~0 6)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (<= main_~k~0 7) (<= main_~c~0 7) (= 7 main_~y~0) .cse0 (< 6 main_~k~0)) (and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= main_~k~0 8) .cse0))) [2022-04-28 14:22:02,884 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 14:22:02,884 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 10) (<= 0 main_~k~0)) [2022-04-28 14:22:02,884 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-28 14:22:02,885 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:22:02,885 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 14:22:02,885 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:22:02,885 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:22:02,885 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:22:02,885 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:22:02,885 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:22:02,887 INFO L356 BasicCegarLoop]: Path program histogram: [22, 2, 2, 2] [2022-04-28 14:22:02,888 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:22:02,890 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:22:02,891 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:22:02,927 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:22:02,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:22:02 BoogieIcfgContainer [2022-04-28 14:22:02,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:22:02,937 INFO L158 Benchmark]: Toolchain (without parser) took 43192.40ms. Allocated memory was 189.8MB in the beginning and 230.7MB in the end (delta: 40.9MB). Free memory was 141.1MB in the beginning and 158.3MB in the end (delta: -17.2MB). Peak memory consumption was 112.8MB. Max. memory is 8.0GB. [2022-04-28 14:22:02,937 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:22:02,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.66ms. Allocated memory is still 189.8MB. Free memory was 140.9MB in the beginning and 165.8MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:22:02,937 INFO L158 Benchmark]: Boogie Preprocessor took 31.28ms. Allocated memory is still 189.8MB. Free memory was 165.4MB in the beginning and 163.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:22:02,937 INFO L158 Benchmark]: RCFGBuilder took 205.48ms. Allocated memory is still 189.8MB. Free memory was 163.9MB in the beginning and 153.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 14:22:02,938 INFO L158 Benchmark]: TraceAbstraction took 42800.52ms. Allocated memory was 189.8MB in the beginning and 230.7MB in the end (delta: 40.9MB). Free memory was 152.8MB in the beginning and 158.3MB in the end (delta: -5.5MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. [2022-04-28 14:22:02,938 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 151.66ms. Allocated memory is still 189.8MB. Free memory was 140.9MB in the beginning and 165.8MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.28ms. Allocated memory is still 189.8MB. Free memory was 165.4MB in the beginning and 163.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 205.48ms. Allocated memory is still 189.8MB. Free memory was 163.9MB in the beginning and 153.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 42800.52ms. Allocated memory was 189.8MB in the beginning and 230.7MB in the end (delta: 40.9MB). Free memory was 152.8MB in the beginning and 158.3MB in the end (delta: -5.5MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.7s, OverallIterations: 14, TraceHistogramMax: 13, PathProgramHistogramMax: 22, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 2952 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2461 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2551 IncrementalHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 491 mSDtfsCounter, 2551 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1008 GetRequests, 807 SyntacticMatches, 12 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=13, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 196 PreInvPairs, 304 NumberOfFragments, 1490 HoareAnnotationTreeSize, 196 FomulaSimplifications, 724 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 191 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((((((((k <= 10 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4) || ((((y == 6 && k <= 10) && c == 6) && 5 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1)) || ((((10 <= c && k <= 10) && y == 10) && 9 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 2 && k <= 10) && 1 < k) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((7 == y && k <= 10) && 7 == c) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 6 < k)) || ((((k <= 10 && 5 == c) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 4 < k)) || ((((7 < k && k <= 10) && y == 8) && c == 8) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 3) && 2 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 3)) || (((((9 <= c && k <= 10) && y == 9) && 8 < k) && c <= 9) && y * y * y * y + y * y + y * y * y * 2 == x * 4) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:22:02,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...