/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_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:22:17,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:22:17,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:22:17,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:22:17,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:22:17,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:22:17,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:22:17,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:22:17,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:22:17,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:22:17,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:22:17,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:22:17,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:22:17,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:22:17,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:22:17,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:22:17,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:22:17,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:22:17,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:22:17,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:22:17,299 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:22:17,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:22:17,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:22:17,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:22:17,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:22:17,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:22:17,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:22:17,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:22:17,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:22:17,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:22:17,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:22:17,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:22:17,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:22:17,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:22:17,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:22:17,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:22:17,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:22:17,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:22:17,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:22:17,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:22:17,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:22:17,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:22:17,314 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:22:17,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:22:17,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:22:17,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:22:17,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:22:17,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:22:17,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:22:17,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:22:17,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:22:17,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:22:17,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:22:17,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:22:17,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:22:17,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:22:17,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:22:17,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:22:17,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:22:17,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:22:17,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:22:17,325 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:22:17,325 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:22:17,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:22:17,326 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:22:17,326 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:22:17,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:22:17,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:22:17,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:22:17,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:22:17,520 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:22:17,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c [2022-04-28 14:22:17,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a978e63/353e937223964606ac66ff55dbf1f072/FLAGb19bf5ddf [2022-04-28 14:22:17,910 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:22:17,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c [2022-04-28 14:22:17,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a978e63/353e937223964606ac66ff55dbf1f072/FLAGb19bf5ddf [2022-04-28 14:22:17,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a978e63/353e937223964606ac66ff55dbf1f072 [2022-04-28 14:22:17,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:22:17,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:22:17,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:22:17,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:22:17,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:22:17,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:22:17" (1/1) ... [2022-04-28 14:22:17,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197651ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:17, skipping insertion in model container [2022-04-28 14:22:17,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:22:17" (1/1) ... [2022-04-28 14:22:17,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:22:17,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:22:18,082 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_valuebound20.c[458,471] [2022-04-28 14:22:18,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:22:18,113 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:22:18,124 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_valuebound20.c[458,471] [2022-04-28 14:22:18,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:22:18,147 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:22:18,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18 WrapperNode [2022-04-28 14:22:18,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:22:18,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:22:18,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:22:18,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:22:18,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (1/1) ... [2022-04-28 14:22:18,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (1/1) ... [2022-04-28 14:22:18,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (1/1) ... [2022-04-28 14:22:18,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (1/1) ... [2022-04-28 14:22:18,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (1/1) ... [2022-04-28 14:22:18,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (1/1) ... [2022-04-28 14:22:18,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (1/1) ... [2022-04-28 14:22:18,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:22:18,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:22:18,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:22:18,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:22:18,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (1/1) ... [2022-04-28 14:22:18,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:22:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:18,204 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:22:18,212 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:22:18,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:22:18,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:22:18,238 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:22:18,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:22:18,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:22:18,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:22:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:22:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:22:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:22:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:22:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:22:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:22:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:22:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:22:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:22:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:22:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:22:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:22:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:22:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:22:18,286 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:22:18,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:22:18,410 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:22:18,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:22:18,414 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:22:18,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:22:18 BoogieIcfgContainer [2022-04-28 14:22:18,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:22:18,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:22:18,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:22:18,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:22:18,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:22:17" (1/3) ... [2022-04-28 14:22:18,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5cde0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:22:18, skipping insertion in model container [2022-04-28 14:22:18,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:18" (2/3) ... [2022-04-28 14:22:18,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5cde0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:22:18, skipping insertion in model container [2022-04-28 14:22:18,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:22:18" (3/3) ... [2022-04-28 14:22:18,420 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound20.c [2022-04-28 14:22:18,428 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:22:18,428 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:22:18,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:22:18,458 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@2c7547bf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21769a7e [2022-04-28 14:22:18,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:22:18,463 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:22:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:22:18,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:18,467 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:22:18,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-28 14:22:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:18,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778172233] [2022-04-28 14:22:18,482 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:22:18,482 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-28 14:22:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:18,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838803026] [2022-04-28 14:22:18,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:22:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:18,653 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:22:18,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 14:22:18,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 14:22:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:22:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:18,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 14:22:18,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 14:22:18,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 14:22:18,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 14:22:18,664 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:22:18,664 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:22:18,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 14:22:18,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 14:22:18,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 14:22:18,665 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:22:18,665 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {31#true} is VALID [2022-04-28 14:22:18,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 14:22:18,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 14:22:18,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 14:22:18,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 14:22:18,668 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:22:18,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-28 14:22:18,669 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:22:18,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 14:22:18,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 14:22:18,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 14:22:18,669 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:22:18,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838803026] [2022-04-28 14:22:18,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838803026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:18,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:18,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:22:18,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:18,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778172233] [2022-04-28 14:22:18,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778172233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:18,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:18,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:22:18,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519911014] [2022-04-28 14:22:18,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:18,677 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:22:18,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:18,680 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:22:18,696 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:22:18,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:22:18,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:18,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:22:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:22:18,711 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:22:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:18,812 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 14:22:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:22:18,812 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:22:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:18,814 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:22:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 14:22:18,820 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:22:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 14:22:18,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-28 14:22:18,883 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:22:18,890 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:22:18,891 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 14:22:18,893 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:22:18,896 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:22:18,896 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:22:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 14:22:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 14:22:18,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:18,922 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:22:18,922 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:22:18,922 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:22:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:18,926 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 14:22:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:22:18,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:18,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:18,927 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:22:18,927 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:22:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:18,929 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 14:22:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:22:18,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:18,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:18,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:18,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:18,931 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:22:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 14:22:18,933 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-28 14:22:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:18,934 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 14:22:18,934 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:22:18,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 14:22:18,964 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:22:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:22:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:22:18,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:18,965 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:22:18,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:22:18,965 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-28 14:22:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:18,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1362841877] [2022-04-28 14:22:18,967 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:22:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-28 14:22:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:18,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066005390] [2022-04-28 14:22:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:18,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:18,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060884779] [2022-04-28 14:22:18,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:18,983 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:22:18,984 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:22:19,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:22:19,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:19,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:22:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:19,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:19,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-28 14:22:19,122 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:22:19,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 14:22:19,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-28 14:22:19,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-28 14:22:19,123 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:22:19,123 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {229#true} is VALID [2022-04-28 14:22:19,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-28 14:22:19,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-28 14:22:19,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 14:22:19,123 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-28 14:22:19,124 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:22:19,124 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:22:19,125 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:22:19,126 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:22:19,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-28 14:22:19,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-28 14:22:19,127 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:22:19,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:22:19,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:19,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066005390] [2022-04-28 14:22:19,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:19,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060884779] [2022-04-28 14:22:19,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060884779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:19,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:19,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:22:19,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1362841877] [2022-04-28 14:22:19,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1362841877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:19,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:19,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:22:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697071392] [2022-04-28 14:22:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:19,130 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:22:19,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:19,130 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:22:19,142 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:22:19,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:22:19,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:19,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:22:19,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:22:19,143 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:22:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:19,242 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 14:22:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:22:19,242 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:22:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:19,243 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:22:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:22:19,245 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:22:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:22:19,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 14:22:19,273 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:22:19,274 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:22:19,274 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 14:22:19,275 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:22:19,275 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:22:19,276 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:22:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 14:22:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 14:22:19,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:19,283 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:22:19,284 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:22:19,284 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:22:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:19,286 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 14:22:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:22:19,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:19,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:19,286 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:22:19,287 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:22:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:19,288 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 14:22:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:22:19,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:19,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:19,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:19,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:19,289 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:22:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 14:22:19,290 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 14:22:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:19,290 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 14:22:19,291 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:22:19,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 14:22:19,323 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:22:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:22:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:22:19,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:19,324 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:22:19,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 14:22:19,542 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:22:19,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-28 14:22:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:19,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099837972] [2022-04-28 14:22:19,715 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:19,715 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-28 14:22:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:19,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264908320] [2022-04-28 14:22:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:19,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:19,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025580521] [2022-04-28 14:22:19,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:19,761 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:22:19,761 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:22:19,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:19,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:19,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:22:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:19,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:19,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 14:22:19,929 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:22:19,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:19,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 14:22:19,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 14:22:19,930 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:22:19,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {474#true} is VALID [2022-04-28 14:22:19,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:22:19,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:22:19,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:19,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 14:22:19,931 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:22:19,932 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:22:19,932 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:22:19,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:22:19,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:22:19,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:19,933 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:22:19,933 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:22:19,934 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:22:19,934 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:22:19,935 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:22:19,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 14:22:19,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 14:22:19,936 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:22:19,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:20,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 14:22:20,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 14:22:20,372 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:22:20,373 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:22:20,373 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:22:20,381 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:22:20,381 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:22:20,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:20,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:22:20,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:22:20,382 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:22:20,383 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:22:20,384 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:22:20,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 14:22:20,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:20,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:22:20,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:22:20,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {474#true} is VALID [2022-04-28 14:22:20,385 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:22:20,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 14:22:20,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 14:22:20,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:20,387 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:22:20,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 14:22:20,387 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:22:20,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:20,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264908320] [2022-04-28 14:22:20,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:20,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025580521] [2022-04-28 14:22:20,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025580521] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:20,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:20,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:22:20,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:20,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099837972] [2022-04-28 14:22:20,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099837972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:20,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:20,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:22:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028648492] [2022-04-28 14:22:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:20,390 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:22:20,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:20,390 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:22:20,423 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:22:20,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:22:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:22:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:22:20,424 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:22:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:20,531 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 14:22:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:22:20,531 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:22:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:20,532 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:22:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 14:22:20,533 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:22:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 14:22:20,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 14:22:20,562 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:22:20,563 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:22:20,563 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 14:22:20,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:22:20,564 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:22:20,565 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:22:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 14:22:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 14:22:20,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:20,576 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:22:20,577 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:22:20,577 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:22:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:20,578 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 14:22:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:22:20,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:20,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:20,579 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:22:20,579 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:22:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:20,585 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 14:22:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:22:20,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:20,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:20,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:20,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:20,588 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:22:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 14:22:20,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-28 14:22:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:20,589 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 14:22:20,589 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:22:20,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 14:22:20,631 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:22:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:22:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:22:20,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:20,632 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:22:20,648 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:22:20,839 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:22:20,840 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:20,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-28 14:22:20,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:20,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2110519526] [2022-04-28 14:22:20,955 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:20,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-28 14:22:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:20,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749132626] [2022-04-28 14:22:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:20,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:20,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773655371] [2022-04-28 14:22:20,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:20,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:20,996 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:22:20,997 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:22:21,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:21,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:21,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:22:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:21,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:21,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-28 14:22:21,250 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:22:21,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:22:21,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-28 14:22:21,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 14:22:21,251 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:22:21,251 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {822#true} is VALID [2022-04-28 14:22:21,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:22:21,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:22:21,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:22:21,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-28 14:22:21,252 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:22:21,252 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:22:21,252 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:22:21,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:22:21,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:22:21,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:22:21,253 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:22:21,254 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:22:21,254 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:22:21,254 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:22:21,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:22:21,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:22:21,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:22:21,255 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:22:21,256 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:22:21,257 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:22:21,257 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:22:21,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-28 14:22:21,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 14:22:21,258 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:22:21,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:21,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:21,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749132626] [2022-04-28 14:22:21,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:21,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773655371] [2022-04-28 14:22:21,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773655371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:21,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:21,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:22:21,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:21,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2110519526] [2022-04-28 14:22:21,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2110519526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:21,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:21,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:22:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52784076] [2022-04-28 14:22:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:21,540 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:22:21,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:21,540 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:22:21,565 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:22:21,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:22:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:22:21,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:22:21,568 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:22:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:21,723 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 14:22:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:22:21,724 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:22:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:21,724 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:22:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 14:22:21,725 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:22:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 14:22:21,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-28 14:22:21,751 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:22:21,752 INFO L225 Difference]: With dead ends: 39 [2022-04-28 14:22:21,752 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:22:21,752 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:22:21,753 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:22:21,753 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:22:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:22:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 14:22:21,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:21,777 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:22:21,778 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:22:21,779 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:22:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:21,782 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 14:22:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:22:21,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:21,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:21,785 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:22:21,786 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:22:21,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:21,790 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 14:22:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:22:21,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:21,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:21,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:21,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:21,792 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:22:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 14:22:21,793 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-28 14:22:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:21,793 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 14:22:21,793 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:22:21,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 14:22:21,830 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:22:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:22:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:22:21,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:21,831 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:22:21,849 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:22:22,043 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:22:22,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:22,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-28 14:22:22,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:22,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255740519] [2022-04-28 14:22:22,146 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:22,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:22,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-28 14:22:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:22,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639986932] [2022-04-28 14:22:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:22,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:22,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:22,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742910644] [2022-04-28 14:22:22,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:22:22,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:22,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:22,160 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:22:22,161 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:22:22,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:22:22,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:22,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 14:22:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:22,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:22,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-28 14:22:22,436 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:22:22,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:22,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-28 14:22:22,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-28 14:22:22,436 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:22:22,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:22:22,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:22:22,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:22:22,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:22,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-28 14:22:22,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:22,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:22,446 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(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)); {1178#true} is VALID [2022-04-28 14:22:22,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:22:22,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:22:22,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:22,446 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:22,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(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; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:22,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:22,447 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(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)); {1178#true} is VALID [2022-04-28 14:22:22,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:22:22,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:22:22,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:22,448 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:22,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(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; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 14:22:22,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 14:22:22,449 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 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)); {1178#true} is VALID [2022-04-28 14:22:22,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:22:22,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:22:22,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:22,450 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1178#true} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #54#return; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 14:22:22,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-28 14:22:22,451 INFO L272 TraceCheckUtils]: 33: Hoare triple {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:22,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:22,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {1290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-28 14:22:22,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-28 14:22:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:22:22,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:22,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:22,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639986932] [2022-04-28 14:22:22,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:22,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742910644] [2022-04-28 14:22:22,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742910644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:22,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:22,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 14:22:22,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:22,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255740519] [2022-04-28 14:22:22,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255740519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:22,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:22,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:22:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161714849] [2022-04-28 14:22:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 14:22:22,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:22,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:22,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:22:22,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:22:22,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:22:22,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:22:22,749 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:22,970 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-28 14:22:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:22:22,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 14:22:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 14:22:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 14:22:22,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-28 14:22:22,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:23,000 INFO L225 Difference]: With dead ends: 42 [2022-04-28 14:22:23,000 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 14:22:23,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:22:23,001 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:23,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:22:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 14:22:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 14:22:23,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:23,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:23,017 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:23,017 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:23,018 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 14:22:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 14:22:23,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:23,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:23,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 14:22:23,019 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-28 14:22:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:23,020 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 14:22:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 14:22:23,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:23,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:23,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:23,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 14:22:23,021 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-28 14:22:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:23,021 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 14:22:23,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:23,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 14:22:23,062 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:22:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 14:22:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:22:23,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:23,063 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:22:23,079 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:22:23,275 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:22:23,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:23,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-28 14:22:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:23,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [551594998] [2022-04-28 14:22:23,366 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:23,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-28 14:22:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:23,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711760284] [2022-04-28 14:22:23,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:23,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:23,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533261545] [2022-04-28 14:22:23,380 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:22:23,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:23,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:23,381 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:22:23,381 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:22:23,441 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:22:23,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:23,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:22:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:23,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:23,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#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); {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #60#return; {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#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; {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 14:22:23,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #52#return; {1574#true} is VALID [2022-04-28 14:22:23,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {1574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:23,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:23,736 INFO L272 TraceCheckUtils]: 13: Hoare triple {1612#(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)); {1574#true} is VALID [2022-04-28 14:22:23,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 14:22:23,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 14:22:23,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 14:22:23,738 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1574#true} {1612#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:23,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {1612#(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; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:23,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:23,739 INFO L272 TraceCheckUtils]: 20: Hoare triple {1634#(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)); {1574#true} is VALID [2022-04-28 14:22:23,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 14:22:23,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 14:22:23,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 14:22:23,740 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1574#true} {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:23,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {1634#(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; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:23,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:23,741 INFO L272 TraceCheckUtils]: 27: Hoare triple {1656#(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)); {1574#true} is VALID [2022-04-28 14:22:23,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 14:22:23,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 14:22:23,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 14:22:23,744 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1574#true} {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:23,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#(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; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:23,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:23,745 INFO L272 TraceCheckUtils]: 34: Hoare triple {1678#(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)); {1574#true} is VALID [2022-04-28 14:22:23,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-28 14:22:23,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-28 14:22:23,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 14:22:23,746 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1574#true} {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:23,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1700#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:23,747 INFO L272 TraceCheckUtils]: 40: Hoare triple {1700#(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)); {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:23,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:23,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-28 14:22:23,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-28 14:22:23,748 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:22:23,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711760284] [2022-04-28 14:22:23,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533261545] [2022-04-28 14:22:23,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533261545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:23,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:23,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 14:22:23,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [551594998] [2022-04-28 14:22:23,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [551594998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:23,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:23,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:22:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208118550] [2022-04-28 14:22:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:23,975 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:22:23,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:23,975 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:22:23,997 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:22:23,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:22:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:22:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:22:23,998 INFO L87 Difference]: Start difference. First operand 37 states and 39 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:22:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:24,272 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-28 14:22:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:22:24,272 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:22:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:24,273 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:22:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 14:22:24,274 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:22:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 14:22:24,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 14:22:24,310 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:22:24,312 INFO L225 Difference]: With dead ends: 45 [2022-04-28 14:22:24,312 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 14:22:24,312 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:22:24,313 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:22:24,313 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:22:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 14:22:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 14:22:24,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:24,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:22:24,333 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:22:24,333 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:22:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:24,335 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 14:22:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 14:22:24,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:24,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:24,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-28 14:22:24,336 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-28 14:22:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:24,339 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 14:22:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 14:22:24,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:24,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:24,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:24,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:22:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 14:22:24,341 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-28 14:22:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:24,341 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 14:22:24,341 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:22:24,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 14:22:24,388 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:22:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 14:22:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 14:22:24,389 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:24,389 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:22:24,404 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:22:24,595 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:22:24,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-28 14:22:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:24,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1076572754] [2022-04-28 14:22:24,696 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:24,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-28 14:22:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:24,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209975010] [2022-04-28 14:22:24,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:24,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300021643] [2022-04-28 14:22:24,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:24,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:24,721 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:22:24,738 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:22:24,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:24,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:24,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:22:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:24,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:25,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {2010#true} call ULTIMATE.init(); {2010#true} is VALID [2022-04-28 14:22:25,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {2010#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); {2010#true} is VALID [2022-04-28 14:22:25,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 14:22:25,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2010#true} {2010#true} #60#return; {2010#true} is VALID [2022-04-28 14:22:25,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {2010#true} call #t~ret5 := main(); {2010#true} is VALID [2022-04-28 14:22:25,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {2010#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; {2010#true} is VALID [2022-04-28 14:22:25,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {2010#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2010#true} is VALID [2022-04-28 14:22:25,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 14:22:25,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 14:22:25,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 14:22:25,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2010#true} {2010#true} #52#return; {2010#true} is VALID [2022-04-28 14:22:25,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {2010#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:25,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:25,115 INFO L272 TraceCheckUtils]: 13: Hoare triple {2048#(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)); {2010#true} is VALID [2022-04-28 14:22:25,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 14:22:25,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 14:22:25,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 14:22:25,116 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2010#true} {2048#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:25,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#(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; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:25,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:25,117 INFO L272 TraceCheckUtils]: 20: Hoare triple {2070#(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)); {2010#true} is VALID [2022-04-28 14:22:25,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 14:22:25,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 14:22:25,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 14:22:25,118 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2010#true} {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:25,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(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; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:25,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:25,119 INFO L272 TraceCheckUtils]: 27: Hoare triple {2092#(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)); {2010#true} is VALID [2022-04-28 14:22:25,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 14:22:25,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 14:22:25,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 14:22:25,119 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2010#true} {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:25,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {2092#(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; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 14:22:25,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 14:22:25,120 INFO L272 TraceCheckUtils]: 34: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~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)); {2010#true} is VALID [2022-04-28 14:22:25,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 14:22:25,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 14:22:25,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 14:22:25,121 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2010#true} {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 14:22:25,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~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; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:22:25,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:22:25,122 INFO L272 TraceCheckUtils]: 41: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 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)); {2010#true} is VALID [2022-04-28 14:22:25,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-28 14:22:25,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-28 14:22:25,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-28 14:22:25,127 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2010#true} {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:22:25,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 14:22:25,128 INFO L272 TraceCheckUtils]: 47: Hoare triple {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 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)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:25,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:25,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2011#false} is VALID [2022-04-28 14:22:25,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {2011#false} assume !false; {2011#false} is VALID [2022-04-28 14:22:25,129 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:22:25,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:25,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209975010] [2022-04-28 14:22:25,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:25,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300021643] [2022-04-28 14:22:25,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300021643] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:25,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:25,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 14:22:25,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:25,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1076572754] [2022-04-28 14:22:25,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1076572754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:25,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:25,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:22:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602053819] [2022-04-28 14:22:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:25,379 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:22:25,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:25,379 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:22:25,407 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:22:25,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:22:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:22:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:22:25,407 INFO L87 Difference]: Start difference. First operand 40 states and 43 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:22:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:25,745 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-28 14:22:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:22:25,745 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:22:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:25,745 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:22:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 14:22:25,747 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:22:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 14:22:25,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-28 14:22:25,777 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:22:25,778 INFO L225 Difference]: With dead ends: 48 [2022-04-28 14:22:25,778 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 14:22:25,778 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:22:25,778 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:22:25,778 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:22:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 14:22:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 14:22:25,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:25,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:22:25,799 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:22:25,799 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:22:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:25,800 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 14:22:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 14:22:25,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:25,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:25,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-28 14:22:25,801 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-28 14:22:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:25,802 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 14:22:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 14:22:25,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:25,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:25,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:25,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:22:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 14:22:25,803 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-28 14:22:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:25,804 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 14:22:25,804 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:22:25,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 14:22:25,855 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:22:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 14:22:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 14:22:25,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:25,856 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:22:25,872 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:22:26,056 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:22:26,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-28 14:22:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:26,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081308905] [2022-04-28 14:22:26,140 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:26,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-28 14:22:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:26,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694872234] [2022-04-28 14:22:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:26,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:26,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142019970] [2022-04-28 14:22:26,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:22:26,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:26,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:26,151 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:22:26,151 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:22:26,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:22:26,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:26,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:22:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:26,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:26,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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); {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #60#return; {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#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; {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {2486#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 14:22:26,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2486#true} {2486#true} #52#return; {2486#true} is VALID [2022-04-28 14:22:26,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:26,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:26,593 INFO L272 TraceCheckUtils]: 13: Hoare triple {2524#(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)); {2486#true} is VALID [2022-04-28 14:22:26,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 14:22:26,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 14:22:26,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 14:22:26,593 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2486#true} {2524#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:26,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(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; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:26,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:26,594 INFO L272 TraceCheckUtils]: 20: Hoare triple {2546#(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)); {2486#true} is VALID [2022-04-28 14:22:26,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 14:22:26,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 14:22:26,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 14:22:26,595 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2486#true} {2546#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:26,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {2546#(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; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:26,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:26,598 INFO L272 TraceCheckUtils]: 27: Hoare triple {2568#(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)); {2486#true} is VALID [2022-04-28 14:22:26,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 14:22:26,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 14:22:26,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 14:22:26,598 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2486#true} {2568#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:26,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {2568#(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; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:22:26,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:22:26,599 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= 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)); {2486#true} is VALID [2022-04-28 14:22:26,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 14:22:26,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 14:22:26,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 14:22:26,600 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2486#true} {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:22:26,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:26,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:26,601 INFO L272 TraceCheckUtils]: 41: Hoare triple {2612#(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)); {2486#true} is VALID [2022-04-28 14:22:26,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 14:22:26,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 14:22:26,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 14:22:26,601 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2486#true} {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:26,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {2612#(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; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:22:26,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:22:26,603 INFO L272 TraceCheckUtils]: 48: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 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)); {2486#true} is VALID [2022-04-28 14:22:26,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-28 14:22:26,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-28 14:22:26,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-28 14:22:26,604 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2486#true} {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #54#return; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:22:26,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2656#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:22:26,605 INFO L272 TraceCheckUtils]: 54: Hoare triple {2656#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:26,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:26,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {2664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2487#false} is VALID [2022-04-28 14:22:26,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-28 14:22:26,606 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:22:26,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:26,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:26,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694872234] [2022-04-28 14:22:26,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:26,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142019970] [2022-04-28 14:22:26,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142019970] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:26,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:26,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:22:26,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:26,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081308905] [2022-04-28 14:22:26,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081308905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:26,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:26,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:22:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037585578] [2022-04-28 14:22:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:26,877 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:22:26,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:26,877 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:22:26,905 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:22:26,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:22:26,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:26,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:22:26,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:22:26,906 INFO L87 Difference]: Start difference. First operand 43 states and 47 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:22:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:27,355 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-28 14:22:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:22:27,355 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:22:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:27,356 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:22:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 14:22:27,357 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:22:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 14:22:27,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-28 14:22:27,407 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:22:27,409 INFO L225 Difference]: With dead ends: 51 [2022-04-28 14:22:27,409 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 14:22:27,409 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:22:27,410 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:22:27,410 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:22:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 14:22:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 14:22:27,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:27,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:22:27,456 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:22:27,456 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:22:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:27,457 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 14:22:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 14:22:27,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:27,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:27,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-28 14:22:27,459 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-28 14:22:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:27,460 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 14:22:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 14:22:27,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:27,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:27,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:27,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:22:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 14:22:27,461 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-28 14:22:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:27,461 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 14:22:27,462 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:22:27,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 14:22:27,517 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:22:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 14:22:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 14:22:27,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:27,517 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:22:27,522 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:22:27,719 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:22:27,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-28 14:22:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:27,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864850121] [2022-04-28 14:22:27,803 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:27,803 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-28 14:22:27,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:27,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437034914] [2022-04-28 14:22:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:27,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:27,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744248738] [2022-04-28 14:22:27,812 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:22:27,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:27,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:27,815 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:22:27,816 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:22:27,944 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:22:27,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:27,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 14:22:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:27,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:28,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {3002#true} call ULTIMATE.init(); {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {3002#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); {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3002#true} {3002#true} #60#return; {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {3002#true} call #t~ret5 := main(); {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {3002#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; {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L272 TraceCheckUtils]: 6: Hoare triple {3002#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3002#true} {3002#true} #52#return; {3002#true} is VALID [2022-04-28 14:22:28,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {3002#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:28,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:28,298 INFO L272 TraceCheckUtils]: 13: Hoare triple {3040#(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)); {3002#true} is VALID [2022-04-28 14:22:28,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 14:22:28,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 14:22:28,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,299 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3002#true} {3040#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:28,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {3040#(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; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:28,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:28,300 INFO L272 TraceCheckUtils]: 20: Hoare triple {3062#(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)); {3002#true} is VALID [2022-04-28 14:22:28,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 14:22:28,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 14:22:28,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,307 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3002#true} {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:28,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {3062#(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; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:28,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:28,310 INFO L272 TraceCheckUtils]: 27: Hoare triple {3084#(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)); {3002#true} is VALID [2022-04-28 14:22:28,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 14:22:28,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 14:22:28,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,310 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3002#true} {3084#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:28,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {3084#(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; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:22:28,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:22:28,311 INFO L272 TraceCheckUtils]: 34: Hoare triple {3106#(and (= 2 (+ (- 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)); {3002#true} is VALID [2022-04-28 14:22:28,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 14:22:28,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 14:22:28,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,312 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3002#true} {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:22:28,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {3106#(and (= 2 (+ (- 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; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:28,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:28,313 INFO L272 TraceCheckUtils]: 41: Hoare triple {3128#(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)); {3002#true} is VALID [2022-04-28 14:22:28,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 14:22:28,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 14:22:28,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,313 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3002#true} {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:28,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {3128#(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; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:28,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:28,314 INFO L272 TraceCheckUtils]: 48: Hoare triple {3150#(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)); {3002#true} is VALID [2022-04-28 14:22:28,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 14:22:28,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 14:22:28,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,315 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3002#true} {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:28,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {3150#(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; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:28,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:28,316 INFO L272 TraceCheckUtils]: 55: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 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)); {3002#true} is VALID [2022-04-28 14:22:28,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-28 14:22:28,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-28 14:22:28,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-28 14:22:28,317 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3002#true} {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:28,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:28,318 INFO L272 TraceCheckUtils]: 61: Hoare triple {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:28,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:28,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {3202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3003#false} is VALID [2022-04-28 14:22:28,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {3003#false} assume !false; {3003#false} is VALID [2022-04-28 14:22:28,319 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:22:28,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:28,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:28,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437034914] [2022-04-28 14:22:28,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:28,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744248738] [2022-04-28 14:22:28,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744248738] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:28,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:28,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 14:22:28,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:28,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864850121] [2022-04-28 14:22:28,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864850121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:28,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:28,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:22:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388724737] [2022-04-28 14:22:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:28,575 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:22:28,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:28,576 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:22:28,609 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:22:28,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:22:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:28,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:22:28,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:22:28,611 INFO L87 Difference]: Start difference. First operand 46 states and 51 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:22:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:29,168 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 14:22:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:22:29,169 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:22:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:29,169 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:22:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 14:22:29,170 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:22:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 14:22:29,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-28 14:22:29,211 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:22:29,212 INFO L225 Difference]: With dead ends: 54 [2022-04-28 14:22:29,212 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 14:22:29,212 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:22:29,213 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:22:29,213 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:22:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 14:22:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 14:22:29,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:29,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:22:29,238 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:22:29,238 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:22:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:29,240 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 14:22:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 14:22:29,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:29,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:29,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-28 14:22:29,241 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-28 14:22:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:29,242 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 14:22:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 14:22:29,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:29,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:29,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:29,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:22:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-28 14:22:29,243 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-28 14:22:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:29,243 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-28 14:22:29,243 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:22:29,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 55 transitions. [2022-04-28 14:22:29,307 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:22:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 14:22:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 14:22:29,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:29,308 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:22:29,314 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:22:29,508 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:22:29,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 13 times [2022-04-28 14:22:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:29,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372630050] [2022-04-28 14:22:29,589 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:29,589 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:29,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 14 times [2022-04-28 14:22:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:29,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751008176] [2022-04-28 14:22:29,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:29,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:29,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:29,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444064757] [2022-04-28 14:22:29,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:29,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:29,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:29,600 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:22:29,601 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:22:29,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:29,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:29,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 14:22:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:29,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:30,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#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); {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #60#return; {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret5 := main(); {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {3558#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; {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {3558#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3558#true} {3558#true} #52#return; {3558#true} is VALID [2022-04-28 14:22:30,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {3558#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:30,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:30,183 INFO L272 TraceCheckUtils]: 13: Hoare triple {3596#(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)); {3558#true} is VALID [2022-04-28 14:22:30,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,184 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3558#true} {3596#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:30,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {3596#(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; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:30,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:30,185 INFO L272 TraceCheckUtils]: 20: Hoare triple {3618#(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)); {3558#true} is VALID [2022-04-28 14:22:30,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,185 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3558#true} {3618#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:30,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {3618#(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; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:22:30,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:22:30,186 INFO L272 TraceCheckUtils]: 27: Hoare triple {3640#(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)); {3558#true} is VALID [2022-04-28 14:22:30,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,187 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3558#true} {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:22:30,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {3640#(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; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:22:30,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:22:30,188 INFO L272 TraceCheckUtils]: 34: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~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)); {3558#true} is VALID [2022-04-28 14:22:30,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,193 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3558#true} {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:22:30,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~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; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:22:30,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:22:30,194 INFO L272 TraceCheckUtils]: 41: Hoare triple {3684#(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)); {3558#true} is VALID [2022-04-28 14:22:30,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,195 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3558#true} {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:22:30,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {3684#(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; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:22:30,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:22:30,196 INFO L272 TraceCheckUtils]: 48: Hoare triple {3706#(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)); {3558#true} is VALID [2022-04-28 14:22:30,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,197 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3558#true} {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:22:30,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {3706#(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; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:30,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:30,198 INFO L272 TraceCheckUtils]: 55: Hoare triple {3728#(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)); {3558#true} is VALID [2022-04-28 14:22:30,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,199 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3558#true} {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:30,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {3728#(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; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:22:30,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:22:30,200 INFO L272 TraceCheckUtils]: 62: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 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)); {3558#true} is VALID [2022-04-28 14:22:30,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-28 14:22:30,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-28 14:22:30,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 14:22:30,201 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3558#true} {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #54#return; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:22:30,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3772#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 14:22:30,202 INFO L272 TraceCheckUtils]: 68: Hoare triple {3772#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:30,203 INFO L290 TraceCheckUtils]: 69: Hoare triple {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:30,203 INFO L290 TraceCheckUtils]: 70: Hoare triple {3780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3559#false} is VALID [2022-04-28 14:22:30,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-28 14:22:30,204 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:22:30,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:30,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:30,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751008176] [2022-04-28 14:22:30,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:30,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444064757] [2022-04-28 14:22:30,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444064757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:30,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:30,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 14:22:30,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:30,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372630050] [2022-04-28 14:22:30,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372630050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:30,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:30,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:22:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360044317] [2022-04-28 14:22:30,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:30,484 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:22:30,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:30,485 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:22:30,522 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:22:30,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:22:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:30,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:22:30,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:22:30,523 INFO L87 Difference]: Start difference. First operand 49 states and 55 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:22:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:31,142 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 14:22:31,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 14:22:31,142 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:22:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:31,142 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:22:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 14:22:31,144 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:22:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 14:22:31,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 14:22:31,187 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:22:31,188 INFO L225 Difference]: With dead ends: 57 [2022-04-28 14:22:31,188 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 14:22:31,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:22:31,189 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:31,189 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.2s Time] [2022-04-28 14:22:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 14:22:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 14:22:31,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:31,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:22:31,235 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:22:31,235 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:22:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:31,236 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 14:22:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 14:22:31,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:31,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:31,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-28 14:22:31,236 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-28 14:22:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:31,237 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 14:22:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 14:22:31,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:31,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:31,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:31,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:22:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-28 14:22:31,239 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-28 14:22:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:31,239 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-28 14:22:31,239 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:22:31,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-28 14:22:31,303 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:22:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 14:22:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 14:22:31,304 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:31,304 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:22:31,309 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:22:31,509 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:22:31,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 15 times [2022-04-28 14:22:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:31,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510171427] [2022-04-28 14:22:31,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:31,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 16 times [2022-04-28 14:22:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:31,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874973191] [2022-04-28 14:22:31,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:31,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:31,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:31,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555941149] [2022-04-28 14:22:31,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:22:31,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:31,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:31,619 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:22:31,620 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:22:32,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:22:32,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:32,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 14:22:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:32,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:32,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {4154#true} call ULTIMATE.init(); {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {4154#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); {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4154#true} {4154#true} #60#return; {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {4154#true} call #t~ret5 := main(); {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {4154#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; {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {4154#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4154#true} {4154#true} #52#return; {4154#true} is VALID [2022-04-28 14:22:32,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {4154#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:32,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {4192#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:32,468 INFO L272 TraceCheckUtils]: 13: Hoare triple {4192#(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)); {4154#true} is VALID [2022-04-28 14:22:32,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,469 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4154#true} {4192#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:32,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {4192#(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; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:32,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {4214#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:32,470 INFO L272 TraceCheckUtils]: 20: Hoare triple {4214#(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)); {4154#true} is VALID [2022-04-28 14:22:32,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,470 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4154#true} {4214#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:22:32,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {4214#(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; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:32,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {4236#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:32,472 INFO L272 TraceCheckUtils]: 27: Hoare triple {4236#(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)); {4154#true} is VALID [2022-04-28 14:22:32,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,472 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4154#true} {4236#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:32,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {4236#(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; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:32,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {4258#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:32,473 INFO L272 TraceCheckUtils]: 34: Hoare triple {4258#(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)); {4154#true} is VALID [2022-04-28 14:22:32,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,476 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4154#true} {4258#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:32,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {4258#(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; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:32,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:32,477 INFO L272 TraceCheckUtils]: 41: Hoare triple {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 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)); {4154#true} is VALID [2022-04-28 14:22:32,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,477 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4154#true} {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:32,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 14:22:32,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 14:22:32,478 INFO L272 TraceCheckUtils]: 48: Hoare triple {4302#(and (= (+ (- 2) main_~y~0) 3) (= 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)); {4154#true} is VALID [2022-04-28 14:22:32,478 INFO L290 TraceCheckUtils]: 49: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,478 INFO L290 TraceCheckUtils]: 50: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,479 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4154#true} {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-28 14:22:32,479 INFO L290 TraceCheckUtils]: 53: Hoare triple {4302#(and (= (+ (- 2) main_~y~0) 3) (= 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; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 14:22:32,479 INFO L290 TraceCheckUtils]: 54: Hoare triple {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 14:22:32,479 INFO L272 TraceCheckUtils]: 55: Hoare triple {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} 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)); {4154#true} is VALID [2022-04-28 14:22:32,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,480 INFO L290 TraceCheckUtils]: 57: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,481 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4154#true} {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 14:22:32,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:32,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:32,482 INFO L272 TraceCheckUtils]: 62: Hoare triple {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 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)); {4154#true} is VALID [2022-04-28 14:22:32,482 INFO L290 TraceCheckUtils]: 63: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,482 INFO L290 TraceCheckUtils]: 64: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,486 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4154#true} {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:32,487 INFO L290 TraceCheckUtils]: 67: Hoare triple {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 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; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 14:22:32,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !false; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 14:22:32,487 INFO L272 TraceCheckUtils]: 69: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~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)); {4154#true} is VALID [2022-04-28 14:22:32,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-28 14:22:32,487 INFO L290 TraceCheckUtils]: 71: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-28 14:22:32,487 INFO L290 TraceCheckUtils]: 72: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-28 14:22:32,488 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4154#true} {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} #54#return; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 14:22:32,488 INFO L290 TraceCheckUtils]: 74: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !(~c~0 < ~k~0); {4390#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} is VALID [2022-04-28 14:22:32,489 INFO L272 TraceCheckUtils]: 75: Hoare triple {4390#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4394#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:32,489 INFO L290 TraceCheckUtils]: 76: Hoare triple {4394#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4398#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:32,489 INFO L290 TraceCheckUtils]: 77: Hoare triple {4398#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4155#false} is VALID [2022-04-28 14:22:32,490 INFO L290 TraceCheckUtils]: 78: Hoare triple {4155#false} assume !false; {4155#false} is VALID [2022-04-28 14:22:32,490 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:22:32,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:32,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874973191] [2022-04-28 14:22:32,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:32,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555941149] [2022-04-28 14:22:32,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555941149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:32,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:32,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 14:22:32,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:32,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510171427] [2022-04-28 14:22:32,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510171427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:32,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:32,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:22:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862554488] [2022-04-28 14:22:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:32,731 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:22:32,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:32,732 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:22:32,769 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:22:32,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:22:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:22:32,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:22:32,770 INFO L87 Difference]: Start difference. First operand 52 states and 59 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:22:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:33,510 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-28 14:22:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:22:33,510 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:22:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:33,510 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:22:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 14:22:33,512 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:22:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 14:22:33,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-28 14:22:33,574 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:22:33,575 INFO L225 Difference]: With dead ends: 60 [2022-04-28 14:22:33,575 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 14:22:33,576 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:22:33,576 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:22:33,576 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:22:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 14:22:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 14:22:33,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:33,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:22:33,616 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:22:33,616 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:22:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:33,617 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 14:22:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 14:22:33,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:33,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:33,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-28 14:22:33,618 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-28 14:22:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:33,619 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 14:22:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 14:22:33,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:33,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:33,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:33,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:22:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-28 14:22:33,620 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-28 14:22:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:33,621 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-28 14:22:33,621 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:22:33,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 63 transitions. [2022-04-28 14:22:33,700 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:22:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 14:22:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 14:22:33,701 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:33,701 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:22:33,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:33,906 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:22:33,906 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 17 times [2022-04-28 14:22:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:33,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1094068795] [2022-04-28 14:22:33,969 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:33,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 18 times [2022-04-28 14:22:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:33,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246600767] [2022-04-28 14:22:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:33,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:33,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120827314] [2022-04-28 14:22:33,984 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:22:33,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:33,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:33,984 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:22:33,985 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:22:34,199 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 14:22:34,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:34,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 14:22:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:34,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:34,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {4790#true} call ULTIMATE.init(); {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {4790#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); {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4790#true} {4790#true} #60#return; {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {4790#true} call #t~ret5 := main(); {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {4790#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; {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L272 TraceCheckUtils]: 6: Hoare triple {4790#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4790#true} {4790#true} #52#return; {4790#true} is VALID [2022-04-28 14:22:34,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {4790#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:34,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {4828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:34,708 INFO L272 TraceCheckUtils]: 13: Hoare triple {4828#(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)); {4790#true} is VALID [2022-04-28 14:22:34,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,709 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4790#true} {4828#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:34,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {4828#(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; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:34,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:34,709 INFO L272 TraceCheckUtils]: 20: Hoare triple {4850#(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)); {4790#true} is VALID [2022-04-28 14:22:34,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,710 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4790#true} {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:34,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {4850#(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; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:34,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {4872#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:34,711 INFO L272 TraceCheckUtils]: 27: Hoare triple {4872#(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)); {4790#true} is VALID [2022-04-28 14:22:34,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,711 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4790#true} {4872#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:34,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {4872#(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; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 14:22:34,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 14:22:34,712 INFO L272 TraceCheckUtils]: 34: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~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)); {4790#true} is VALID [2022-04-28 14:22:34,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,714 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4790#true} {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 14:22:34,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< main_~c~0 (+ main_~k~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; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:34,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:34,715 INFO L272 TraceCheckUtils]: 41: Hoare triple {4916#(and (= main_~c~0 4) (< 2 main_~k~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)); {4790#true} is VALID [2022-04-28 14:22:34,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,715 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4790#true} {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #54#return; {4916#(and (= main_~c~0 4) (< 2 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:34,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {4916#(and (= main_~c~0 4) (< 2 main_~k~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; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} assume !false; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,716 INFO L272 TraceCheckUtils]: 48: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 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)); {4790#true} is VALID [2022-04-28 14:22:34,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,717 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4790#true} {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} #54#return; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:34,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:34,718 INFO L272 TraceCheckUtils]: 55: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~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)); {4790#true} is VALID [2022-04-28 14:22:34,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,735 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4790#true} {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:34,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (< 2 main_~k~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; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} assume !false; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,736 INFO L272 TraceCheckUtils]: 62: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 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)); {4790#true} is VALID [2022-04-28 14:22:34,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,737 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4790#true} {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} #54#return; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} assume !false; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,738 INFO L272 TraceCheckUtils]: 69: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 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)); {4790#true} is VALID [2022-04-28 14:22:34,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,738 INFO L290 TraceCheckUtils]: 72: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,739 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4790#true} {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} #54#return; {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:34,739 INFO L290 TraceCheckUtils]: 74: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8) (< 2 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:22:34,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:22:34,740 INFO L272 TraceCheckUtils]: 76: Hoare triple {5026#(and (= main_~y~0 9) (< 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)); {4790#true} is VALID [2022-04-28 14:22:34,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-28 14:22:34,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-28 14:22:34,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-28 14:22:34,740 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4790#true} {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:22:34,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5048#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 14:22:34,742 INFO L272 TraceCheckUtils]: 82: Hoare triple {5048#(and (= main_~y~0 9) (<= 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)); {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:34,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5056#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:34,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {5056#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4791#false} is VALID [2022-04-28 14:22:34,742 INFO L290 TraceCheckUtils]: 85: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-04-28 14:22:34,743 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:22:34,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:35,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:35,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246600767] [2022-04-28 14:22:35,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:35,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120827314] [2022-04-28 14:22:35,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120827314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:35,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:35,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 14:22:35,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:35,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1094068795] [2022-04-28 14:22:35,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1094068795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:35,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:35,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:22:35,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583818030] [2022-04-28 14:22:35,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:35,395 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:22:35,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:35,396 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:22:35,435 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:22:35,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:22:35,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:22:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:22:35,436 INFO L87 Difference]: Start difference. First operand 55 states and 63 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:22:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:36,355 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-28 14:22:36,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 14:22:36,355 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:22:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:36,355 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:22:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 14:22:36,356 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:22:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 14:22:36,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-28 14:22:36,407 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:22:36,408 INFO L225 Difference]: With dead ends: 63 [2022-04-28 14:22:36,408 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 14:22:36,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 14:22:36,408 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:36,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 389 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:22:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 14:22:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 14:22:36,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:36,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:22:36,447 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:22:36,447 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:22:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:36,448 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 14:22:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 14:22:36,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:36,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:36,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-28 14:22:36,449 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-28 14:22:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:36,454 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 14:22:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 14:22:36,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:36,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:36,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:36,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:22:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 14:22:36,455 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-28 14:22:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:36,455 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 14:22:36,455 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:22:36,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 14:22:36,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 14:22:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 14:22:36,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:36,530 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:22:36,537 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:22:36,734 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:22:36,734 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 19 times [2022-04-28 14:22:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:36,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124860380] [2022-04-28 14:22:36,804 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:36,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 20 times [2022-04-28 14:22:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:36,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114689860] [2022-04-28 14:22:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:36,825 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:36,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871706915] [2022-04-28 14:22:36,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:36,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:36,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:36,826 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:22:36,826 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:22:37,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:37,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:37,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 14:22:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:37,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:37,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {5598#true} call ULTIMATE.init(); {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {5598#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); {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5598#true} {5598#true} #60#return; {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {5598#true} call #t~ret5 := main(); {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {5598#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; {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {5598#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5598#true} {5598#true} #52#return; {5598#true} is VALID [2022-04-28 14:22:37,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {5598#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:37,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {5636#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:37,893 INFO L272 TraceCheckUtils]: 13: Hoare triple {5636#(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)); {5598#true} is VALID [2022-04-28 14:22:37,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,894 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5598#true} {5636#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:37,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {5636#(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; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:37,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:37,895 INFO L272 TraceCheckUtils]: 20: Hoare triple {5658#(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)); {5598#true} is VALID [2022-04-28 14:22:37,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,895 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5598#true} {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {5658#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:37,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {5658#(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; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:37,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {5680#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:37,896 INFO L272 TraceCheckUtils]: 27: Hoare triple {5680#(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)); {5598#true} is VALID [2022-04-28 14:22:37,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,897 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5598#true} {5680#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {5680#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:37,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {5680#(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; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:22:37,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:22:37,898 INFO L272 TraceCheckUtils]: 34: Hoare triple {5702#(and (= 2 (+ (- 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)); {5598#true} is VALID [2022-04-28 14:22:37,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,899 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5598#true} {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {5702#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:22:37,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {5702#(and (= 2 (+ (- 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; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:37,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} assume !false; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:37,919 INFO L272 TraceCheckUtils]: 41: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~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)); {5598#true} is VALID [2022-04-28 14:22:37,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,919 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5598#true} {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} #54#return; {5724#(and (= 2 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:22:37,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {5724#(and (= 2 (+ (- 2) main_~c~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; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:37,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:37,920 INFO L272 TraceCheckUtils]: 48: Hoare triple {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 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)); {5598#true} is VALID [2022-04-28 14:22:37,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,923 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5598#true} {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:37,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {5746#(and (= 2 (+ main_~c~0 (- 3))) (= 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; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:37,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:37,924 INFO L272 TraceCheckUtils]: 55: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 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)); {5598#true} is VALID [2022-04-28 14:22:37,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,924 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5598#true} {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} #54#return; {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:37,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {5768#(and (= 2 (+ main_~c~0 (- 4))) (= 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; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 14:22:37,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 14:22:37,925 INFO L272 TraceCheckUtils]: 62: Hoare triple {5790#(and (= (+ (- 2) main_~y~0) 5) (= 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)); {5598#true} is VALID [2022-04-28 14:22:37,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,926 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5598#true} {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {5790#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-28 14:22:37,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {5790#(and (= (+ (- 2) main_~y~0) 5) (= 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; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 14:22:37,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !false; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 14:22:37,927 INFO L272 TraceCheckUtils]: 69: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= 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)); {5598#true} is VALID [2022-04-28 14:22:37,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,927 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5598#true} {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #54#return; {5812#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 14:22:37,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {5812#(and (= (+ main_~y~0 (- 3)) 5) (= 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; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-28 14:22:37,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} assume !false; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-28 14:22:37,928 INFO L272 TraceCheckUtils]: 76: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 4))) (= 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)); {5598#true} is VALID [2022-04-28 14:22:37,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,929 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5598#true} {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} #54#return; {5834#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-28 14:22:37,930 INFO L290 TraceCheckUtils]: 81: Hoare triple {5834#(and (= 5 (+ main_~y~0 (- 4))) (= 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; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:22:37,930 INFO L290 TraceCheckUtils]: 82: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:22:37,930 INFO L272 TraceCheckUtils]: 83: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~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)); {5598#true} is VALID [2022-04-28 14:22:37,930 INFO L290 TraceCheckUtils]: 84: Hoare triple {5598#true} ~cond := #in~cond; {5598#true} is VALID [2022-04-28 14:22:37,930 INFO L290 TraceCheckUtils]: 85: Hoare triple {5598#true} assume !(0 == ~cond); {5598#true} is VALID [2022-04-28 14:22:37,931 INFO L290 TraceCheckUtils]: 86: Hoare triple {5598#true} assume true; {5598#true} is VALID [2022-04-28 14:22:37,931 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5598#true} {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #54#return; {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:22:37,932 INFO L290 TraceCheckUtils]: 88: Hoare triple {5856#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5878#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:22:37,932 INFO L272 TraceCheckUtils]: 89: Hoare triple {5878#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:37,932 INFO L290 TraceCheckUtils]: 90: Hoare triple {5882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:37,933 INFO L290 TraceCheckUtils]: 91: Hoare triple {5886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5599#false} is VALID [2022-04-28 14:22:37,933 INFO L290 TraceCheckUtils]: 92: Hoare triple {5599#false} assume !false; {5599#false} is VALID [2022-04-28 14:22:37,933 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:22:37,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:38,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114689860] [2022-04-28 14:22:38,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:38,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871706915] [2022-04-28 14:22:38,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871706915] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:38,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:38,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 14:22:38,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:38,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124860380] [2022-04-28 14:22:38,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124860380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:38,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:38,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 14:22:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472686507] [2022-04-28 14:22:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-28 14:22:38,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:38,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:22:38,194 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:22:38,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 14:22:38,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 14:22:38,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:22:38,194 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:22:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:39,253 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-28 14:22:39,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:22:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-28 14:22:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:22:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 14:22:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:22:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 14:22:39,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-28 14:22:39,314 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:22:39,315 INFO L225 Difference]: With dead ends: 66 [2022-04-28 14:22:39,315 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 14:22:39,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:22:39,316 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:39,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:22:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 14:22:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 14:22:39,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:39,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:22:39,358 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:22:39,358 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:22:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:39,359 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 14:22:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 14:22:39,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:39,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:39,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-28 14:22:39,360 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-28 14:22:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:39,361 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 14:22:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 14:22:39,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:39,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:39,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:39,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:22:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-28 14:22:39,362 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-28 14:22:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:39,363 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-28 14:22:39,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 14:22:39,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 71 transitions. [2022-04-28 14:22:39,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-28 14:22:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 14:22:39,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:39,448 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:39,453 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:39,649 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:39,649 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 21 times [2022-04-28 14:22:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:39,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493454808] [2022-04-28 14:22:39,713 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:39,713 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 22 times [2022-04-28 14:22:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:39,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070985877] [2022-04-28 14:22:39,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:39,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:39,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845684096] [2022-04-28 14:22:39,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:22:39,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:39,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:39,731 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:39,732 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:40,758 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:22:40,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:40,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 14:22:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:40,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:41,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {6314#true} call ULTIMATE.init(); {6314#true} is VALID [2022-04-28 14:22:41,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {6314#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); {6314#true} is VALID [2022-04-28 14:22:41,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6314#true} {6314#true} #60#return; {6314#true} is VALID [2022-04-28 14:22:41,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {6314#true} call #t~ret5 := main(); {6314#true} is VALID [2022-04-28 14:22:41,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {6314#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; {6314#true} is VALID [2022-04-28 14:22:41,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {6314#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {6314#true} is VALID [2022-04-28 14:22:41,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6314#true} {6314#true} #52#return; {6314#true} is VALID [2022-04-28 14:22:41,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {6314#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:41,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {6352#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:41,263 INFO L272 TraceCheckUtils]: 13: Hoare triple {6352#(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)); {6314#true} is VALID [2022-04-28 14:22:41,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,266 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6314#true} {6352#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6352#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:41,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {6352#(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; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:41,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:41,267 INFO L272 TraceCheckUtils]: 20: Hoare triple {6374#(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)); {6314#true} is VALID [2022-04-28 14:22:41,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,268 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6314#true} {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {6374#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:41,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {6374#(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; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:41,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:41,268 INFO L272 TraceCheckUtils]: 27: Hoare triple {6396#(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)); {6314#true} is VALID [2022-04-28 14:22:41,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,269 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6314#true} {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {6396#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:41,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {6396#(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; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 14:22:41,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 14:22:41,270 INFO L272 TraceCheckUtils]: 34: Hoare triple {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~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)); {6314#true} is VALID [2022-04-28 14:22:41,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,270 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6314#true} {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 14:22:41,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {6418#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~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; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:41,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {6440#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:41,271 INFO L272 TraceCheckUtils]: 41: Hoare triple {6440#(and (= main_~y~0 4) (= 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)); {6314#true} is VALID [2022-04-28 14:22:41,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,272 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6314#true} {6440#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {6440#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:41,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {6440#(and (= main_~y~0 4) (= 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; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:41,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:41,273 INFO L272 TraceCheckUtils]: 48: Hoare triple {6462#(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)); {6314#true} is VALID [2022-04-28 14:22:41,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,273 INFO L290 TraceCheckUtils]: 51: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,273 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6314#true} {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {6462#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:41,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {6462#(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; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:22:41,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {6484#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:22:41,274 INFO L272 TraceCheckUtils]: 55: Hoare triple {6484#(and (= main_~y~0 6) (= 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)); {6314#true} is VALID [2022-04-28 14:22:41,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,275 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6314#true} {6484#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {6484#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:22:41,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {6484#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:22:41,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:22:41,275 INFO L272 TraceCheckUtils]: 62: Hoare triple {6506#(and (= 7 main_~y~0) (= (+ (- 1) 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)); {6314#true} is VALID [2022-04-28 14:22:41,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,276 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6314#true} {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:22:41,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {6506#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 14:22:41,277 INFO L290 TraceCheckUtils]: 68: Hoare triple {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 14:22:41,277 INFO L272 TraceCheckUtils]: 69: Hoare triple {6528#(and (= 7 (+ (- 1) main_~y~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)); {6314#true} is VALID [2022-04-28 14:22:41,277 INFO L290 TraceCheckUtils]: 70: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,277 INFO L290 TraceCheckUtils]: 71: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,277 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6314#true} {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #54#return; {6528#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 14:22:41,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {6528#(and (= 7 (+ (- 1) main_~y~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; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 14:22:41,278 INFO L290 TraceCheckUtils]: 75: Hoare triple {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 14:22:41,278 INFO L272 TraceCheckUtils]: 76: Hoare triple {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) 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)); {6314#true} is VALID [2022-04-28 14:22:41,278 INFO L290 TraceCheckUtils]: 77: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,278 INFO L290 TraceCheckUtils]: 78: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,278 INFO L290 TraceCheckUtils]: 79: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,279 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6314#true} {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 14:22:41,279 INFO L290 TraceCheckUtils]: 81: Hoare triple {6550#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) 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; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 14:22:41,280 INFO L290 TraceCheckUtils]: 82: Hoare triple {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 14:22:41,280 INFO L272 TraceCheckUtils]: 83: Hoare triple {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} 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)); {6314#true} is VALID [2022-04-28 14:22:41,280 INFO L290 TraceCheckUtils]: 84: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,280 INFO L290 TraceCheckUtils]: 85: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,280 INFO L290 TraceCheckUtils]: 86: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,281 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6314#true} {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-28 14:22:41,281 INFO L290 TraceCheckUtils]: 88: Hoare triple {6572#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 14:22:41,281 INFO L290 TraceCheckUtils]: 89: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 14:22:41,282 INFO L272 TraceCheckUtils]: 90: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} 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)); {6314#true} is VALID [2022-04-28 14:22:41,282 INFO L290 TraceCheckUtils]: 91: Hoare triple {6314#true} ~cond := #in~cond; {6314#true} is VALID [2022-04-28 14:22:41,282 INFO L290 TraceCheckUtils]: 92: Hoare triple {6314#true} assume !(0 == ~cond); {6314#true} is VALID [2022-04-28 14:22:41,282 INFO L290 TraceCheckUtils]: 93: Hoare triple {6314#true} assume true; {6314#true} is VALID [2022-04-28 14:22:41,282 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6314#true} {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #54#return; {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 14:22:41,283 INFO L290 TraceCheckUtils]: 95: Hoare triple {6594#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {6616#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-28 14:22:41,283 INFO L272 TraceCheckUtils]: 96: Hoare triple {6616#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:41,283 INFO L290 TraceCheckUtils]: 97: Hoare triple {6620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:41,284 INFO L290 TraceCheckUtils]: 98: Hoare triple {6624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6315#false} is VALID [2022-04-28 14:22:41,284 INFO L290 TraceCheckUtils]: 99: Hoare triple {6315#false} assume !false; {6315#false} is VALID [2022-04-28 14:22:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 14:22:41,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:41,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070985877] [2022-04-28 14:22:41,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:41,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845684096] [2022-04-28 14:22:41,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845684096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:41,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:41,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 14:22:41,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:41,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493454808] [2022-04-28 14:22:41,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493454808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:41,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:41,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 14:22:41,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575164168] [2022-04-28 14:22:41,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:41,596 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-28 14:22:41,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:41,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:41,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:41,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 14:22:41,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:41,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 14:22:41,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:22:41,644 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:42,823 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 14:22:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 14:22:42,823 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-28 14:22:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 14:22:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 14:22:42,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-28 14:22:42,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:42,878 INFO L225 Difference]: With dead ends: 69 [2022-04-28 14:22:42,878 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 14:22:42,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-28 14:22:42,879 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:42,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 485 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:22:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 14:22:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 14:22:42,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:42,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:22:42,922 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:22:42,922 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:22:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:42,929 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 14:22:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 14:22:42,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:42,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:42,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-28 14:22:42,930 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-28 14:22:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:42,931 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 14:22:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 14:22:42,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:42,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:42,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:42,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:22:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-28 14:22:42,933 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-28 14:22:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:42,933 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-28 14:22:42,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 14:22:42,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 75 transitions. [2022-04-28 14:22:43,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-28 14:22:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 14:22:43,034 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:43,034 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:43,042 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:43,234 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:43,235 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 23 times [2022-04-28 14:22:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1560634236] [2022-04-28 14:22:43,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:43,306 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 24 times [2022-04-28 14:22:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:43,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558896440] [2022-04-28 14:22:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:43,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:43,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987534789] [2022-04-28 14:22:43,319 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:22:43,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:43,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:43,320 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:43,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 14:22:43,531 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 14:22:43,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:43,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 14:22:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:43,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:44,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {7070#true} call ULTIMATE.init(); {7070#true} is VALID [2022-04-28 14:22:44,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {7070#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); {7070#true} is VALID [2022-04-28 14:22:44,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7070#true} {7070#true} #60#return; {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {7070#true} call #t~ret5 := main(); {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {7070#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; {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {7070#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7070#true} {7070#true} #52#return; {7070#true} is VALID [2022-04-28 14:22:44,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {7070#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:44,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {7108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:44,161 INFO L272 TraceCheckUtils]: 13: Hoare triple {7108#(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)); {7070#true} is VALID [2022-04-28 14:22:44,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,161 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7070#true} {7108#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:44,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {7108#(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; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:44,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:44,162 INFO L272 TraceCheckUtils]: 20: Hoare triple {7130#(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)); {7070#true} is VALID [2022-04-28 14:22:44,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,163 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7070#true} {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7130#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:44,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {7130#(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; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 14:22:44,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 14:22:44,164 INFO L272 TraceCheckUtils]: 27: Hoare triple {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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)); {7070#true} is VALID [2022-04-28 14:22:44,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,167 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7070#true} {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 14:22:44,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {7152#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 14:22:44,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 14:22:44,168 INFO L272 TraceCheckUtils]: 34: Hoare triple {7174#(and (= (+ main_~y~0 (- 3)) 0) (= 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)); {7070#true} is VALID [2022-04-28 14:22:44,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,169 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7070#true} {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 14:22:44,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {7174#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:44,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:44,170 INFO L272 TraceCheckUtils]: 41: Hoare triple {7196#(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)); {7070#true} is VALID [2022-04-28 14:22:44,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,171 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7070#true} {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {7196#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:44,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {7196#(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; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:44,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:44,172 INFO L272 TraceCheckUtils]: 48: Hoare triple {7218#(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)); {7070#true} is VALID [2022-04-28 14:22:44,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,172 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7070#true} {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {7218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:44,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {7218#(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; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:44,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:44,173 INFO L272 TraceCheckUtils]: 55: Hoare triple {7240#(and (= main_~c~0 6) (< 5 main_~k~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)); {7070#true} is VALID [2022-04-28 14:22:44,173 INFO L290 TraceCheckUtils]: 56: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,173 INFO L290 TraceCheckUtils]: 57: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,174 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7070#true} {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {7240#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:44,174 INFO L290 TraceCheckUtils]: 60: Hoare triple {7240#(and (= main_~c~0 6) (< 5 main_~k~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; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-28 14:22:44,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} assume !false; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-28 14:22:44,175 INFO L272 TraceCheckUtils]: 62: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 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)); {7070#true} is VALID [2022-04-28 14:22:44,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,175 INFO L290 TraceCheckUtils]: 64: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,176 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7070#true} {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} #54#return; {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-28 14:22:44,176 INFO L290 TraceCheckUtils]: 67: Hoare triple {7262#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< 5 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; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-28 14:22:44,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} assume !false; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-28 14:22:44,177 INFO L272 TraceCheckUtils]: 69: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 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)); {7070#true} is VALID [2022-04-28 14:22:44,177 INFO L290 TraceCheckUtils]: 70: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,177 INFO L290 TraceCheckUtils]: 71: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,177 INFO L290 TraceCheckUtils]: 72: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,177 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7070#true} {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} #54#return; {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 main_~k~0))} is VALID [2022-04-28 14:22:44,178 INFO L290 TraceCheckUtils]: 74: Hoare triple {7284#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 5 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; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 14:22:44,178 INFO L290 TraceCheckUtils]: 75: Hoare triple {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !false; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 14:22:44,178 INFO L272 TraceCheckUtils]: 76: Hoare triple {7306#(and (= main_~y~0 9) (< 5 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)); {7070#true} is VALID [2022-04-28 14:22:44,178 INFO L290 TraceCheckUtils]: 77: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,178 INFO L290 TraceCheckUtils]: 78: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,178 INFO L290 TraceCheckUtils]: 79: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,179 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7070#true} {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} #54#return; {7306#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 14:22:44,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {7306#(and (= main_~y~0 9) (< 5 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; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-28 14:22:44,180 INFO L290 TraceCheckUtils]: 82: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !false; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-28 14:22:44,180 INFO L272 TraceCheckUtils]: 83: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} 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)); {7070#true} is VALID [2022-04-28 14:22:44,180 INFO L290 TraceCheckUtils]: 84: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,180 INFO L290 TraceCheckUtils]: 85: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,180 INFO L290 TraceCheckUtils]: 86: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,180 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7070#true} {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} #54#return; {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-28 14:22:44,181 INFO L290 TraceCheckUtils]: 88: Hoare triple {7328#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 14:22:44,181 INFO L290 TraceCheckUtils]: 89: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} assume !false; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 14:22:44,181 INFO L272 TraceCheckUtils]: 90: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} 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)); {7070#true} is VALID [2022-04-28 14:22:44,181 INFO L290 TraceCheckUtils]: 91: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,181 INFO L290 TraceCheckUtils]: 92: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,181 INFO L290 TraceCheckUtils]: 93: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,182 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7070#true} {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} #54#return; {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-28 14:22:44,182 INFO L290 TraceCheckUtils]: 95: Hoare triple {7350#(and (= main_~c~0 11) (< 5 main_~k~0) (= main_~y~0 11))} 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; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 14:22:44,183 INFO L290 TraceCheckUtils]: 96: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !false; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 14:22:44,183 INFO L272 TraceCheckUtils]: 97: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 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)); {7070#true} is VALID [2022-04-28 14:22:44,183 INFO L290 TraceCheckUtils]: 98: Hoare triple {7070#true} ~cond := #in~cond; {7070#true} is VALID [2022-04-28 14:22:44,183 INFO L290 TraceCheckUtils]: 99: Hoare triple {7070#true} assume !(0 == ~cond); {7070#true} is VALID [2022-04-28 14:22:44,183 INFO L290 TraceCheckUtils]: 100: Hoare triple {7070#true} assume true; {7070#true} is VALID [2022-04-28 14:22:44,183 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7070#true} {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #54#return; {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 14:22:44,184 INFO L290 TraceCheckUtils]: 102: Hoare triple {7372#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {7394#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 14:22:44,185 INFO L272 TraceCheckUtils]: 103: Hoare triple {7394#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:44,185 INFO L290 TraceCheckUtils]: 104: Hoare triple {7398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:44,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {7402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7071#false} is VALID [2022-04-28 14:22:44,185 INFO L290 TraceCheckUtils]: 106: Hoare triple {7071#false} assume !false; {7071#false} is VALID [2022-04-28 14:22:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 14:22:44,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:45,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:45,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558896440] [2022-04-28 14:22:45,224 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:45,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987534789] [2022-04-28 14:22:45,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987534789] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:45,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:45,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 14:22:45,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:45,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1560634236] [2022-04-28 14:22:45,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1560634236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:45,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:45,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 14:22:45,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203508255] [2022-04-28 14:22:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-28 14:22:45,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:45,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 14:22:45,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:45,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 14:22:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 14:22:45,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:22:45,274 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 14:22:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:46,759 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-28 14:22:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:22:46,759 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-28 14:22:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 14:22:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-28 14:22:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 14:22:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-28 14:22:46,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-28 14:22:46,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:46,822 INFO L225 Difference]: With dead ends: 72 [2022-04-28 14:22:46,822 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 14:22:46,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-04-28 14:22:46,823 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:46,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 527 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 14:22:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 14:22:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 14:22:46,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:46,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:22:46,875 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:22:46,875 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:22:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:46,876 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 14:22:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 14:22:46,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:46,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:46,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 14:22:46,877 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 14:22:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:46,878 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 14:22:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 14:22:46,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:46,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:46,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:46,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:22:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-28 14:22:46,897 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-28 14:22:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:46,898 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-28 14:22:46,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 14:22:46,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2022-04-28 14:22:46,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 14:22:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 14:22:47,000 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:47,000 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:47,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:47,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:47,207 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:47,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 25 times [2022-04-28 14:22:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:47,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989393242] [2022-04-28 14:22:47,274 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:47,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 26 times [2022-04-28 14:22:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:47,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116936427] [2022-04-28 14:22:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:47,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:47,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1687375632] [2022-04-28 14:22:47,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:47,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:47,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:47,285 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:47,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 14:22:48,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:48,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:48,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 14:22:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:48,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:48,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {7998#true} call ULTIMATE.init(); {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {7998#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); {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7998#true} {7998#true} #60#return; {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {7998#true} call #t~ret5 := main(); {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {7998#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; {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {7998#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7998#true} {7998#true} #52#return; {7998#true} is VALID [2022-04-28 14:22:48,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {7998#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:48,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {8036#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:48,634 INFO L272 TraceCheckUtils]: 13: Hoare triple {8036#(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)); {7998#true} is VALID [2022-04-28 14:22:48,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,635 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7998#true} {8036#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:48,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#(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; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:48,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:48,636 INFO L272 TraceCheckUtils]: 20: Hoare triple {8058#(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)); {7998#true} is VALID [2022-04-28 14:22:48,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,636 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7998#true} {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {8058#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:48,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {8058#(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; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:48,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {8080#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:48,637 INFO L272 TraceCheckUtils]: 27: Hoare triple {8080#(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)); {7998#true} is VALID [2022-04-28 14:22:48,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,638 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7998#true} {8080#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:48,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {8080#(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; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:48,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {8102#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:48,638 INFO L272 TraceCheckUtils]: 34: Hoare triple {8102#(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)); {7998#true} is VALID [2022-04-28 14:22:48,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,639 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7998#true} {8102#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {8102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:48,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {8102#(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; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:48,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {8124#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:48,640 INFO L272 TraceCheckUtils]: 41: Hoare triple {8124#(and (= main_~y~0 4) (= 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)); {7998#true} is VALID [2022-04-28 14:22:48,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,640 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7998#true} {8124#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8124#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:48,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {8124#(and (= main_~y~0 4) (= 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; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:22:48,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:22:48,641 INFO L272 TraceCheckUtils]: 48: Hoare triple {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 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)); {7998#true} is VALID [2022-04-28 14:22:48,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,642 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7998#true} {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #54#return; {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:22:48,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {8146#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 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; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,642 INFO L272 TraceCheckUtils]: 55: Hoare triple {8168#(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)); {7998#true} is VALID [2022-04-28 14:22:48,643 INFO L290 TraceCheckUtils]: 56: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,643 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7998#true} {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {8168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {8168#(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; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 14:22:48,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 14:22:48,644 INFO L272 TraceCheckUtils]: 62: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~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)); {7998#true} is VALID [2022-04-28 14:22:48,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,645 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7998#true} {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #54#return; {8190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 14:22:48,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {8190#(and (= 7 main_~y~0) (= (+ main_~c~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; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:22:48,645 INFO L290 TraceCheckUtils]: 68: Hoare triple {8212#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:22:48,645 INFO L272 TraceCheckUtils]: 69: Hoare triple {8212#(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)); {7998#true} is VALID [2022-04-28 14:22:48,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,645 INFO L290 TraceCheckUtils]: 71: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,646 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7998#true} {8212#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {8212#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:22:48,646 INFO L290 TraceCheckUtils]: 74: Hoare triple {8212#(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; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:22:48,647 INFO L290 TraceCheckUtils]: 75: Hoare triple {8234#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:22:48,647 INFO L272 TraceCheckUtils]: 76: Hoare triple {8234#(and (= main_~y~0 9) (= 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)); {7998#true} is VALID [2022-04-28 14:22:48,647 INFO L290 TraceCheckUtils]: 77: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,647 INFO L290 TraceCheckUtils]: 78: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,647 INFO L290 TraceCheckUtils]: 79: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,647 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7998#true} {8234#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {8234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:22:48,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {8234#(and (= main_~y~0 9) (= 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; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:22:48,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:22:48,648 INFO L272 TraceCheckUtils]: 83: Hoare triple {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) 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)); {7998#true} is VALID [2022-04-28 14:22:48,648 INFO L290 TraceCheckUtils]: 84: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,648 INFO L290 TraceCheckUtils]: 85: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,648 INFO L290 TraceCheckUtils]: 86: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,649 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7998#true} {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:22:48,649 INFO L290 TraceCheckUtils]: 88: Hoare triple {8256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) 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; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,649 INFO L290 TraceCheckUtils]: 89: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} assume !false; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,649 INFO L272 TraceCheckUtils]: 90: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 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)); {7998#true} is VALID [2022-04-28 14:22:48,650 INFO L290 TraceCheckUtils]: 91: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,650 INFO L290 TraceCheckUtils]: 92: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,650 INFO L290 TraceCheckUtils]: 93: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,651 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7998#true} {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} #54#return; {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,652 INFO L290 TraceCheckUtils]: 95: Hoare triple {8278#(and (= (+ (- 2) main_~y~0) 9) (= 9 (+ (- 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; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 14:22:48,652 INFO L290 TraceCheckUtils]: 96: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} assume !false; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 14:22:48,652 INFO L272 TraceCheckUtils]: 97: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ 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)); {7998#true} is VALID [2022-04-28 14:22:48,652 INFO L290 TraceCheckUtils]: 98: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,652 INFO L290 TraceCheckUtils]: 99: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,652 INFO L290 TraceCheckUtils]: 100: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,653 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7998#true} {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} #54#return; {8300#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 14:22:48,653 INFO L290 TraceCheckUtils]: 102: Hoare triple {8300#(and (= main_~y~0 12) (= 9 (+ 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; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 14:22:48,654 INFO L290 TraceCheckUtils]: 103: Hoare triple {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !false; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 14:22:48,654 INFO L272 TraceCheckUtils]: 104: Hoare triple {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} 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)); {7998#true} is VALID [2022-04-28 14:22:48,654 INFO L290 TraceCheckUtils]: 105: Hoare triple {7998#true} ~cond := #in~cond; {7998#true} is VALID [2022-04-28 14:22:48,654 INFO L290 TraceCheckUtils]: 106: Hoare triple {7998#true} assume !(0 == ~cond); {7998#true} is VALID [2022-04-28 14:22:48,654 INFO L290 TraceCheckUtils]: 107: Hoare triple {7998#true} assume true; {7998#true} is VALID [2022-04-28 14:22:48,655 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7998#true} {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #54#return; {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 14:22:48,655 INFO L290 TraceCheckUtils]: 109: Hoare triple {8322#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {8344#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-28 14:22:48,656 INFO L272 TraceCheckUtils]: 110: Hoare triple {8344#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:48,656 INFO L290 TraceCheckUtils]: 111: Hoare triple {8348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:48,656 INFO L290 TraceCheckUtils]: 112: Hoare triple {8352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7999#false} is VALID [2022-04-28 14:22:48,657 INFO L290 TraceCheckUtils]: 113: Hoare triple {7999#false} assume !false; {7999#false} is VALID [2022-04-28 14:22:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-28 14:22:48,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:48,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116936427] [2022-04-28 14:22:48,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:48,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687375632] [2022-04-28 14:22:48,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687375632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:48,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:48,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 14:22:48,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:48,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989393242] [2022-04-28 14:22:48,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989393242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:48,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:48,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 14:22:48,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456676287] [2022-04-28 14:22:48,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-28 14:22:48,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:48,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 14:22:48,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:48,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 14:22:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 14:22:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 14:22:48,953 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 14:22:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:50,548 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-28 14:22:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 14:22:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-28 14:22:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 14:22:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 14:22:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 14:22:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 14:22:50,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 84 transitions. [2022-04-28 14:22:50,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:50,609 INFO L225 Difference]: With dead ends: 75 [2022-04-28 14:22:50,609 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 14:22:50,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:22:50,610 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:50,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 583 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 14:22:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 14:22:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 14:22:50,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:50,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:22:50,664 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:22:50,664 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:22:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:50,665 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 14:22:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 14:22:50,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:50,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:50,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-28 14:22:50,666 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-28 14:22:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:50,667 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 14:22:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 14:22:50,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:50,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:50,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:50,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:22:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-28 14:22:50,669 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-28 14:22:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:50,669 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-28 14:22:50,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 14:22:50,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 83 transitions. [2022-04-28 14:22:50,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 14:22:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 14:22:50,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:50,778 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:50,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:50,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 14:22:50,983 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 27 times [2022-04-28 14:22:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:50,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970547387] [2022-04-28 14:22:51,060 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:51,060 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 28 times [2022-04-28 14:22:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:51,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618168961] [2022-04-28 14:22:51,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:51,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:51,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878243516] [2022-04-28 14:22:51,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:22:51,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:51,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:51,084 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:51,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 14:22:51,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:22:51,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:51,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 14:22:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:52,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:52,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {8834#true} call ULTIMATE.init(); {8834#true} is VALID [2022-04-28 14:22:52,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {8834#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); {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8834#true} {8834#true} #60#return; {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {8834#true} call #t~ret5 := main(); {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {8834#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; {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L272 TraceCheckUtils]: 6: Hoare triple {8834#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8834#true} {8834#true} #52#return; {8834#true} is VALID [2022-04-28 14:22:52,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {8834#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:52,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {8872#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:52,602 INFO L272 TraceCheckUtils]: 13: Hoare triple {8872#(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)); {8834#true} is VALID [2022-04-28 14:22:52,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,603 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8834#true} {8872#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8872#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:52,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {8872#(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; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:52,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:52,603 INFO L272 TraceCheckUtils]: 20: Hoare triple {8894#(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)); {8834#true} is VALID [2022-04-28 14:22:52,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,604 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8834#true} {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {8894#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:52,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {8894#(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; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:52,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:52,605 INFO L272 TraceCheckUtils]: 27: Hoare triple {8916#(and (= (+ (- 2) main_~y~0) 0) (= 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)); {8834#true} is VALID [2022-04-28 14:22:52,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,606 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8834#true} {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {8916#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:52,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {8916#(and (= (+ (- 2) main_~y~0) 0) (= 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; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:22:52,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:22:52,606 INFO L272 TraceCheckUtils]: 34: Hoare triple {8938#(and (= (+ main_~c~0 (- 3)) 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)); {8834#true} is VALID [2022-04-28 14:22:52,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,607 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8834#true} {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {8938#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:22:52,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {8938#(and (= (+ main_~c~0 (- 3)) 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; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:52,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {8960#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:52,608 INFO L272 TraceCheckUtils]: 41: Hoare triple {8960#(and (= main_~y~0 4) (= 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)); {8834#true} is VALID [2022-04-28 14:22:52,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,608 INFO L290 TraceCheckUtils]: 44: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,609 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8834#true} {8960#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8960#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:22:52,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {8960#(and (= main_~y~0 4) (= 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; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:52,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:52,610 INFO L272 TraceCheckUtils]: 48: Hoare triple {8982#(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)); {8834#true} is VALID [2022-04-28 14:22:52,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,610 INFO L290 TraceCheckUtils]: 51: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,610 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8834#true} {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {8982#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:22:52,611 INFO L290 TraceCheckUtils]: 53: Hoare triple {8982#(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; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,611 INFO L272 TraceCheckUtils]: 55: Hoare triple {9004#(and (= main_~c~0 6) (= 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)); {8834#true} is VALID [2022-04-28 14:22:52,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,612 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8834#true} {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {9004#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,613 INFO L290 TraceCheckUtils]: 60: Hoare triple {9004#(and (= main_~c~0 6) (= 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; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:22:52,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:22:52,613 INFO L272 TraceCheckUtils]: 62: Hoare triple {9026#(and (= 7 main_~y~0) (= (+ (- 1) 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)); {8834#true} is VALID [2022-04-28 14:22:52,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,613 INFO L290 TraceCheckUtils]: 64: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,614 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8834#true} {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:22:52,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {9026#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,615 INFO L290 TraceCheckUtils]: 68: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,615 INFO L272 TraceCheckUtils]: 69: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 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)); {8834#true} is VALID [2022-04-28 14:22:52,615 INFO L290 TraceCheckUtils]: 70: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,615 INFO L290 TraceCheckUtils]: 71: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,615 INFO L290 TraceCheckUtils]: 72: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,615 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8834#true} {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,616 INFO L290 TraceCheckUtils]: 74: Hoare triple {9048#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 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; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 14:22:52,616 INFO L290 TraceCheckUtils]: 75: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !false; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 14:22:52,616 INFO L272 TraceCheckUtils]: 76: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~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)); {8834#true} is VALID [2022-04-28 14:22:52,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,616 INFO L290 TraceCheckUtils]: 79: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,617 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8834#true} {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #54#return; {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 14:22:52,617 INFO L290 TraceCheckUtils]: 81: Hoare triple {9070#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~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; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:22:52,618 INFO L290 TraceCheckUtils]: 82: Hoare triple {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:22:52,618 INFO L272 TraceCheckUtils]: 83: Hoare triple {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} 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)); {8834#true} is VALID [2022-04-28 14:22:52,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,618 INFO L290 TraceCheckUtils]: 85: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,618 INFO L290 TraceCheckUtils]: 86: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,619 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8834#true} {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:22:52,619 INFO L290 TraceCheckUtils]: 88: Hoare triple {9092#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 14:22:52,619 INFO L290 TraceCheckUtils]: 89: Hoare triple {9114#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 14:22:52,619 INFO L272 TraceCheckUtils]: 90: Hoare triple {9114#(and (= main_~c~0 11) (= main_~y~0 11))} 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)); {8834#true} is VALID [2022-04-28 14:22:52,619 INFO L290 TraceCheckUtils]: 91: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,620 INFO L290 TraceCheckUtils]: 92: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,620 INFO L290 TraceCheckUtils]: 93: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,620 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8834#true} {9114#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {9114#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 14:22:52,621 INFO L290 TraceCheckUtils]: 95: Hoare triple {9114#(and (= main_~c~0 11) (= main_~y~0 11))} 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; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 14:22:52,621 INFO L290 TraceCheckUtils]: 96: Hoare triple {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 14:22:52,621 INFO L272 TraceCheckUtils]: 97: Hoare triple {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} 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)); {8834#true} is VALID [2022-04-28 14:22:52,621 INFO L290 TraceCheckUtils]: 98: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,621 INFO L290 TraceCheckUtils]: 99: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,621 INFO L290 TraceCheckUtils]: 100: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,622 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8834#true} {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 14:22:52,622 INFO L290 TraceCheckUtils]: 102: Hoare triple {9136#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} 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; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,622 INFO L290 TraceCheckUtils]: 103: Hoare triple {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,623 INFO L272 TraceCheckUtils]: 104: Hoare triple {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 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)); {8834#true} is VALID [2022-04-28 14:22:52,623 INFO L290 TraceCheckUtils]: 105: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,623 INFO L290 TraceCheckUtils]: 106: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,623 INFO L290 TraceCheckUtils]: 107: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,623 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8834#true} {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #54#return; {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:52,624 INFO L290 TraceCheckUtils]: 109: Hoare triple {9158#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 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; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 14:22:52,624 INFO L290 TraceCheckUtils]: 110: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 14:22:52,624 INFO L272 TraceCheckUtils]: 111: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} 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)); {8834#true} is VALID [2022-04-28 14:22:52,624 INFO L290 TraceCheckUtils]: 112: Hoare triple {8834#true} ~cond := #in~cond; {8834#true} is VALID [2022-04-28 14:22:52,624 INFO L290 TraceCheckUtils]: 113: Hoare triple {8834#true} assume !(0 == ~cond); {8834#true} is VALID [2022-04-28 14:22:52,624 INFO L290 TraceCheckUtils]: 114: Hoare triple {8834#true} assume true; {8834#true} is VALID [2022-04-28 14:22:52,625 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8834#true} {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 14:22:52,626 INFO L290 TraceCheckUtils]: 116: Hoare triple {9180#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {9202#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-28 14:22:52,626 INFO L272 TraceCheckUtils]: 117: Hoare triple {9202#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:52,627 INFO L290 TraceCheckUtils]: 118: Hoare triple {9206#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:52,627 INFO L290 TraceCheckUtils]: 119: Hoare triple {9210#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8835#false} is VALID [2022-04-28 14:22:52,627 INFO L290 TraceCheckUtils]: 120: Hoare triple {8835#false} assume !false; {8835#false} is VALID [2022-04-28 14:22:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 30 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 14:22:52,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:52,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618168961] [2022-04-28 14:22:52,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:52,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878243516] [2022-04-28 14:22:52,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878243516] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:52,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:52,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-28 14:22:52,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:52,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970547387] [2022-04-28 14:22:52,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970547387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:52,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:52,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 14:22:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417499728] [2022-04-28 14:22:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-28 14:22:52,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:52,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 14:22:52,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:52,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 14:22:52,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 14:22:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 14:22:52,953 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 14:22:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:54,854 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-28 14:22:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 14:22:54,854 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-28 14:22:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 14:22:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-28 14:22:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 14:22:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-28 14:22:54,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-28 14:22:54,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:54,922 INFO L225 Difference]: With dead ends: 78 [2022-04-28 14:22:54,922 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 14:22:54,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-28 14:22:54,923 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:54,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 14:22:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 14:22:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 14:22:54,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:54,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:22:54,980 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:22:54,980 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:22:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:54,982 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 14:22:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 14:22:54,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:54,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:54,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-28 14:22:54,982 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-28 14:22:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:54,984 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 14:22:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 14:22:54,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:54,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:54,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:54,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:22:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-28 14:22:54,986 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-28 14:22:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:54,986 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-28 14:22:54,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 14:22:54,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 87 transitions. [2022-04-28 14:22:55,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 14:22:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 14:22:55,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:55,101 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:55,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:55,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 14:22:55,310 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 29 times [2022-04-28 14:22:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:55,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [427817732] [2022-04-28 14:22:55,382 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:55,382 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 30 times [2022-04-28 14:22:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:55,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408227504] [2022-04-28 14:22:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:55,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:55,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839662859] [2022-04-28 14:22:55,399 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:22:55,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:55,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:55,400 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:55,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 14:22:55,707 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 14:22:55,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:55,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 14:22:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:55,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:56,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {9710#true} call ULTIMATE.init(); {9710#true} is VALID [2022-04-28 14:22:56,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {9710#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); {9710#true} is VALID [2022-04-28 14:22:56,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9710#true} {9710#true} #60#return; {9710#true} is VALID [2022-04-28 14:22:56,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {9710#true} call #t~ret5 := main(); {9710#true} is VALID [2022-04-28 14:22:56,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {9710#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; {9710#true} is VALID [2022-04-28 14:22:56,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {9710#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {9710#true} is VALID [2022-04-28 14:22:56,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9710#true} {9710#true} #52#return; {9710#true} is VALID [2022-04-28 14:22:56,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {9710#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:56,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {9748#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:56,317 INFO L272 TraceCheckUtils]: 13: Hoare triple {9748#(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)); {9710#true} is VALID [2022-04-28 14:22:56,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,318 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9710#true} {9748#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9748#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:56,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {9748#(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; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:56,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:56,319 INFO L272 TraceCheckUtils]: 20: Hoare triple {9770#(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)); {9710#true} is VALID [2022-04-28 14:22:56,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,320 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9710#true} {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {9770#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:56,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {9770#(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; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:56,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:56,321 INFO L272 TraceCheckUtils]: 27: Hoare triple {9792#(and (= (+ (- 2) main_~y~0) 0) (= 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)); {9710#true} is VALID [2022-04-28 14:22:56,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,321 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9710#true} {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {9792#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:56,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {9792#(and (= (+ (- 2) main_~y~0) 0) (= 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; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:22:56,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:22:56,322 INFO L272 TraceCheckUtils]: 34: Hoare triple {9814#(and (= (+ main_~c~0 (- 3)) 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)); {9710#true} is VALID [2022-04-28 14:22:56,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,323 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9710#true} {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {9814#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 14:22:56,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {9814#(and (= (+ main_~c~0 (- 3)) 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; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 14:22:56,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} assume !false; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 14:22:56,323 INFO L272 TraceCheckUtils]: 41: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 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)); {9710#true} is VALID [2022-04-28 14:22:56,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,324 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9710#true} {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} #54#return; {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 14:22:56,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {9836#(and (= (+ main_~y~0 (- 4)) 0) (= (+ main_~c~0 (- 4)) 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; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 14:22:56,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} assume !false; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 14:22:56,325 INFO L272 TraceCheckUtils]: 48: Hoare triple {9858#(and (= (+ main_~y~0 (- 5)) 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)); {9710#true} is VALID [2022-04-28 14:22:56,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,326 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9710#true} {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} #54#return; {9858#(and (= (+ main_~y~0 (- 5)) 0) (= 5 main_~c~0))} is VALID [2022-04-28 14:22:56,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {9858#(and (= (+ main_~y~0 (- 5)) 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; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 14:22:56,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 14:22:56,326 INFO L272 TraceCheckUtils]: 55: Hoare triple {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} 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)); {9710#true} is VALID [2022-04-28 14:22:56,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,341 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9710#true} {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 14:22:56,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {9880#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:56,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:56,342 INFO L272 TraceCheckUtils]: 62: Hoare triple {9902#(and (= 7 main_~c~0) (= 6 (+ (- 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)); {9710#true} is VALID [2022-04-28 14:22:56,342 INFO L290 TraceCheckUtils]: 63: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,342 INFO L290 TraceCheckUtils]: 64: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,343 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9710#true} {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {9902#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:22:56,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {9902#(and (= 7 main_~c~0) (= 6 (+ (- 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; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 14:22:56,343 INFO L290 TraceCheckUtils]: 68: Hoare triple {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 14:22:56,344 INFO L272 TraceCheckUtils]: 69: Hoare triple {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) 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)); {9710#true} is VALID [2022-04-28 14:22:56,344 INFO L290 TraceCheckUtils]: 70: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,344 INFO L290 TraceCheckUtils]: 71: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,344 INFO L290 TraceCheckUtils]: 72: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,344 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9710#true} {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 14:22:56,345 INFO L290 TraceCheckUtils]: 74: Hoare triple {9924#(and (= main_~y~0 8) (= 7 (+ (- 1) 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; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:22:56,345 INFO L290 TraceCheckUtils]: 75: Hoare triple {9946#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:22:56,345 INFO L272 TraceCheckUtils]: 76: Hoare triple {9946#(and (= main_~y~0 9) (= 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)); {9710#true} is VALID [2022-04-28 14:22:56,345 INFO L290 TraceCheckUtils]: 77: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,345 INFO L290 TraceCheckUtils]: 78: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,345 INFO L290 TraceCheckUtils]: 79: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,346 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9710#true} {9946#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {9946#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:22:56,346 INFO L290 TraceCheckUtils]: 81: Hoare triple {9946#(and (= main_~y~0 9) (= 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; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:22:56,346 INFO L290 TraceCheckUtils]: 82: Hoare triple {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:22:56,346 INFO L272 TraceCheckUtils]: 83: Hoare triple {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} 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)); {9710#true} is VALID [2022-04-28 14:22:56,346 INFO L290 TraceCheckUtils]: 84: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,346 INFO L290 TraceCheckUtils]: 85: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,347 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9710#true} {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:22:56,347 INFO L290 TraceCheckUtils]: 88: Hoare triple {9968#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 14:22:56,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !false; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 14:22:56,348 INFO L272 TraceCheckUtils]: 90: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~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)); {9710#true} is VALID [2022-04-28 14:22:56,348 INFO L290 TraceCheckUtils]: 91: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,348 INFO L290 TraceCheckUtils]: 92: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,348 INFO L290 TraceCheckUtils]: 93: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,348 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9710#true} {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} #54#return; {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 14:22:56,349 INFO L290 TraceCheckUtils]: 95: Hoare triple {9990#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~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; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 14:22:56,349 INFO L290 TraceCheckUtils]: 96: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !false; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 14:22:56,349 INFO L272 TraceCheckUtils]: 97: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 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)); {9710#true} is VALID [2022-04-28 14:22:56,349 INFO L290 TraceCheckUtils]: 98: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,349 INFO L290 TraceCheckUtils]: 99: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,349 INFO L290 TraceCheckUtils]: 100: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,350 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9710#true} {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} #54#return; {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-28 14:22:56,352 INFO L290 TraceCheckUtils]: 102: Hoare triple {10012#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 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; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 14:22:56,352 INFO L290 TraceCheckUtils]: 103: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !false; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 14:22:56,352 INFO L272 TraceCheckUtils]: 104: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} 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)); {9710#true} is VALID [2022-04-28 14:22:56,352 INFO L290 TraceCheckUtils]: 105: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,352 INFO L290 TraceCheckUtils]: 106: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,352 INFO L290 TraceCheckUtils]: 107: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,353 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9710#true} {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} #54#return; {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-28 14:22:56,353 INFO L290 TraceCheckUtils]: 109: Hoare triple {10034#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-28 14:22:56,353 INFO L290 TraceCheckUtils]: 110: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} assume !false; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-28 14:22:56,353 INFO L272 TraceCheckUtils]: 111: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} 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)); {9710#true} is VALID [2022-04-28 14:22:56,354 INFO L290 TraceCheckUtils]: 112: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,354 INFO L290 TraceCheckUtils]: 113: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,354 INFO L290 TraceCheckUtils]: 114: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,354 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9710#true} {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} #54#return; {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} is VALID [2022-04-28 14:22:56,354 INFO L290 TraceCheckUtils]: 116: Hoare triple {10056#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 14:22:56,355 INFO L290 TraceCheckUtils]: 117: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} assume !false; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 14:22:56,355 INFO L272 TraceCheckUtils]: 118: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} 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)); {9710#true} is VALID [2022-04-28 14:22:56,355 INFO L290 TraceCheckUtils]: 119: Hoare triple {9710#true} ~cond := #in~cond; {9710#true} is VALID [2022-04-28 14:22:56,355 INFO L290 TraceCheckUtils]: 120: Hoare triple {9710#true} assume !(0 == ~cond); {9710#true} is VALID [2022-04-28 14:22:56,355 INFO L290 TraceCheckUtils]: 121: Hoare triple {9710#true} assume true; {9710#true} is VALID [2022-04-28 14:22:56,356 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9710#true} {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} #54#return; {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 14:22:56,356 INFO L290 TraceCheckUtils]: 123: Hoare triple {10078#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {10100#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-28 14:22:56,357 INFO L272 TraceCheckUtils]: 124: Hoare triple {10100#(and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10104#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:56,357 INFO L290 TraceCheckUtils]: 125: Hoare triple {10104#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10108#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:56,357 INFO L290 TraceCheckUtils]: 126: Hoare triple {10108#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9711#false} is VALID [2022-04-28 14:22:56,357 INFO L290 TraceCheckUtils]: 127: Hoare triple {9711#false} assume !false; {9711#false} is VALID [2022-04-28 14:22:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 14:22:56,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:56,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:56,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408227504] [2022-04-28 14:22:56,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:56,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839662859] [2022-04-28 14:22:56,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839662859] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:56,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:56,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-28 14:22:56,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:56,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [427817732] [2022-04-28 14:22:56,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [427817732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:56,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:56,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 14:22:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111521051] [2022-04-28 14:22:56,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:56,602 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-28 14:22:56,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:56,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 14:22:56,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:56,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 14:22:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:56,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 14:22:56,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:22:56,666 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 14:22:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:58,800 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-28 14:22:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 14:22:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-28 14:22:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 14:22:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-28 14:22:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 14:22:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-28 14:22:58,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-28 14:22:58,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:58,917 INFO L225 Difference]: With dead ends: 81 [2022-04-28 14:22:58,917 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:22:58,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-28 14:22:58,918 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:58,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 689 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 14:22:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:22:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:22:58,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:58,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:22:58,985 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:22:58,985 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:22:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:58,987 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 14:22:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 14:22:58,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:58,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:58,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-28 14:22:58,987 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-28 14:22:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:58,988 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 14:22:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 14:22:58,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:58,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:58,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:58,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:22:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-28 14:22:58,990 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-28 14:22:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:58,990 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-28 14:22:58,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 14:22:58,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 91 transitions. [2022-04-28 14:22:59,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-28 14:22:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 14:22:59,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:59,106 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:59,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:59,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 14:22:59,307 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 31 times [2022-04-28 14:22:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:59,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181203596] [2022-04-28 14:22:59,372 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:59,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 32 times [2022-04-28 14:22:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:59,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552343700] [2022-04-28 14:22:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:59,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:59,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690846731] [2022-04-28 14:22:59,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:59,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:59,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:59,385 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:59,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 14:22:59,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:59,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:59,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-28 14:22:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:00,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:00,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-28 14:23:00,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#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); {10626#true} is VALID [2022-04-28 14:23:00,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #60#return; {10626#true} is VALID [2022-04-28 14:23:00,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-28 14:23:00,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#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; {10626#true} is VALID [2022-04-28 14:23:00,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {10626#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {10626#true} is VALID [2022-04-28 14:23:00,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10626#true} {10626#true} #52#return; {10626#true} is VALID [2022-04-28 14:23:00,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {10626#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:00,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {10664#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:00,866 INFO L272 TraceCheckUtils]: 13: Hoare triple {10664#(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)); {10626#true} is VALID [2022-04-28 14:23:00,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,866 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10626#true} {10664#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:00,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {10664#(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; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:00,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:00,867 INFO L272 TraceCheckUtils]: 20: Hoare triple {10686#(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)); {10626#true} is VALID [2022-04-28 14:23:00,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,868 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10626#true} {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:00,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {10686#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~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; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !false; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,869 INFO L272 TraceCheckUtils]: 27: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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)); {10626#true} is VALID [2022-04-28 14:23:00,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,871 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10626#true} {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} #54#return; {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {10708#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} assume !false; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,872 INFO L272 TraceCheckUtils]: 34: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 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)); {10626#true} is VALID [2022-04-28 14:23:00,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,873 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10626#true} {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} #54#return; {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {10730#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 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; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} assume !false; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,874 INFO L272 TraceCheckUtils]: 41: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 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)); {10626#true} is VALID [2022-04-28 14:23:00,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,887 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10626#true} {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} #54#return; {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {10752#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 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; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !false; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,888 INFO L272 TraceCheckUtils]: 48: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 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)); {10626#true} is VALID [2022-04-28 14:23:00,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,889 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10626#true} {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #54#return; {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {10774#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 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; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,890 INFO L272 TraceCheckUtils]: 55: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 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)); {10626#true} is VALID [2022-04-28 14:23:00,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,891 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10626#true} {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {10796#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 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; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,891 INFO L272 TraceCheckUtils]: 62: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~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)); {10626#true} is VALID [2022-04-28 14:23:00,891 INFO L290 TraceCheckUtils]: 63: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,892 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10626#true} {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,892 INFO L290 TraceCheckUtils]: 67: Hoare triple {10818#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~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; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,893 INFO L272 TraceCheckUtils]: 69: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 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)); {10626#true} is VALID [2022-04-28 14:23:00,893 INFO L290 TraceCheckUtils]: 70: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,893 INFO L290 TraceCheckUtils]: 71: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,893 INFO L290 TraceCheckUtils]: 72: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,894 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10626#true} {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,894 INFO L290 TraceCheckUtils]: 74: Hoare triple {10840#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 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; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !false; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,894 INFO L272 TraceCheckUtils]: 76: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 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)); {10626#true} is VALID [2022-04-28 14:23:00,895 INFO L290 TraceCheckUtils]: 77: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,895 INFO L290 TraceCheckUtils]: 78: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,895 INFO L290 TraceCheckUtils]: 79: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,895 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10626#true} {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} #54#return; {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,896 INFO L290 TraceCheckUtils]: 81: Hoare triple {10862#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 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; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,896 INFO L290 TraceCheckUtils]: 82: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,896 INFO L272 TraceCheckUtils]: 83: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~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)); {10626#true} is VALID [2022-04-28 14:23:00,896 INFO L290 TraceCheckUtils]: 84: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,896 INFO L290 TraceCheckUtils]: 85: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,896 INFO L290 TraceCheckUtils]: 86: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,897 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10626#true} {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,897 INFO L290 TraceCheckUtils]: 88: Hoare triple {10884#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~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; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,897 INFO L290 TraceCheckUtils]: 89: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,897 INFO L272 TraceCheckUtils]: 90: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 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)); {10626#true} is VALID [2022-04-28 14:23:00,897 INFO L290 TraceCheckUtils]: 91: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,898 INFO L290 TraceCheckUtils]: 92: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,898 INFO L290 TraceCheckUtils]: 93: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,898 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10626#true} {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #54#return; {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,898 INFO L290 TraceCheckUtils]: 95: Hoare triple {10906#(and (= main_~c~0 11) (= main_~y~0 11) (< 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; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,899 INFO L272 TraceCheckUtils]: 97: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 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)); {10626#true} is VALID [2022-04-28 14:23:00,899 INFO L290 TraceCheckUtils]: 98: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,899 INFO L290 TraceCheckUtils]: 99: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,899 INFO L290 TraceCheckUtils]: 100: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,899 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10626#true} {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #54#return; {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:00,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {10928#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 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; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 14:23:00,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 14:23:00,900 INFO L272 TraceCheckUtils]: 104: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} 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)); {10626#true} is VALID [2022-04-28 14:23:00,900 INFO L290 TraceCheckUtils]: 105: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,900 INFO L290 TraceCheckUtils]: 106: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,900 INFO L290 TraceCheckUtils]: 107: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,901 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10626#true} {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 14:23:00,901 INFO L290 TraceCheckUtils]: 109: Hoare triple {10950#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 14:23:00,902 INFO L290 TraceCheckUtils]: 110: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 14:23:00,902 INFO L272 TraceCheckUtils]: 111: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} 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)); {10626#true} is VALID [2022-04-28 14:23:00,902 INFO L290 TraceCheckUtils]: 112: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,902 INFO L290 TraceCheckUtils]: 113: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,902 INFO L290 TraceCheckUtils]: 114: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,902 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10626#true} {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 14:23:00,903 INFO L290 TraceCheckUtils]: 116: Hoare triple {10972#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:00,903 INFO L290 TraceCheckUtils]: 117: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} assume !false; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:00,903 INFO L272 TraceCheckUtils]: 118: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 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)); {10626#true} is VALID [2022-04-28 14:23:00,903 INFO L290 TraceCheckUtils]: 119: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,903 INFO L290 TraceCheckUtils]: 120: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,903 INFO L290 TraceCheckUtils]: 121: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,904 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10626#true} {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} #54#return; {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:00,904 INFO L290 TraceCheckUtils]: 123: Hoare triple {10994#(and (= main_~y~0 15) (< 0 main_~k~0) (= 13 (+ (- 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; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 14:23:00,905 INFO L290 TraceCheckUtils]: 124: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 14:23:00,905 INFO L272 TraceCheckUtils]: 125: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} 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)); {10626#true} is VALID [2022-04-28 14:23:00,905 INFO L290 TraceCheckUtils]: 126: Hoare triple {10626#true} ~cond := #in~cond; {10626#true} is VALID [2022-04-28 14:23:00,905 INFO L290 TraceCheckUtils]: 127: Hoare triple {10626#true} assume !(0 == ~cond); {10626#true} is VALID [2022-04-28 14:23:00,905 INFO L290 TraceCheckUtils]: 128: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 14:23:00,905 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10626#true} {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 14:23:00,906 INFO L290 TraceCheckUtils]: 130: Hoare triple {11016#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {11038#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-28 14:23:00,907 INFO L272 TraceCheckUtils]: 131: Hoare triple {11038#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11042#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:00,907 INFO L290 TraceCheckUtils]: 132: Hoare triple {11042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:00,907 INFO L290 TraceCheckUtils]: 133: Hoare triple {11046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10627#false} is VALID [2022-04-28 14:23:00,908 INFO L290 TraceCheckUtils]: 134: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-28 14:23:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 34 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 14:23:00,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:02,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:02,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552343700] [2022-04-28 14:23:02,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:02,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690846731] [2022-04-28 14:23:02,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690846731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:02,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:02,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-28 14:23:02,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:02,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181203596] [2022-04-28 14:23:02,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181203596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:02,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:02,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 14:23:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607894417] [2022-04-28 14:23:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:02,400 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-28 14:23:02,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:02,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 14:23:02,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:02,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 14:23:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 14:23:02,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 14:23:02,467 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 14:23:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:05,083 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-28 14:23:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 14:23:05,083 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-28 14:23:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 14:23:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-28 14:23:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 14:23:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-28 14:23:05,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 96 transitions. [2022-04-28 14:23:05,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:05,162 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:23:05,162 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 14:23:05,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 14:23:05,163 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:05,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 730 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 14:23:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 14:23:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 14:23:05,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:05,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:23:05,255 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:23:05,255 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:23:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:05,256 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 14:23:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 14:23:05,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:05,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:05,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-28 14:23:05,257 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-28 14:23:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:05,258 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 14:23:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 14:23:05,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:05,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:05,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:05,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:23:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-28 14:23:05,260 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-28 14:23:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:05,260 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-28 14:23:05,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 14:23:05,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 95 transitions. [2022-04-28 14:23:05,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 14:23:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-28 14:23:05,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:05,383 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:05,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:05,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:05,584 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 33 times [2022-04-28 14:23:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:05,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1568441739] [2022-04-28 14:23:05,650 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:05,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 34 times [2022-04-28 14:23:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:05,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931987215] [2022-04-28 14:23:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:05,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:05,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182912894] [2022-04-28 14:23:05,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:23:05,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:05,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:05,662 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:05,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 14:23:06,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:23:06,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:06,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 14:23:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:06,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:06,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {11912#true} call ULTIMATE.init(); {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {11912#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); {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11912#true} {11912#true} #60#return; {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {11912#true} call #t~ret5 := main(); {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {11912#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; {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {11912#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11912#true} {11912#true} #52#return; {11912#true} is VALID [2022-04-28 14:23:06,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {11912#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:06,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {11950#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:06,879 INFO L272 TraceCheckUtils]: 13: Hoare triple {11950#(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)); {11912#true} is VALID [2022-04-28 14:23:06,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,880 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11912#true} {11950#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11950#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:06,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {11950#(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; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:23:06,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {11972#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:23:06,881 INFO L272 TraceCheckUtils]: 20: Hoare triple {11972#(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)); {11912#true} is VALID [2022-04-28 14:23:06,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,881 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11912#true} {11972#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {11972#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:23:06,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {11972#(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; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:23:06,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:23:06,882 INFO L272 TraceCheckUtils]: 27: Hoare triple {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 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)); {11912#true} is VALID [2022-04-28 14:23:06,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,883 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11912#true} {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:23:06,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {11994#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:23:06,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:23:06,883 INFO L272 TraceCheckUtils]: 34: Hoare triple {12016#(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)); {11912#true} is VALID [2022-04-28 14:23:06,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,884 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11912#true} {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {12016#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:23:06,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {12016#(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; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 14:23:06,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 14:23:06,885 INFO L272 TraceCheckUtils]: 41: Hoare triple {12038#(and (= (+ 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)); {11912#true} is VALID [2022-04-28 14:23:06,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,885 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11912#true} {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #54#return; {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 14:23:06,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {12038#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:23:06,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} assume !false; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:23:06,886 INFO L272 TraceCheckUtils]: 48: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 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)); {11912#true} is VALID [2022-04-28 14:23:06,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,887 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11912#true} {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} #54#return; {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 14:23:06,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {12060#(and (= (+ main_~y~0 (- 4)) 1) (= (+ (- 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; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:06,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:06,888 INFO L272 TraceCheckUtils]: 55: Hoare triple {12082#(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)); {11912#true} is VALID [2022-04-28 14:23:06,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,888 INFO L290 TraceCheckUtils]: 58: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,888 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11912#true} {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {12082#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:06,889 INFO L290 TraceCheckUtils]: 60: Hoare triple {12082#(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; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:06,889 INFO L290 TraceCheckUtils]: 61: Hoare triple {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:06,889 INFO L272 TraceCheckUtils]: 62: Hoare triple {12104#(and (= 7 main_~c~0) (= 6 (+ (- 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)); {11912#true} is VALID [2022-04-28 14:23:06,889 INFO L290 TraceCheckUtils]: 63: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,889 INFO L290 TraceCheckUtils]: 65: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,890 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11912#true} {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {12104#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:06,890 INFO L290 TraceCheckUtils]: 67: Hoare triple {12104#(and (= 7 main_~c~0) (= 6 (+ (- 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; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 14:23:06,890 INFO L290 TraceCheckUtils]: 68: Hoare triple {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 14:23:06,890 INFO L272 TraceCheckUtils]: 69: Hoare triple {12126#(and (= (+ (- 2) main_~y~0) 6) (= 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)); {11912#true} is VALID [2022-04-28 14:23:06,890 INFO L290 TraceCheckUtils]: 70: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,890 INFO L290 TraceCheckUtils]: 71: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,891 INFO L290 TraceCheckUtils]: 72: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,891 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11912#true} {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {12126#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 14:23:06,891 INFO L290 TraceCheckUtils]: 74: Hoare triple {12126#(and (= (+ (- 2) main_~y~0) 6) (= 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; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 14:23:06,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 14:23:06,892 INFO L272 TraceCheckUtils]: 76: Hoare triple {12148#(and (= (+ main_~y~0 (- 3)) 6) (= 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)); {11912#true} is VALID [2022-04-28 14:23:06,892 INFO L290 TraceCheckUtils]: 77: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,892 INFO L290 TraceCheckUtils]: 78: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,892 INFO L290 TraceCheckUtils]: 79: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,892 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11912#true} {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #54#return; {12148#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-28 14:23:06,893 INFO L290 TraceCheckUtils]: 81: Hoare triple {12148#(and (= (+ main_~y~0 (- 3)) 6) (= 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; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:06,893 INFO L290 TraceCheckUtils]: 82: Hoare triple {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:06,893 INFO L272 TraceCheckUtils]: 83: Hoare triple {12170#(and (= main_~y~0 10) (= (+ (- 1) 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)); {11912#true} is VALID [2022-04-28 14:23:06,893 INFO L290 TraceCheckUtils]: 84: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,893 INFO L290 TraceCheckUtils]: 85: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,893 INFO L290 TraceCheckUtils]: 86: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,894 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11912#true} {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {12170#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:06,894 INFO L290 TraceCheckUtils]: 88: Hoare triple {12170#(and (= main_~y~0 10) (= (+ (- 1) 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; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 14:23:06,894 INFO L290 TraceCheckUtils]: 89: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 14:23:06,894 INFO L272 TraceCheckUtils]: 90: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} 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)); {11912#true} is VALID [2022-04-28 14:23:06,895 INFO L290 TraceCheckUtils]: 91: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,895 INFO L290 TraceCheckUtils]: 92: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,895 INFO L290 TraceCheckUtils]: 93: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,895 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11912#true} {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 14:23:06,896 INFO L290 TraceCheckUtils]: 95: Hoare triple {12192#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} 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; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 14:23:06,896 INFO L290 TraceCheckUtils]: 96: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 14:23:06,896 INFO L272 TraceCheckUtils]: 97: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} 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)); {11912#true} is VALID [2022-04-28 14:23:06,896 INFO L290 TraceCheckUtils]: 98: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,896 INFO L290 TraceCheckUtils]: 99: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,896 INFO L290 TraceCheckUtils]: 100: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,897 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11912#true} {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #54#return; {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 14:23:06,897 INFO L290 TraceCheckUtils]: 102: Hoare triple {12214#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} 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; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 14:23:06,897 INFO L290 TraceCheckUtils]: 103: Hoare triple {12236#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 14:23:06,897 INFO L272 TraceCheckUtils]: 104: Hoare triple {12236#(and (= main_~c~0 13) (= main_~y~0 13))} 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)); {11912#true} is VALID [2022-04-28 14:23:06,897 INFO L290 TraceCheckUtils]: 105: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,897 INFO L290 TraceCheckUtils]: 106: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,898 INFO L290 TraceCheckUtils]: 107: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,898 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11912#true} {12236#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {12236#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 14:23:06,898 INFO L290 TraceCheckUtils]: 109: Hoare triple {12236#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 14:23:06,899 INFO L290 TraceCheckUtils]: 110: Hoare triple {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 14:23:06,899 INFO L272 TraceCheckUtils]: 111: Hoare triple {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} 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)); {11912#true} is VALID [2022-04-28 14:23:06,899 INFO L290 TraceCheckUtils]: 112: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,899 INFO L290 TraceCheckUtils]: 113: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,899 INFO L290 TraceCheckUtils]: 114: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,899 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11912#true} {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 14:23:06,900 INFO L290 TraceCheckUtils]: 116: Hoare triple {12258#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:06,900 INFO L290 TraceCheckUtils]: 117: Hoare triple {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:06,900 INFO L272 TraceCheckUtils]: 118: Hoare triple {12280#(and (= main_~y~0 15) (= 13 (+ (- 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)); {11912#true} is VALID [2022-04-28 14:23:06,900 INFO L290 TraceCheckUtils]: 119: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,900 INFO L290 TraceCheckUtils]: 120: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,900 INFO L290 TraceCheckUtils]: 121: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,901 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11912#true} {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {12280#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:06,901 INFO L290 TraceCheckUtils]: 123: Hoare triple {12280#(and (= main_~y~0 15) (= 13 (+ (- 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; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 14:23:06,901 INFO L290 TraceCheckUtils]: 124: Hoare triple {12302#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 14:23:06,901 INFO L272 TraceCheckUtils]: 125: Hoare triple {12302#(and (= main_~c~0 16) (= main_~y~0 16))} 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)); {11912#true} is VALID [2022-04-28 14:23:06,902 INFO L290 TraceCheckUtils]: 126: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,902 INFO L290 TraceCheckUtils]: 127: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,902 INFO L290 TraceCheckUtils]: 128: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,904 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11912#true} {12302#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {12302#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-28 14:23:06,904 INFO L290 TraceCheckUtils]: 130: Hoare triple {12302#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-28 14:23:06,904 INFO L290 TraceCheckUtils]: 131: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} assume !false; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-28 14:23:06,904 INFO L272 TraceCheckUtils]: 132: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 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)); {11912#true} is VALID [2022-04-28 14:23:06,905 INFO L290 TraceCheckUtils]: 133: Hoare triple {11912#true} ~cond := #in~cond; {11912#true} is VALID [2022-04-28 14:23:06,905 INFO L290 TraceCheckUtils]: 134: Hoare triple {11912#true} assume !(0 == ~cond); {11912#true} is VALID [2022-04-28 14:23:06,905 INFO L290 TraceCheckUtils]: 135: Hoare triple {11912#true} assume true; {11912#true} is VALID [2022-04-28 14:23:06,905 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11912#true} {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} #54#return; {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-28 14:23:06,906 INFO L290 TraceCheckUtils]: 137: Hoare triple {12324#(and (<= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} assume !(~c~0 < ~k~0); {12346#(and (<= main_~k~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} is VALID [2022-04-28 14:23:06,906 INFO L272 TraceCheckUtils]: 138: Hoare triple {12346#(and (<= main_~k~0 17) (= 16 (+ (- 1) main_~y~0)) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12350#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:06,907 INFO L290 TraceCheckUtils]: 139: Hoare triple {12350#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12354#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:06,907 INFO L290 TraceCheckUtils]: 140: Hoare triple {12354#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11913#false} is VALID [2022-04-28 14:23:06,907 INFO L290 TraceCheckUtils]: 141: Hoare triple {11913#false} assume !false; {11913#false} is VALID [2022-04-28 14:23:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-28 14:23:06,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:07,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:07,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931987215] [2022-04-28 14:23:07,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:07,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182912894] [2022-04-28 14:23:07,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182912894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:07,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:07,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-28 14:23:07,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:07,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1568441739] [2022-04-28 14:23:07,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1568441739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:07,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:07,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 14:23:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703297427] [2022-04-28 14:23:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-28 14:23:07,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:07,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 14:23:07,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:07,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 14:23:07,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:07,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 14:23:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-28 14:23:07,314 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 14:23:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:10,094 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-28 14:23:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 14:23:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-28 14:23:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 14:23:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-28 14:23:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 14:23:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-28 14:23:10,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-28 14:23:10,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:10,181 INFO L225 Difference]: With dead ends: 87 [2022-04-28 14:23:10,181 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 14:23:10,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-28 14:23:10,182 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:10,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 803 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 14:23:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 14:23:10,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 14:23:10,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:10,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:23:10,272 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:23:10,273 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:23:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:10,274 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 14:23:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 14:23:10,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:10,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:10,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 14:23:10,275 INFO L87 Difference]: Start difference. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 14:23:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:10,277 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 14:23:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 14:23:10,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:10,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:10,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:10,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:23:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-28 14:23:10,279 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-28 14:23:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:10,279 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-28 14:23:10,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 14:23:10,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 99 transitions. [2022-04-28 14:23:10,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-28 14:23:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 14:23:10,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:10,420 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:10,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:10,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:10,623 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:10,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 35 times [2022-04-28 14:23:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:10,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [54431183] [2022-04-28 14:23:10,690 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:10,690 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 36 times [2022-04-28 14:23:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:10,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86084030] [2022-04-28 14:23:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:10,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:10,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284784988] [2022-04-28 14:23:10,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:23:10,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:10,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:10,703 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:10,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 14:23:21,500 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 14:23:21,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:21,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-28 14:23:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:21,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:22,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-28 14:23:22,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#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); {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12908#true} {12908#true} #60#return; {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {12908#true} call #t~ret5 := main(); {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {12908#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; {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {12908#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {12908#true} #52#return; {12908#true} is VALID [2022-04-28 14:23:22,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {12908#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:22,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {12946#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:22,246 INFO L272 TraceCheckUtils]: 13: Hoare triple {12946#(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)); {12908#true} is VALID [2022-04-28 14:23:22,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,246 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12908#true} {12946#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:22,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {12946#(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; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:22,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:22,247 INFO L272 TraceCheckUtils]: 20: Hoare triple {12968#(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)); {12908#true} is VALID [2022-04-28 14:23:22,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,248 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12908#true} {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {12968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:22,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {12968#(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; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:23:22,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {12990#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:23:22,249 INFO L272 TraceCheckUtils]: 27: Hoare triple {12990#(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)); {12908#true} is VALID [2022-04-28 14:23:22,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,249 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12908#true} {12990#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {12990#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:23:22,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {12990#(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; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:23:22,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {13012#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:23:22,250 INFO L272 TraceCheckUtils]: 34: Hoare triple {13012#(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)); {12908#true} is VALID [2022-04-28 14:23:22,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,250 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12908#true} {13012#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {13012#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:23:22,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {13012#(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; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,251 INFO L272 TraceCheckUtils]: 41: Hoare triple {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 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)); {12908#true} is VALID [2022-04-28 14:23:22,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,252 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12908#true} {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {13034#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:23:22,253 INFO L290 TraceCheckUtils]: 47: Hoare triple {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:23:22,253 INFO L272 TraceCheckUtils]: 48: Hoare triple {13056#(and (= 3 (+ (- 2) 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)); {12908#true} is VALID [2022-04-28 14:23:22,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,253 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12908#true} {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #54#return; {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:23:22,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {13056#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 14:23:22,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 14:23:22,254 INFO L272 TraceCheckUtils]: 55: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 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)); {12908#true} is VALID [2022-04-28 14:23:22,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,255 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12908#true} {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #54#return; {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 14:23:22,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {13078#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 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; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 14:23:22,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !false; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 14:23:22,255 INFO L272 TraceCheckUtils]: 62: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 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)); {12908#true} is VALID [2022-04-28 14:23:22,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,256 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #54#return; {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 14:23:22,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {13100#(and (= 3 (+ main_~c~0 (- 4))) (= 7 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; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} assume !false; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,257 INFO L272 TraceCheckUtils]: 69: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 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)); {12908#true} is VALID [2022-04-28 14:23:22,257 INFO L290 TraceCheckUtils]: 70: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,257 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,257 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12908#true} {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} #54#return; {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,258 INFO L290 TraceCheckUtils]: 74: Hoare triple {13122#(and (= 3 (+ main_~c~0 (- 5))) (= 7 (+ (- 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; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 14:23:22,258 INFO L290 TraceCheckUtils]: 75: Hoare triple {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 14:23:22,258 INFO L272 TraceCheckUtils]: 76: Hoare triple {13144#(and (= 7 (+ (- 2) main_~y~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)); {12908#true} is VALID [2022-04-28 14:23:22,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,258 INFO L290 TraceCheckUtils]: 78: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,258 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,259 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12908#true} {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {13144#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 14:23:22,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {13144#(and (= 7 (+ (- 2) main_~y~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; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:22,259 INFO L290 TraceCheckUtils]: 82: Hoare triple {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:22,260 INFO L272 TraceCheckUtils]: 83: Hoare triple {13166#(and (= main_~y~0 10) (= (+ (- 1) 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)); {12908#true} is VALID [2022-04-28 14:23:22,260 INFO L290 TraceCheckUtils]: 84: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,260 INFO L290 TraceCheckUtils]: 85: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,260 INFO L290 TraceCheckUtils]: 86: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,260 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12908#true} {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {13166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:22,260 INFO L290 TraceCheckUtils]: 88: Hoare triple {13166#(and (= main_~y~0 10) (= (+ (- 1) 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; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 14:23:22,261 INFO L290 TraceCheckUtils]: 89: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 14:23:22,261 INFO L272 TraceCheckUtils]: 90: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} 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)); {12908#true} is VALID [2022-04-28 14:23:22,261 INFO L290 TraceCheckUtils]: 91: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,261 INFO L290 TraceCheckUtils]: 92: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,261 INFO L290 TraceCheckUtils]: 93: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,261 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12908#true} {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-28 14:23:22,262 INFO L290 TraceCheckUtils]: 95: Hoare triple {13188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} 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; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 14:23:22,262 INFO L290 TraceCheckUtils]: 96: Hoare triple {13210#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 14:23:22,262 INFO L272 TraceCheckUtils]: 97: Hoare triple {13210#(and (= main_~y~0 12) (= main_~c~0 12))} 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)); {12908#true} is VALID [2022-04-28 14:23:22,262 INFO L290 TraceCheckUtils]: 98: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,262 INFO L290 TraceCheckUtils]: 99: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,262 INFO L290 TraceCheckUtils]: 100: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,263 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12908#true} {13210#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {13210#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 14:23:22,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {13210#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,264 INFO L290 TraceCheckUtils]: 103: Hoare triple {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,264 INFO L272 TraceCheckUtils]: 104: Hoare triple {13232#(and (= main_~c~0 13) (= 12 (+ (- 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)); {12908#true} is VALID [2022-04-28 14:23:22,264 INFO L290 TraceCheckUtils]: 105: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,264 INFO L290 TraceCheckUtils]: 106: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,264 INFO L290 TraceCheckUtils]: 107: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,264 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12908#true} {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {13232#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,265 INFO L290 TraceCheckUtils]: 109: Hoare triple {13232#(and (= main_~c~0 13) (= 12 (+ (- 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; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 14:23:22,265 INFO L290 TraceCheckUtils]: 110: Hoare triple {13254#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 14:23:22,265 INFO L272 TraceCheckUtils]: 111: Hoare triple {13254#(and (= main_~y~0 14) (= main_~c~0 14))} 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)); {12908#true} is VALID [2022-04-28 14:23:22,265 INFO L290 TraceCheckUtils]: 112: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,265 INFO L290 TraceCheckUtils]: 113: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,265 INFO L290 TraceCheckUtils]: 114: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,266 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {12908#true} {13254#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {13254#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-28 14:23:22,266 INFO L290 TraceCheckUtils]: 116: Hoare triple {13254#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,266 INFO L290 TraceCheckUtils]: 117: Hoare triple {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,266 INFO L272 TraceCheckUtils]: 118: Hoare triple {13276#(and (= main_~c~0 15) (= 14 (+ (- 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)); {12908#true} is VALID [2022-04-28 14:23:22,267 INFO L290 TraceCheckUtils]: 119: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,267 INFO L290 TraceCheckUtils]: 120: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,267 INFO L290 TraceCheckUtils]: 121: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,267 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12908#true} {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {13276#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:22,267 INFO L290 TraceCheckUtils]: 123: Hoare triple {13276#(and (= main_~c~0 15) (= 14 (+ (- 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; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 14:23:22,268 INFO L290 TraceCheckUtils]: 124: Hoare triple {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 14:23:22,268 INFO L272 TraceCheckUtils]: 125: Hoare triple {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} 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)); {12908#true} is VALID [2022-04-28 14:23:22,268 INFO L290 TraceCheckUtils]: 126: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,268 INFO L290 TraceCheckUtils]: 127: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,268 INFO L290 TraceCheckUtils]: 128: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,268 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {12908#true} {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-28 14:23:22,269 INFO L290 TraceCheckUtils]: 130: Hoare triple {13298#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 14:23:22,269 INFO L290 TraceCheckUtils]: 131: Hoare triple {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !false; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 14:23:22,269 INFO L272 TraceCheckUtils]: 132: Hoare triple {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} 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)); {12908#true} is VALID [2022-04-28 14:23:22,269 INFO L290 TraceCheckUtils]: 133: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,269 INFO L290 TraceCheckUtils]: 134: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,269 INFO L290 TraceCheckUtils]: 135: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,270 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {12908#true} {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} #54#return; {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-28 14:23:22,270 INFO L290 TraceCheckUtils]: 137: Hoare triple {13320#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 14:23:22,271 INFO L290 TraceCheckUtils]: 138: Hoare triple {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 14:23:22,271 INFO L272 TraceCheckUtils]: 139: Hoare triple {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} 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)); {12908#true} is VALID [2022-04-28 14:23:22,271 INFO L290 TraceCheckUtils]: 140: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:23:22,271 INFO L290 TraceCheckUtils]: 141: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:23:22,271 INFO L290 TraceCheckUtils]: 142: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:23:22,271 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {12908#true} {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 14:23:22,272 INFO L290 TraceCheckUtils]: 144: Hoare triple {13342#(and (< 17 main_~k~0) (<= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !(~c~0 < ~k~0); {13364#(and (< 17 main_~k~0) (<= main_~k~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-28 14:23:22,272 INFO L272 TraceCheckUtils]: 145: Hoare triple {13364#(and (< 17 main_~k~0) (<= main_~k~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:22,273 INFO L290 TraceCheckUtils]: 146: Hoare triple {13368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:22,273 INFO L290 TraceCheckUtils]: 147: Hoare triple {13372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12909#false} is VALID [2022-04-28 14:23:22,273 INFO L290 TraceCheckUtils]: 148: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-28 14:23:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 38 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-28 14:23:22,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:22,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:22,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86084030] [2022-04-28 14:23:22,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:22,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284784988] [2022-04-28 14:23:22,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284784988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:22,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:22,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-28 14:23:22,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:22,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [54431183] [2022-04-28 14:23:22,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [54431183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:22,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:22,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 14:23:22,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923191411] [2022-04-28 14:23:22,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:22,534 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-28 14:23:22,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:22,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 14:23:22,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:22,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 14:23:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:22,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 14:23:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:23:22,609 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 14:23:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:25,599 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-28 14:23:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 14:23:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-28 14:23:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 14:23:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-28 14:23:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 14:23:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-28 14:23:25,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-28 14:23:25,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:25,702 INFO L225 Difference]: With dead ends: 90 [2022-04-28 14:23:25,702 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 14:23:25,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-28 14:23:25,703 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:25,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 863 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 14:23:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 14:23:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 14:23:25,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:25,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:23:25,790 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:23:25,790 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:23:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:25,792 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 14:23:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 14:23:25,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:25,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:25,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-28 14:23:25,792 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-28 14:23:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:25,794 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 14:23:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 14:23:25,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:25,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:25,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:25,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:23:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-28 14:23:25,796 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-28 14:23:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:25,796 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-28 14:23:25,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 14:23:25,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 103 transitions. [2022-04-28 14:23:25,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-28 14:23:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-28 14:23:25,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:25,964 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:25,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:26,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 14:23:26,164 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 37 times [2022-04-28 14:23:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:26,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613702857] [2022-04-28 14:23:26,229 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:26,230 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 38 times [2022-04-28 14:23:26,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:26,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036351528] [2022-04-28 14:23:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:26,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:26,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797233192] [2022-04-28 14:23:26,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:26,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:26,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:26,245 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:26,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 14:23:26,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:26,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:26,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 14:23:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:26,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:27,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {13944#true} call ULTIMATE.init(); {13944#true} is VALID [2022-04-28 14:23:27,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {13944#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); {13944#true} is VALID [2022-04-28 14:23:27,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13944#true} {13944#true} #60#return; {13944#true} is VALID [2022-04-28 14:23:27,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {13944#true} call #t~ret5 := main(); {13944#true} is VALID [2022-04-28 14:23:27,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {13944#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; {13944#true} is VALID [2022-04-28 14:23:27,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {13944#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {13944#true} is VALID [2022-04-28 14:23:27,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13944#true} {13944#true} #52#return; {13944#true} is VALID [2022-04-28 14:23:27,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {13944#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:27,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {13982#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:27,802 INFO L272 TraceCheckUtils]: 13: Hoare triple {13982#(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)); {13944#true} is VALID [2022-04-28 14:23:27,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,802 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13944#true} {13982#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {13982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:27,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {13982#(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; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:27,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:27,803 INFO L272 TraceCheckUtils]: 20: Hoare triple {14004#(and (= main_~y~0 1) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,804 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13944#true} {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {14004#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:23:27,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {14004#(and (= main_~y~0 1) (< 0 main_~k~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; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,804 INFO L272 TraceCheckUtils]: 27: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,805 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13944#true} {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {14026#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 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; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,806 INFO L272 TraceCheckUtils]: 34: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,806 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13944#true} {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {14048#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1) (< 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; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:23:27,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:23:27,807 INFO L272 TraceCheckUtils]: 41: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~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)); {13944#true} is VALID [2022-04-28 14:23:27,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,808 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13944#true} {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #54#return; {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:23:27,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {14070#(and (= (+ main_~c~0 (- 3)) 1) (< 0 main_~k~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; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,809 INFO L272 TraceCheckUtils]: 48: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~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)); {13944#true} is VALID [2022-04-28 14:23:27,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,809 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13944#true} {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {14092#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~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; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,810 INFO L272 TraceCheckUtils]: 55: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,811 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13944#true} {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} #54#return; {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {14114#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6) (< 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; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !false; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,812 INFO L272 TraceCheckUtils]: 62: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,812 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13944#true} {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} #54#return; {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {14136#(and (= (+ (- 1) main_~c~0) 6) (= 2 (+ main_~y~0 (- 5))) (< 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; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,813 INFO L272 TraceCheckUtils]: 69: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,814 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13944#true} {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {14158#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8) (< 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; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,814 INFO L272 TraceCheckUtils]: 76: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~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)); {13944#true} is VALID [2022-04-28 14:23:27,814 INFO L290 TraceCheckUtils]: 77: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,815 INFO L290 TraceCheckUtils]: 78: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,815 INFO L290 TraceCheckUtils]: 79: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,815 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13944#true} {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {14180#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,815 INFO L290 TraceCheckUtils]: 81: Hoare triple {14180#(and (= main_~y~0 9) (= main_~c~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; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,816 INFO L290 TraceCheckUtils]: 82: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,816 INFO L272 TraceCheckUtils]: 83: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~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)); {13944#true} is VALID [2022-04-28 14:23:27,816 INFO L290 TraceCheckUtils]: 84: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,816 INFO L290 TraceCheckUtils]: 85: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,816 INFO L290 TraceCheckUtils]: 86: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,829 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13944#true} {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,829 INFO L290 TraceCheckUtils]: 88: Hoare triple {14202#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~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; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,830 INFO L290 TraceCheckUtils]: 89: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,830 INFO L272 TraceCheckUtils]: 90: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,830 INFO L290 TraceCheckUtils]: 91: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,830 INFO L290 TraceCheckUtils]: 92: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,830 INFO L290 TraceCheckUtils]: 93: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,830 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13944#true} {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #54#return; {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,831 INFO L290 TraceCheckUtils]: 95: Hoare triple {14224#(and (= main_~c~0 11) (= main_~y~0 11) (< 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; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,831 INFO L290 TraceCheckUtils]: 96: Hoare triple {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !false; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,831 INFO L272 TraceCheckUtils]: 97: Hoare triple {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,831 INFO L290 TraceCheckUtils]: 98: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,831 INFO L290 TraceCheckUtils]: 99: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,832 INFO L290 TraceCheckUtils]: 100: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,832 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13944#true} {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} #54#return; {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,832 INFO L290 TraceCheckUtils]: 102: Hoare triple {14246#(and (= main_~y~0 12) (= main_~c~0 12) (< 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; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 14:23:27,833 INFO L290 TraceCheckUtils]: 103: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 14:23:27,833 INFO L272 TraceCheckUtils]: 104: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} 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)); {13944#true} is VALID [2022-04-28 14:23:27,833 INFO L290 TraceCheckUtils]: 105: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,833 INFO L290 TraceCheckUtils]: 106: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,833 INFO L290 TraceCheckUtils]: 107: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,833 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13944#true} {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-28 14:23:27,834 INFO L290 TraceCheckUtils]: 109: Hoare triple {14268#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 14:23:27,834 INFO L290 TraceCheckUtils]: 110: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 14:23:27,834 INFO L272 TraceCheckUtils]: 111: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} 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)); {13944#true} is VALID [2022-04-28 14:23:27,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,834 INFO L290 TraceCheckUtils]: 113: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,834 INFO L290 TraceCheckUtils]: 114: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,835 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13944#true} {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 14:23:27,835 INFO L290 TraceCheckUtils]: 116: Hoare triple {14290#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:27,836 INFO L290 TraceCheckUtils]: 117: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} assume !false; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:27,836 INFO L272 TraceCheckUtils]: 118: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 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)); {13944#true} is VALID [2022-04-28 14:23:27,836 INFO L290 TraceCheckUtils]: 119: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,836 INFO L290 TraceCheckUtils]: 120: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,836 INFO L290 TraceCheckUtils]: 121: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,836 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13944#true} {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} #54#return; {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:27,837 INFO L290 TraceCheckUtils]: 123: Hoare triple {14312#(and (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0) (= 13 (+ (- 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; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,837 INFO L290 TraceCheckUtils]: 124: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} assume !false; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,837 INFO L272 TraceCheckUtils]: 125: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 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)); {13944#true} is VALID [2022-04-28 14:23:27,837 INFO L290 TraceCheckUtils]: 126: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,837 INFO L290 TraceCheckUtils]: 127: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,837 INFO L290 TraceCheckUtils]: 128: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,838 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13944#true} {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} #54#return; {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:27,839 INFO L290 TraceCheckUtils]: 130: Hoare triple {14334#(and (= (+ main_~y~0 (- 3)) 13) (= (+ main_~c~0 (- 3)) 13) (< 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; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 14:23:27,839 INFO L290 TraceCheckUtils]: 131: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 14:23:27,839 INFO L272 TraceCheckUtils]: 132: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} 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)); {13944#true} is VALID [2022-04-28 14:23:27,839 INFO L290 TraceCheckUtils]: 133: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,839 INFO L290 TraceCheckUtils]: 134: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,839 INFO L290 TraceCheckUtils]: 135: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,840 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13944#true} {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-28 14:23:27,840 INFO L290 TraceCheckUtils]: 137: Hoare triple {14356#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 14:23:27,840 INFO L290 TraceCheckUtils]: 138: Hoare triple {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 14:23:27,840 INFO L272 TraceCheckUtils]: 139: Hoare triple {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} 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)); {13944#true} is VALID [2022-04-28 14:23:27,840 INFO L290 TraceCheckUtils]: 140: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,841 INFO L290 TraceCheckUtils]: 141: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,841 INFO L290 TraceCheckUtils]: 142: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,841 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13944#true} {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #54#return; {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-28 14:23:27,841 INFO L290 TraceCheckUtils]: 144: Hoare triple {14378#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 14:23:27,842 INFO L290 TraceCheckUtils]: 145: Hoare triple {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !false; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 14:23:27,842 INFO L272 TraceCheckUtils]: 146: Hoare triple {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 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)); {13944#true} is VALID [2022-04-28 14:23:27,842 INFO L290 TraceCheckUtils]: 147: Hoare triple {13944#true} ~cond := #in~cond; {13944#true} is VALID [2022-04-28 14:23:27,842 INFO L290 TraceCheckUtils]: 148: Hoare triple {13944#true} assume !(0 == ~cond); {13944#true} is VALID [2022-04-28 14:23:27,842 INFO L290 TraceCheckUtils]: 149: Hoare triple {13944#true} assume true; {13944#true} is VALID [2022-04-28 14:23:27,842 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13944#true} {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} #54#return; {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 14:23:27,844 INFO L290 TraceCheckUtils]: 151: Hoare triple {14400#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !(~c~0 < ~k~0); {14422#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} is VALID [2022-04-28 14:23:27,844 INFO L272 TraceCheckUtils]: 152: Hoare triple {14422#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:27,844 INFO L290 TraceCheckUtils]: 153: Hoare triple {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:27,845 INFO L290 TraceCheckUtils]: 154: Hoare triple {14430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13945#false} is VALID [2022-04-28 14:23:27,845 INFO L290 TraceCheckUtils]: 155: Hoare triple {13945#false} assume !false; {13945#false} is VALID [2022-04-28 14:23:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 40 proven. 570 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-28 14:23:27,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:29,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:29,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036351528] [2022-04-28 14:23:29,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:29,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797233192] [2022-04-28 14:23:29,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797233192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:29,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:29,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-28 14:23:29,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:29,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613702857] [2022-04-28 14:23:29,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613702857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:29,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:29,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 14:23:29,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208274834] [2022-04-28 14:23:29,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:29,946 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-28 14:23:29,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:29,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 14:23:30,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:30,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 14:23:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:30,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 14:23:30,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 14:23:30,039 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 14:23:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:33,752 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-28 14:23:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 14:23:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-28 14:23:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 14:23:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 14:23:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 14:23:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 14:23:33,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-28 14:23:33,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:33,877 INFO L225 Difference]: With dead ends: 93 [2022-04-28 14:23:33,877 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 14:23:33,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 14:23:33,878 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:33,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 907 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 14:23:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 14:23:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-28 14:23:33,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:33,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:23:33,965 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:23:33,965 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:23:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:33,967 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 14:23:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 14:23:33,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:33,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:33,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-28 14:23:33,967 INFO L87 Difference]: Start difference. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-28 14:23:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:33,969 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 14:23:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 14:23:33,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:33,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:33,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:33,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:23:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-28 14:23:33,972 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-28 14:23:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:33,972 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-28 14:23:33,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 14:23:33,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 107 transitions. [2022-04-28 14:23:34,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-28 14:23:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 14:23:34,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:34,149 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:34,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 14:23:34,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 14:23:34,349 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 39 times [2022-04-28 14:23:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:34,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368028502] [2022-04-28 14:23:34,416 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:34,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 40 times [2022-04-28 14:23:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:34,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46726839] [2022-04-28 14:23:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:34,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:34,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213180550] [2022-04-28 14:23:34,428 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:23:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:34,429 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:34,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 14:23:34,913 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:23:34,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:34,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-28 14:23:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:34,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:35,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {15416#true} call ULTIMATE.init(); {15416#true} is VALID [2022-04-28 14:23:35,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {15416#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); {15416#true} is VALID [2022-04-28 14:23:35,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15416#true} {15416#true} #60#return; {15416#true} is VALID [2022-04-28 14:23:35,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {15416#true} call #t~ret5 := main(); {15416#true} is VALID [2022-04-28 14:23:35,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {15416#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; {15416#true} is VALID [2022-04-28 14:23:35,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {15416#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {15416#true} is VALID [2022-04-28 14:23:35,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,766 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15416#true} {15416#true} #52#return; {15416#true} is VALID [2022-04-28 14:23:35,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {15416#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:35,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {15454#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:35,766 INFO L272 TraceCheckUtils]: 13: Hoare triple {15454#(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)); {15416#true} is VALID [2022-04-28 14:23:35,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,767 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15416#true} {15454#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15454#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:35,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {15454#(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; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:23:35,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:23:35,768 INFO L272 TraceCheckUtils]: 20: Hoare triple {15476#(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)); {15416#true} is VALID [2022-04-28 14:23:35,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,768 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15416#true} {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {15476#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:23:35,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {15476#(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; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:35,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:35,769 INFO L272 TraceCheckUtils]: 27: Hoare triple {15498#(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)); {15416#true} is VALID [2022-04-28 14:23:35,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,770 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15416#true} {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {15498#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:23:35,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {15498#(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; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:23:35,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:23:35,771 INFO L272 TraceCheckUtils]: 34: Hoare triple {15520#(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)); {15416#true} is VALID [2022-04-28 14:23:35,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,771 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15416#true} {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {15520#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:23:35,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {15520#(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; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:23:35,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {15542#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:23:35,772 INFO L272 TraceCheckUtils]: 41: Hoare triple {15542#(and (= main_~y~0 4) (= 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)); {15416#true} is VALID [2022-04-28 14:23:35,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,772 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15416#true} {15542#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {15542#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:23:35,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {15542#(and (= main_~y~0 4) (= 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; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:23:35,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:23:35,773 INFO L272 TraceCheckUtils]: 48: Hoare triple {15564#(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)); {15416#true} is VALID [2022-04-28 14:23:35,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,774 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15416#true} {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {15564#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:23:35,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {15564#(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; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:23:35,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {15586#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:23:35,774 INFO L272 TraceCheckUtils]: 55: Hoare triple {15586#(and (= main_~y~0 6) (= 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)); {15416#true} is VALID [2022-04-28 14:23:35,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,775 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15416#true} {15586#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {15586#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:23:35,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {15586#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:23:35,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:23:35,776 INFO L272 TraceCheckUtils]: 62: Hoare triple {15608#(and (= 7 main_~y~0) (= (+ (- 1) 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)); {15416#true} is VALID [2022-04-28 14:23:35,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,776 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15416#true} {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:23:35,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {15608#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,777 INFO L272 TraceCheckUtils]: 69: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 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)); {15416#true} is VALID [2022-04-28 14:23:35,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,778 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15416#true} {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {15630#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 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; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 14:23:35,779 INFO L290 TraceCheckUtils]: 75: Hoare triple {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 14:23:35,779 INFO L272 TraceCheckUtils]: 76: Hoare triple {15652#(and (= 7 (+ (- 2) main_~y~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)); {15416#true} is VALID [2022-04-28 14:23:35,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,779 INFO L290 TraceCheckUtils]: 79: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,779 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15416#true} {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {15652#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 14:23:35,780 INFO L290 TraceCheckUtils]: 81: Hoare triple {15652#(and (= 7 (+ (- 2) main_~y~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; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:35,780 INFO L290 TraceCheckUtils]: 82: Hoare triple {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} assume !false; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:35,780 INFO L272 TraceCheckUtils]: 83: Hoare triple {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) 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)); {15416#true} is VALID [2022-04-28 14:23:35,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,781 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15416#true} {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} #54#return; {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 14:23:35,781 INFO L290 TraceCheckUtils]: 88: Hoare triple {15674#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) 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; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 14:23:35,781 INFO L290 TraceCheckUtils]: 89: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !false; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 14:23:35,781 INFO L272 TraceCheckUtils]: 90: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ 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)); {15416#true} is VALID [2022-04-28 14:23:35,781 INFO L290 TraceCheckUtils]: 91: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,781 INFO L290 TraceCheckUtils]: 92: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,782 INFO L290 TraceCheckUtils]: 93: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,782 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15416#true} {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} #54#return; {15696#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-28 14:23:35,782 INFO L290 TraceCheckUtils]: 95: Hoare triple {15696#(and (= main_~c~0 11) (= 7 (+ 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; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 14:23:35,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {15718#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 14:23:35,783 INFO L272 TraceCheckUtils]: 97: Hoare triple {15718#(and (= main_~y~0 12) (= main_~c~0 12))} 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)); {15416#true} is VALID [2022-04-28 14:23:35,783 INFO L290 TraceCheckUtils]: 98: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,783 INFO L290 TraceCheckUtils]: 99: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,783 INFO L290 TraceCheckUtils]: 100: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,783 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15416#true} {15718#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {15718#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-28 14:23:35,784 INFO L290 TraceCheckUtils]: 102: Hoare triple {15718#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,784 INFO L290 TraceCheckUtils]: 103: Hoare triple {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,784 INFO L272 TraceCheckUtils]: 104: Hoare triple {15740#(and (= main_~c~0 13) (= 12 (+ (- 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)); {15416#true} is VALID [2022-04-28 14:23:35,784 INFO L290 TraceCheckUtils]: 105: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,784 INFO L290 TraceCheckUtils]: 106: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,784 INFO L290 TraceCheckUtils]: 107: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,785 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15416#true} {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {15740#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,785 INFO L290 TraceCheckUtils]: 109: Hoare triple {15740#(and (= main_~c~0 13) (= 12 (+ (- 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; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 14:23:35,785 INFO L290 TraceCheckUtils]: 110: Hoare triple {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 14:23:35,785 INFO L272 TraceCheckUtils]: 111: Hoare triple {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} 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)); {15416#true} is VALID [2022-04-28 14:23:35,785 INFO L290 TraceCheckUtils]: 112: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,785 INFO L290 TraceCheckUtils]: 113: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,786 INFO L290 TraceCheckUtils]: 114: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,786 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {15416#true} {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 14:23:35,786 INFO L290 TraceCheckUtils]: 116: Hoare triple {15762#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,787 INFO L290 TraceCheckUtils]: 117: Hoare triple {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,787 INFO L272 TraceCheckUtils]: 118: Hoare triple {15784#(and (= main_~c~0 15) (= 14 (+ (- 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)); {15416#true} is VALID [2022-04-28 14:23:35,787 INFO L290 TraceCheckUtils]: 119: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,787 INFO L290 TraceCheckUtils]: 120: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,787 INFO L290 TraceCheckUtils]: 121: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,787 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15416#true} {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {15784#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:23:35,788 INFO L290 TraceCheckUtils]: 123: Hoare triple {15784#(and (= main_~c~0 15) (= 14 (+ (- 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; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 14:23:35,788 INFO L290 TraceCheckUtils]: 124: Hoare triple {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 14:23:35,788 INFO L272 TraceCheckUtils]: 125: Hoare triple {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} 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)); {15416#true} is VALID [2022-04-28 14:23:35,788 INFO L290 TraceCheckUtils]: 126: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,788 INFO L290 TraceCheckUtils]: 127: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,788 INFO L290 TraceCheckUtils]: 128: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,789 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15416#true} {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #54#return; {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-28 14:23:35,789 INFO L290 TraceCheckUtils]: 130: Hoare triple {15806#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 14:23:35,790 INFO L290 TraceCheckUtils]: 131: Hoare triple {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 14:23:35,790 INFO L272 TraceCheckUtils]: 132: Hoare triple {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} 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)); {15416#true} is VALID [2022-04-28 14:23:35,790 INFO L290 TraceCheckUtils]: 133: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,790 INFO L290 TraceCheckUtils]: 134: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,790 INFO L290 TraceCheckUtils]: 135: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,790 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15416#true} {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-28 14:23:35,791 INFO L290 TraceCheckUtils]: 137: Hoare triple {15828#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 14:23:35,791 INFO L290 TraceCheckUtils]: 138: Hoare triple {15850#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 14:23:35,791 INFO L272 TraceCheckUtils]: 139: Hoare triple {15850#(and (= main_~c~0 18) (= main_~y~0 18))} 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)); {15416#true} is VALID [2022-04-28 14:23:35,791 INFO L290 TraceCheckUtils]: 140: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,791 INFO L290 TraceCheckUtils]: 141: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,791 INFO L290 TraceCheckUtils]: 142: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,792 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {15416#true} {15850#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {15850#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-28 14:23:35,792 INFO L290 TraceCheckUtils]: 144: Hoare triple {15850#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 14:23:35,792 INFO L290 TraceCheckUtils]: 145: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !false; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 14:23:35,792 INFO L272 TraceCheckUtils]: 146: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} 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)); {15416#true} is VALID [2022-04-28 14:23:35,792 INFO L290 TraceCheckUtils]: 147: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,793 INFO L290 TraceCheckUtils]: 148: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,793 INFO L290 TraceCheckUtils]: 149: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,793 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15416#true} {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} #54#return; {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-28 14:23:35,793 INFO L290 TraceCheckUtils]: 151: Hoare triple {15872#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-28 14:23:35,794 INFO L290 TraceCheckUtils]: 152: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !false; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-28 14:23:35,794 INFO L272 TraceCheckUtils]: 153: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} 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)); {15416#true} is VALID [2022-04-28 14:23:35,794 INFO L290 TraceCheckUtils]: 154: Hoare triple {15416#true} ~cond := #in~cond; {15416#true} is VALID [2022-04-28 14:23:35,794 INFO L290 TraceCheckUtils]: 155: Hoare triple {15416#true} assume !(0 == ~cond); {15416#true} is VALID [2022-04-28 14:23:35,794 INFO L290 TraceCheckUtils]: 156: Hoare triple {15416#true} assume true; {15416#true} is VALID [2022-04-28 14:23:35,794 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {15416#true} {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} #54#return; {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-28 14:23:35,795 INFO L290 TraceCheckUtils]: 158: Hoare triple {15894#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !(~c~0 < ~k~0); {15916#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-28 14:23:35,795 INFO L272 TraceCheckUtils]: 159: Hoare triple {15916#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:35,796 INFO L290 TraceCheckUtils]: 160: Hoare triple {15920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:35,796 INFO L290 TraceCheckUtils]: 161: Hoare triple {15924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15417#false} is VALID [2022-04-28 14:23:35,796 INFO L290 TraceCheckUtils]: 162: Hoare triple {15417#false} assume !false; {15417#false} is VALID [2022-04-28 14:23:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-28 14:23:35,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:36,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46726839] [2022-04-28 14:23:36,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:36,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213180550] [2022-04-28 14:23:36,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213180550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:36,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:36,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-28 14:23:36,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:36,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368028502] [2022-04-28 14:23:36,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368028502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:36,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:36,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 14:23:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864626115] [2022-04-28 14:23:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:36,124 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-28 14:23:36,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:36,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 14:23:36,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:36,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 14:23:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:36,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 14:23:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-28 14:23:36,215 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 14:23:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:40,198 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-28 14:23:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 14:23:40,198 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-28 14:23:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 14:23:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-28 14:23:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 14:23:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-28 14:23:40,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-28 14:23:40,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:40,311 INFO L225 Difference]: With dead ends: 96 [2022-04-28 14:23:40,311 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 14:23:40,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-28 14:23:40,312 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:40,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 989 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 14:23:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 14:23:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 14:23:40,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:40,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 14:23:40,417 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 14:23:40,417 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 14:23:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:40,418 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 14:23:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 14:23:40,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:40,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:40,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-28 14:23:40,419 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-28 14:23:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:40,420 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 14:23:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 14:23:40,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:40,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:40,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:40,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 14:23:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-28 14:23:40,422 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-28 14:23:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:40,423 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-28 14:23:40,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-28 14:23:40,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-28 14:23:40,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 14:23:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-28 14:23:40,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:40,597 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:40,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:40,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:40,801 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 41 times [2022-04-28 14:23:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:40,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1547160866] [2022-04-28 14:23:40,865 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:40,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 42 times [2022-04-28 14:23:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:40,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462649270] [2022-04-28 14:23:40,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:40,890 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:40,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430983704] [2022-04-28 14:23:40,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:23:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:40,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:40,892 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:40,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 14:23:41,609 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 14:23:41,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:41,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 14:23:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:41,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:42,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {16532#true} call ULTIMATE.init(); {16532#true} is VALID [2022-04-28 14:23:42,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {16532#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); {16532#true} is VALID [2022-04-28 14:23:42,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16532#true} {16532#true} #60#return; {16532#true} is VALID [2022-04-28 14:23:42,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {16532#true} call #t~ret5 := main(); {16532#true} is VALID [2022-04-28 14:23:42,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {16532#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; {16532#true} is VALID [2022-04-28 14:23:42,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {16532#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {16532#true} is VALID [2022-04-28 14:23:42,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {16532#true} ~cond := #in~cond; {16558#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:23:42,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {16558#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16562#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:23:42,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {16562#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16562#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:23:42,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16562#(not (= |assume_abort_if_not_#in~cond| 0))} {16532#true} #52#return; {16569#(and (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {16569#(and (<= main_~k~0 20) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:23:42,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:23:42,886 INFO L272 TraceCheckUtils]: 13: Hoare triple {16573#(and (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,886 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16532#true} {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {16573#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:23:42,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {16573#(and (<= main_~k~0 20) (<= 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; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,889 INFO L272 TraceCheckUtils]: 20: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,890 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16532#true} {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {16595#(and (<= 1 main_~c~0) (<= main_~k~0 20) (<= 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; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:23:42,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:23:42,892 INFO L272 TraceCheckUtils]: 27: Hoare triple {16617#(and (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,893 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16532#true} {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {16617#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:23:42,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {16617#(and (<= main_~k~0 20) (<= 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; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:23:42,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:23:42,895 INFO L272 TraceCheckUtils]: 34: Hoare triple {16639#(and (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,897 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16532#true} {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {16639#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {16639#(and (<= main_~k~0 20) (<= 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; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:23:42,898 INFO L272 TraceCheckUtils]: 41: Hoare triple {16661#(and (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,899 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16532#true} {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {16661#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {16661#(and (<= main_~k~0 20) (<= 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; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:23:42,900 INFO L272 TraceCheckUtils]: 48: Hoare triple {16683#(and (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 50: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,901 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16532#true} {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {16683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {16683#(and (<= main_~k~0 20) (<= 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; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:23:42,902 INFO L272 TraceCheckUtils]: 55: Hoare triple {16705#(and (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,903 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16532#true} {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {16705#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {16705#(and (<= main_~k~0 20) (<= 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; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:23:42,905 INFO L272 TraceCheckUtils]: 62: Hoare triple {16727#(and (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,906 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16532#true} {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {16727#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-28 14:23:42,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {16727#(and (<= main_~k~0 20) (<= 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; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:23:42,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:23:42,907 INFO L272 TraceCheckUtils]: 69: Hoare triple {16749#(and (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,907 INFO L290 TraceCheckUtils]: 71: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,907 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16532#true} {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {16749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-28 14:23:42,909 INFO L290 TraceCheckUtils]: 74: Hoare triple {16749#(and (<= main_~k~0 20) (<= 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; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,909 INFO L290 TraceCheckUtils]: 75: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,909 INFO L272 TraceCheckUtils]: 76: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,909 INFO L290 TraceCheckUtils]: 77: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,909 INFO L290 TraceCheckUtils]: 78: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,910 INFO L290 TraceCheckUtils]: 79: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,910 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16532#true} {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,912 INFO L290 TraceCheckUtils]: 81: Hoare triple {16771#(and (<= 9 main_~c~0) (<= main_~k~0 20) (<= 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; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,912 INFO L290 TraceCheckUtils]: 82: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,912 INFO L272 TraceCheckUtils]: 83: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,912 INFO L290 TraceCheckUtils]: 84: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,912 INFO L290 TraceCheckUtils]: 85: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,912 INFO L290 TraceCheckUtils]: 86: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,913 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16532#true} {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,914 INFO L290 TraceCheckUtils]: 88: Hoare triple {16793#(and (<= 10 main_~c~0) (<= main_~k~0 20) (<= 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; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,914 INFO L290 TraceCheckUtils]: 89: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,914 INFO L272 TraceCheckUtils]: 90: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,914 INFO L290 TraceCheckUtils]: 91: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,914 INFO L290 TraceCheckUtils]: 92: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,914 INFO L290 TraceCheckUtils]: 93: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,915 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16532#true} {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,916 INFO L290 TraceCheckUtils]: 95: Hoare triple {16815#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 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; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-28 14:23:42,916 INFO L290 TraceCheckUtils]: 96: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} assume !false; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-28 14:23:42,917 INFO L272 TraceCheckUtils]: 97: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 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)); {16532#true} is VALID [2022-04-28 14:23:42,917 INFO L290 TraceCheckUtils]: 98: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,917 INFO L290 TraceCheckUtils]: 99: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,917 INFO L290 TraceCheckUtils]: 100: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,917 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16532#true} {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} #54#return; {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0))} is VALID [2022-04-28 14:23:42,918 INFO L290 TraceCheckUtils]: 102: Hoare triple {16837#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 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; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-28 14:23:42,919 INFO L290 TraceCheckUtils]: 103: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} assume !false; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-28 14:23:42,919 INFO L272 TraceCheckUtils]: 104: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 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)); {16532#true} is VALID [2022-04-28 14:23:42,919 INFO L290 TraceCheckUtils]: 105: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,919 INFO L290 TraceCheckUtils]: 106: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,919 INFO L290 TraceCheckUtils]: 107: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,919 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16532#true} {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} #54#return; {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0))} is VALID [2022-04-28 14:23:42,920 INFO L290 TraceCheckUtils]: 109: Hoare triple {16859#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 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; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-28 14:23:42,920 INFO L290 TraceCheckUtils]: 110: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} assume !false; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-28 14:23:42,921 INFO L272 TraceCheckUtils]: 111: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 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)); {16532#true} is VALID [2022-04-28 14:23:42,921 INFO L290 TraceCheckUtils]: 112: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,921 INFO L290 TraceCheckUtils]: 113: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,921 INFO L290 TraceCheckUtils]: 114: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,921 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16532#true} {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} #54#return; {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-28 14:23:42,923 INFO L290 TraceCheckUtils]: 116: Hoare triple {16881#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 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; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-28 14:23:42,923 INFO L290 TraceCheckUtils]: 117: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} assume !false; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-28 14:23:42,923 INFO L272 TraceCheckUtils]: 118: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 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)); {16532#true} is VALID [2022-04-28 14:23:42,923 INFO L290 TraceCheckUtils]: 119: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,923 INFO L290 TraceCheckUtils]: 120: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,923 INFO L290 TraceCheckUtils]: 121: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,924 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16532#true} {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} #54#return; {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-28 14:23:42,925 INFO L290 TraceCheckUtils]: 123: Hoare triple {16903#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 15 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; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-28 14:23:42,925 INFO L290 TraceCheckUtils]: 124: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} assume !false; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-28 14:23:42,925 INFO L272 TraceCheckUtils]: 125: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 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)); {16532#true} is VALID [2022-04-28 14:23:42,925 INFO L290 TraceCheckUtils]: 126: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,925 INFO L290 TraceCheckUtils]: 127: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,925 INFO L290 TraceCheckUtils]: 128: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,926 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16532#true} {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} #54#return; {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 main_~c~0))} is VALID [2022-04-28 14:23:42,927 INFO L290 TraceCheckUtils]: 130: Hoare triple {16925#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 16 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; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-28 14:23:42,927 INFO L290 TraceCheckUtils]: 131: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} assume !false; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-28 14:23:42,927 INFO L272 TraceCheckUtils]: 132: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 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)); {16532#true} is VALID [2022-04-28 14:23:42,927 INFO L290 TraceCheckUtils]: 133: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,927 INFO L290 TraceCheckUtils]: 134: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,927 INFO L290 TraceCheckUtils]: 135: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,928 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16532#true} {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} #54#return; {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 main_~c~0))} is VALID [2022-04-28 14:23:42,929 INFO L290 TraceCheckUtils]: 137: Hoare triple {16947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 17 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; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,929 INFO L290 TraceCheckUtils]: 138: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,929 INFO L272 TraceCheckUtils]: 139: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 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)); {16532#true} is VALID [2022-04-28 14:23:42,929 INFO L290 TraceCheckUtils]: 140: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,929 INFO L290 TraceCheckUtils]: 141: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,929 INFO L290 TraceCheckUtils]: 142: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,930 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16532#true} {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-28 14:23:42,931 INFO L290 TraceCheckUtils]: 144: Hoare triple {16969#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 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; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-28 14:23:42,932 INFO L290 TraceCheckUtils]: 145: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} assume !false; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-28 14:23:42,932 INFO L272 TraceCheckUtils]: 146: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 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)); {16532#true} is VALID [2022-04-28 14:23:42,932 INFO L290 TraceCheckUtils]: 147: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,932 INFO L290 TraceCheckUtils]: 148: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,932 INFO L290 TraceCheckUtils]: 149: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,933 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16532#true} {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} #54#return; {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0))} is VALID [2022-04-28 14:23:42,934 INFO L290 TraceCheckUtils]: 151: Hoare triple {16991#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 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; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-28 14:23:42,934 INFO L290 TraceCheckUtils]: 152: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} assume !false; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-28 14:23:42,934 INFO L272 TraceCheckUtils]: 153: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 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)); {16532#true} is VALID [2022-04-28 14:23:42,935 INFO L290 TraceCheckUtils]: 154: Hoare triple {16532#true} ~cond := #in~cond; {16532#true} is VALID [2022-04-28 14:23:42,935 INFO L290 TraceCheckUtils]: 155: Hoare triple {16532#true} assume !(0 == ~cond); {16532#true} is VALID [2022-04-28 14:23:42,935 INFO L290 TraceCheckUtils]: 156: Hoare triple {16532#true} assume true; {16532#true} is VALID [2022-04-28 14:23:42,935 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16532#true} {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} #54#return; {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 main_~c~0))} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 158: Hoare triple {17013#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 20 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; {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 159: Hoare triple {16533#false} assume !false; {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L272 TraceCheckUtils]: 160: Hoare triple {16533#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)); {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 161: Hoare triple {16533#false} ~cond := #in~cond; {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 162: Hoare triple {16533#false} assume !(0 == ~cond); {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 163: Hoare triple {16533#false} assume true; {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16533#false} {16533#false} #54#return; {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 165: Hoare triple {16533#false} assume !(~c~0 < ~k~0); {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L272 TraceCheckUtils]: 166: Hoare triple {16533#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 167: Hoare triple {16533#false} ~cond := #in~cond; {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 168: Hoare triple {16533#false} assume 0 == ~cond; {16533#false} is VALID [2022-04-28 14:23:42,937 INFO L290 TraceCheckUtils]: 169: Hoare triple {16533#false} assume !false; {16533#false} is VALID [2022-04-28 14:23:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 819 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2022-04-28 14:23:42,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:23:42,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:42,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462649270] [2022-04-28 14:23:42,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:42,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430983704] [2022-04-28 14:23:42,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430983704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:42,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:42,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 14:23:42,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:42,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1547160866] [2022-04-28 14:23:42,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1547160866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:42,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:42,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 14:23:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262444051] [2022-04-28 14:23:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-28 14:23:42,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:42,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 14:23:43,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:43,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 14:23:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 14:23:43,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2022-04-28 14:23:43,043 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 14:23:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:44,483 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-28 14:23:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 14:23:44,484 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-28 14:23:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 14:23:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 110 transitions. [2022-04-28 14:23:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 14:23:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 110 transitions. [2022-04-28 14:23:44,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 110 transitions. [2022-04-28 14:23:44,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:44,636 INFO L225 Difference]: With dead ends: 95 [2022-04-28 14:23:44,636 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:23:44,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=418, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:23:44,637 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:44,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 548 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:23:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:23:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:23:44,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:44,638 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:23:44,638 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:23:44,638 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:23:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:44,638 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:23:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:23:44,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:44,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:44,638 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:23:44,638 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:23:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:44,638 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:23:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:23:44,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:44,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:44,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:44,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:44,639 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:23:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:23:44,639 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2022-04-28 14:23:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:44,639 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:23:44,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 23 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-28 14:23:44,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:23:44,639 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:23:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:23:44,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:44,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:23:44,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:44,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:44,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:23:46,696 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 14:23:46,697 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 14:23:46,697 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 14:23:46,697 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-28 14:23:46,697 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:23:46,697 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:23:46,697 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:23:46,697 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-28 14:23:46,697 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.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 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-28 14:23:46,697 INFO L895 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.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 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-28 14:23:46,698 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.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 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and .cse0 (< 18 main_~k~0) (= 19 main_~y~0) .cse1 (= 19 main_~c~0)) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (<= main_~c~0 20) .cse0 (< 19 main_~k~0) (= main_~y~0 20) (<= 20 main_~c~0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3)) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-28 14:23:46,698 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse2 (+ (- 2) main_~y~0)) (.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_~k~0 6) (< 5 main_~k~0) .cse0 (<= main_~c~0 6) (= 5 .cse1)) (and (= (+ main_~y~0 (- 6)) 9) (< 14 main_~k~0) (<= main_~c~0 15) (<= main_~k~0 15) .cse0) (and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (<= main_~c~0 10) (< 9 main_~k~0) .cse0) (and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse0) (and (<= main_~c~0 20) (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20) .cse0) (and (<= main_~c~0 17) (<= main_~k~0 17) (= 16 .cse1) .cse0 (< 16 main_~k~0)) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0) .cse0) (and (< 12 main_~k~0) (<= main_~c~0 13) (<= main_~k~0 13) (= main_~y~0 13) .cse0) (and (= .cse1 0) (<= main_~k~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= 3 .cse1) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (< 1 main_~k~0) (= .cse2 0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (< 17 main_~k~0) (<= main_~c~0 18) (<= main_~k~0 18) .cse0 (= .cse1 17)) (and (= main_~y~0 14) (< 13 main_~k~0) .cse0 (<= main_~k~0 14) (<= main_~c~0 14)) (and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0) .cse0 (<= main_~k~0 12)) (and (< 7 main_~k~0) (<= main_~c~0 8) (= .cse2 6) (<= main_~k~0 8) .cse0) (and (<= main_~k~0 7) (<= main_~c~0 7) (= 7 main_~y~0) .cse0 (< 6 main_~k~0)) (and (<= main_~k~0 16) (= main_~y~0 16) .cse0 (< 15 main_~k~0) (<= main_~c~0 16)) (and (< 18 main_~k~0) (<= main_~c~0 19) (<= main_~k~0 19) (= 19 main_~y~0) .cse0) (and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11) .cse0))) [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 14:23:46,698 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 20) (<= 0 main_~k~0)) [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-28 14:23:46,698 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:23:46,698 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:23:46,698 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:23:46,698 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:23:46,698 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 14:23:46,699 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:23:46,699 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:23:46,699 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:23:46,699 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:23:46,699 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:23:46,701 INFO L356 BasicCegarLoop]: Path program histogram: [42, 2, 2, 2] [2022-04-28 14:23:46,702 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:23:46,704 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:23:46,716 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:23:46,811 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:23:46,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:23:46 BoogieIcfgContainer [2022-04-28 14:23:46,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:23:46,833 INFO L158 Benchmark]: Toolchain (without parser) took 88905.83ms. Allocated memory was 215.0MB in the beginning and 350.2MB in the end (delta: 135.3MB). Free memory was 165.5MB in the beginning and 163.5MB in the end (delta: 2.0MB). Peak memory consumption was 185.5MB. Max. memory is 8.0GB. [2022-04-28 14:23:46,833 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 215.0MB. Free memory is still 181.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:23:46,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.11ms. Allocated memory is still 215.0MB. Free memory was 165.3MB in the beginning and 189.8MB in the end (delta: -24.5MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-28 14:23:46,833 INFO L158 Benchmark]: Boogie Preprocessor took 32.31ms. Allocated memory is still 215.0MB. Free memory was 189.8MB in the beginning and 188.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:23:46,834 INFO L158 Benchmark]: RCFGBuilder took 233.76ms. Allocated memory is still 215.0MB. Free memory was 188.3MB in the beginning and 177.3MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:23:46,834 INFO L158 Benchmark]: TraceAbstraction took 88415.89ms. Allocated memory was 215.0MB in the beginning and 350.2MB in the end (delta: 135.3MB). Free memory was 176.7MB in the beginning and 163.5MB in the end (delta: 13.3MB). Peak memory consumption was 197.5MB. Max. memory is 8.0GB. [2022-04-28 14:23:46,834 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.26ms. Allocated memory is still 215.0MB. Free memory is still 181.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.11ms. Allocated memory is still 215.0MB. Free memory was 165.3MB in the beginning and 189.8MB in the end (delta: -24.5MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.31ms. Allocated memory is still 215.0MB. Free memory was 189.8MB in the beginning and 188.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 233.76ms. Allocated memory is still 215.0MB. Free memory was 188.3MB in the beginning and 177.3MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 88415.89ms. Allocated memory was 215.0MB in the beginning and 350.2MB in the end (delta: 135.3MB). Free memory was 176.7MB in the beginning and 163.5MB in the end (delta: 13.3MB). Peak memory consumption was 197.5MB. 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: 88.3s, OverallIterations: 24, TraceHistogramMax: 23, PathProgramHistogramMax: 42, EmptinessCheckTime: 0.0s, AutomataDifference: 33.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 10579 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9364 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13155 IncrementalHoareTripleChecker+Invalid, 13185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1215 mSDtfsCounter, 13155 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2767 GetRequests, 2274 SyntacticMatches, 22 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=23, InterpolantAutomatonStates: 369, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 316 PreInvPairs, 504 NumberOfFragments, 2797 HoareAnnotationTreeSize, 316 FomulaSimplifications, 2055 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 38 FormulaSimplificationTreeSizeReductionInter, 1.5s 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 <= 20 && c == 16) && y == 16) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 15 < k) || ((((7 == y && 7 == c) && k <= 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 6 < k)) || ((((y == 9 && k <= 20) && c == 9) && 8 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1)) || ((((7 < k && y == 8) && k <= 20) && c == 8) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((c == 17 && k <= 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 16 < k) && y == 17)) || ((((y == 12 && k <= 20) && c == 12) && 11 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((17 < k && k <= 20) && c == 18) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && y == 18)) || ((((k <= 20 && 5 == c) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 4 < k)) || ((((k <= 20 && y == 10) && 9 < k) && c == 10) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && 18 < k) && 19 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 19 == c)) || ((((c == 15 && k <= 20) && y == 15) && 14 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || (((((c <= 20 && k <= 20) && 19 < k) && y == 20) && 20 <= c) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 2 && 1 < k) && k <= 20) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((12 < k && k <= 20) && c == 13) && y == 13) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((10 < k && k <= 20) && c == 11) && y == 11) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 6 && k <= 20) && c == 6) && 5 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 3) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c < k + 1) && c == 3)) || ((((y == 14 && k <= 20) && 13 < k) && c == 14) && 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: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 14:23:46,865 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...