/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:57:12,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:57:12,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:57:12,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:57:12,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:57:12,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:57:12,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:57:12,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:57:12,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:57:12,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:57:12,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:57:12,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:57:12,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:57:12,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:57:12,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:57:12,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:57:12,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:57:12,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:57:12,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:57:12,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:57:12,830 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:57:12,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:57:12,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:57:12,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:57:12,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:57:12,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:57:12,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:57:12,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:57:12,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:57:12,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:57:12,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:57:12,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:57:12,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:57:12,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:57:12,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:57:12,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:57:12,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:57:12,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:57:12,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:57:12,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:57:12,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:57:12,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:57:12,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:57:12,851 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:57:12,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:57:12,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:57:12,853 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:57:12,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:57:12,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:57:12,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:57:12,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:57:12,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:57:12,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:57:12,854 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:57:12,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:57:12,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:57:12,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:57:12,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:57:12,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:57:12,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:57:12,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:57:12,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:57:12,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:57:12,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:57:12,856 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:57:12,856 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:57:12,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:57:12,856 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:57:12,856 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 07:57:13,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:57:13,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:57:13,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:57:13,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:57:13,082 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:57:13,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-28 07:57:13,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46686d077/47056a3dc60a4c62b63bd290a4329081/FLAGd924b9d9d [2022-04-28 07:57:13,560 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:57:13,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-28 07:57:13,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46686d077/47056a3dc60a4c62b63bd290a4329081/FLAGd924b9d9d [2022-04-28 07:57:13,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46686d077/47056a3dc60a4c62b63bd290a4329081 [2022-04-28 07:57:13,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:57:13,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:57:13,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:57:13,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:57:13,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:57:13,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:57:13" (1/1) ... [2022-04-28 07:57:13,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@acbe965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:13, skipping insertion in model container [2022-04-28 07:57:13,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:57:13" (1/1) ... [2022-04-28 07:57:13,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:57:13,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:57:14,144 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/ps6-ll_unwindbound20.c[458,471] [2022-04-28 07:57:14,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:57:14,193 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:57:14,207 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/ps6-ll_unwindbound20.c[458,471] [2022-04-28 07:57:14,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:57:14,228 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:57:14,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14 WrapperNode [2022-04-28 07:57:14,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:57:14,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:57:14,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:57:14,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:57:14,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (1/1) ... [2022-04-28 07:57:14,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (1/1) ... [2022-04-28 07:57:14,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (1/1) ... [2022-04-28 07:57:14,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (1/1) ... [2022-04-28 07:57:14,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (1/1) ... [2022-04-28 07:57:14,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (1/1) ... [2022-04-28 07:57:14,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (1/1) ... [2022-04-28 07:57:14,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:57:14,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:57:14,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:57:14,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:57:14,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (1/1) ... [2022-04-28 07:57:14,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:57:14,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:14,285 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 07:57:14,292 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 07:57:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:57:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:57:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:57:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:57:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:57:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:57:14,325 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:57:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:57:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:57:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:57:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:57:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:57:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:57:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:57:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:57:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:57:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:57:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:57:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:57:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:57:14,377 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:57:14,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:57:14,497 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:57:14,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:57:14,504 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:57:14,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:57:14 BoogieIcfgContainer [2022-04-28 07:57:14,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:57:14,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:57:14,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:57:14,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:57:14,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:57:13" (1/3) ... [2022-04-28 07:57:14,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bc4b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:57:14, skipping insertion in model container [2022-04-28 07:57:14,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:14" (2/3) ... [2022-04-28 07:57:14,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bc4b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:57:14, skipping insertion in model container [2022-04-28 07:57:14,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:57:14" (3/3) ... [2022-04-28 07:57:14,526 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2022-04-28 07:57:14,540 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:57:14,540 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:57:14,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:57:14,611 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@7eefdb13, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68fc76e7 [2022-04-28 07:57:14,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:57:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:57:14,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:14,628 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 07:57:14,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 07:57:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:14,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [614017951] [2022-04-28 07:57:14,649 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:57:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 07:57:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:14,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407825032] [2022-04-28 07:57:14,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:14,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:57:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:14,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 07:57:14,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:57:14,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:57:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:57:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:14,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:57:14,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:57:14,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:57:14,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:57:14,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:57:14,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 07:57:14,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:57:14,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:57:14,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 07:57:14,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 07:57:14,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 07:57:14,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:57:14,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:57:14,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:57:14,830 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:57:14,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 07:57:14,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 07:57:14,831 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-28 07:57:14,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:57:14,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:57:14,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:57:14,832 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 07:57:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:14,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407825032] [2022-04-28 07:57:14,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407825032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:14,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:14,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:57:14,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:14,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [614017951] [2022-04-28 07:57:14,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [614017951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:14,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:14,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:57:14,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474317134] [2022-04-28 07:57:14,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:14,842 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 07:57:14,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:14,850 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 07:57:14,887 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 07:57:14,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:57:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:57:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:57:14,908 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:15,278 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 07:57:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:57:15,278 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 07:57:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:15,280 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 07:57:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:57:15,288 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 07:57:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:57:15,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 07:57:15,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:15,384 INFO L225 Difference]: With dead ends: 50 [2022-04-28 07:57:15,384 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 07:57:15,387 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 07:57:15,393 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:15,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:57:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 07:57:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 07:57:15,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:15,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:15,430 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:15,430 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:15,435 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:57:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:57:15,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:15,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:15,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 07:57:15,437 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 07:57:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:15,440 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:57:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:57:15,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:15,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:15,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:15,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:57:15,445 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 07:57:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:15,445 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:57:15,445 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 07:57:15,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:57:15,474 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 07:57:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:57:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:57:15,476 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:15,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:15,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:57:15,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 07:57:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:15,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086060939] [2022-04-28 07:57:15,491 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:57:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 07:57:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:15,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160587597] [2022-04-28 07:57:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:15,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:15,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621548097] [2022-04-28 07:57:15,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:15,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:15,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:15,559 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 07:57:15,576 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 07:57:15,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:57:15,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:15,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:57:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:15,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:15,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 07:57:15,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:15,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-28 07:57:15,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {243#false} is VALID [2022-04-28 07:57:15,856 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {243#false} is VALID [2022-04-28 07:57:15,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 07:57:15,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 07:57:15,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 07:57:15,859 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 07:57:15,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:57:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:15,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160587597] [2022-04-28 07:57:15,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:15,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621548097] [2022-04-28 07:57:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621548097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:15,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:15,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:57:15,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086060939] [2022-04-28 07:57:15,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086060939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:15,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:15,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:57:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228344405] [2022-04-28 07:57:15,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:15,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 07:57:15,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:15,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:15,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:15,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:57:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:57:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:57:15,887 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:16,007 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:57:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:57:16,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 07:57:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:57:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:57:16,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 07:57:16,049 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 07:57:16,051 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:57:16,051 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 07:57:16,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:57:16,052 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:16,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 07:57:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 07:57:16,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:16,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:16,067 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:16,067 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:16,070 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:57:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:16,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:16,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:16,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 07:57:16,071 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 07:57:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:16,073 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:57:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:16,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:16,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:16,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:16,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 07:57:16,077 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 07:57:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:16,077 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 07:57:16,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:16,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 07:57:16,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:57:16,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:16,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:16,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:16,309 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 07:57:16,309 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 07:57:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:16,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507090646] [2022-04-28 07:57:16,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:57:16,311 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 07:57:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:16,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864238690] [2022-04-28 07:57:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:16,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:16,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723461686] [2022-04-28 07:57:16,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:16,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:16,331 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 07:57:16,332 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 07:57:16,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:57:16,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:16,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:57:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:16,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:16,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 07:57:16,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID [2022-04-28 07:57:16,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:57:16,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 07:57:16,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 07:57:16,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {471#true} is VALID [2022-04-28 07:57:16,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-28 07:57:16,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 07:57:16,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 07:57:16,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:57:16,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 07:57:16,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:16,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:16,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:16,497 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:16,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:16,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 07:57:16,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 07:57:16,498 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 07:57:16,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:57:16,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:16,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864238690] [2022-04-28 07:57:16,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:16,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723461686] [2022-04-28 07:57:16,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723461686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:16,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:16,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:16,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:16,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507090646] [2022-04-28 07:57:16,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507090646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:16,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:16,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104622935] [2022-04-28 07:57:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 07:57:16,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:16,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:16,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:16,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:16,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:57:16,526 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:16,702 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 07:57:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:57:16,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 07:57:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:57:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:57:16,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 07:57:16,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:16,749 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:57:16,749 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 07:57:16,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 07:57:16,750 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:16,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 07:57:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 07:57:16,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:16,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:16,769 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:16,769 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:16,771 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:57:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:16,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:16,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:16,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 07:57:16,772 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 07:57:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:16,774 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:57:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:16,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:16,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:16,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:16,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 07:57:16,777 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 07:57:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:16,777 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 07:57:16,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:16,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 07:57:16,815 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 07:57:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:57:16,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:16,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:16,846 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 07:57:17,034 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 07:57:17,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 07:57:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:17,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591789821] [2022-04-28 07:57:17,225 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:17,225 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:17,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 07:57:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:17,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171827213] [2022-04-28 07:57:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:17,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:17,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657707696] [2022-04-28 07:57:17,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:17,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:17,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:17,242 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 07:57:17,251 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 07:57:17,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:17,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:17,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:57:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:17,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:17,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:57:17,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:17,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:17,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:17,642 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:17,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:17,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:17,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:17,644 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:17,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:17,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-28 07:57:17,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-28 07:57:17,646 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-28 07:57:17,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:57:17,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:57:17,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:57:17,647 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 07:57:17,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:17,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:57:17,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:57:17,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:57:17,805 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-28 07:57:17,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-28 07:57:17,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:57:17,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 20)} is VALID [2022-04-28 07:57:17,807 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 20)} #55#return; {830#(< ~counter~0 20)} is VALID [2022-04-28 07:57:17,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:57:17,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:57:17,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:57:17,808 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {731#true} is VALID [2022-04-28 07:57:17,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-28 07:57:17,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-28 07:57:17,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 19)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:57:17,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 19)} #53#return; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:57:17,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:57:17,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:57:17,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:57:17,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 19)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 07:57:17,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 19)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:57:17,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 19)} call #t~ret6 := main(); {855#(< ~counter~0 19)} is VALID [2022-04-28 07:57:17,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 19)} {731#true} #61#return; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:57:17,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 19)} assume true; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:57:17,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:57:17,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:57:17,815 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 07:57:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:17,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171827213] [2022-04-28 07:57:17,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:17,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657707696] [2022-04-28 07:57:17,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657707696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:17,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:17,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:57:17,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:17,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1591789821] [2022-04-28 07:57:17,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1591789821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:17,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:17,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831198128] [2022-04-28 07:57:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:17,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 07:57:17,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:17,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:17,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:17,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:17,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:57:17,839 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:17,958 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:57:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:57:17,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 07:57:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:57:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:57:17,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 07:57:18,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:18,002 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:57:18,002 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:57:18,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:57:18,003 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:18,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:57:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 07:57:18,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:18,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:18,022 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:18,023 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:18,024 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:57:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:18,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:18,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:18,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:57:18,026 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:57:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:18,027 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:57:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:18,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:18,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:18,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:18,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 07:57:18,030 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 07:57:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:18,030 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 07:57:18,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:18,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 07:57:18,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:57:18,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:18,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:18,075 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 07:57:18,274 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 07:57:18,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 07:57:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:18,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [458684356] [2022-04-28 07:57:18,453 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:18,453 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:18,453 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:18,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 07:57:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:18,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508465261] [2022-04-28 07:57:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:18,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:18,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:18,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161351942] [2022-04-28 07:57:18,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:18,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:18,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:18,475 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 07:57:18,476 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 07:57:18,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:18,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:18,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:57:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:18,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:18,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:57:18,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-28 07:57:18,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:18,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:57:18,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:57:18,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 07:57:18,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:18,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:18,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:18,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:18,657 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:57:18,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:18,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:18,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:18,665 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:18,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:18,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:18,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:18,666 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:18,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:18,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:18,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:18,670 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:18,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:18,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:57:18,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:57:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:18,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:18,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:57:18,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:57:18,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:18,825 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:18,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:18,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:18,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:18,889 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #55#return; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:18,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:18,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:18,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:18,890 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:18,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:18,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:18,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:18,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:57:18,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:18,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:18,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:18,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:18,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 07:57:18,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:57:18,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:57:18,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:18,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-28 07:57:18,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:57:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 07:57:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:18,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508465261] [2022-04-28 07:57:18,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:18,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161351942] [2022-04-28 07:57:18,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161351942] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:18,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:18,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:57:18,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:18,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [458684356] [2022-04-28 07:57:18,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [458684356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:18,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:18,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118791395] [2022-04-28 07:57:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 07:57:18,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:18,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:19,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:19,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:19,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:57:19,018 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:19,172 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 07:57:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:57:19,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 07:57:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:57:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:57:19,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:57:19,313 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 07:57:19,314 INFO L225 Difference]: With dead ends: 40 [2022-04-28 07:57:19,314 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:57:19,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:57:19,315 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:19,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:57:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:57:19,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:19,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:19,345 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:19,346 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:19,347 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:57:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:57:19,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:19,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:19,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 07:57:19,348 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 07:57:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:19,349 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:57:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:57:19,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:19,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:19,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:19,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 07:57:19,352 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 07:57:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:19,352 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 07:57:19,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:19,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 07:57:19,559 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 07:57:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:57:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:57:19,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:19,560 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:19,577 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 07:57:19,761 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 07:57:19,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 07:57:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:19,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [782251679] [2022-04-28 07:57:19,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:19,899 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:19,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 07:57:19,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:19,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957756740] [2022-04-28 07:57:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:19,911 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:19,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241115635] [2022-04-28 07:57:19,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:19,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:19,913 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 07:57:19,914 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 07:57:19,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:19,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:19,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:57:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:19,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:20,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-28 07:57:20,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1504#true} is VALID [2022-04-28 07:57:20,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:20,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-28 07:57:20,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-28 07:57:20,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1504#true} is VALID [2022-04-28 07:57:20,306 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:57:20,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:57:20,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:57:20,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:20,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-28 07:57:20,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:20,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:20,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:20,308 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:57:20,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:57:20,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:57:20,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:20,312 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:20,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:57:20,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:57:20,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:57:20,314 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:57:20,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:57:20,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:57:20,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:20,315 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:57:20,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:20,316 INFO L272 TraceCheckUtils]: 28: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:57:20,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:57:20,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:57:20,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:20,317 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:20,318 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:20,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:20,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-28 07:57:20,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 07:57:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:57:20,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:20,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957756740] [2022-04-28 07:57:20,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:20,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241115635] [2022-04-28 07:57:20,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241115635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:20,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:20,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:57:20,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:20,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [782251679] [2022-04-28 07:57:20,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [782251679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:20,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:20,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:57:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236959351] [2022-04-28 07:57:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:57:20,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:20,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:20,690 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 07:57:20,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:57:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:57:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:57:20,692 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:20,947 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 07:57:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:57:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:57:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:57:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:57:20,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 07:57:20,989 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 07:57:20,990 INFO L225 Difference]: With dead ends: 44 [2022-04-28 07:57:20,990 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 07:57:20,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:57:20,992 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:20,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:57:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 07:57:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 07:57:21,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:21,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:21,023 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:21,023 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:21,025 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:57:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:57:21,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:21,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:21,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-28 07:57:21,026 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-28 07:57:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:21,027 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:57:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:57:21,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:21,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:21,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:21,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 07:57:21,029 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 07:57:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:21,030 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 07:57:21,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:21,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 07:57:21,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:57:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 07:57:21,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:21,186 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:21,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 07:57:21,391 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 07:57:21,392 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:21,392 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 07:57:21,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:21,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1642812096] [2022-04-28 07:57:21,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:21,515 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:21,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 07:57:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:21,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091144152] [2022-04-28 07:57:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:21,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:21,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366803755] [2022-04-28 07:57:21,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:21,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:21,535 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 07:57:21,537 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 07:57:21,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:21,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:21,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:57:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:21,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:21,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:57:21,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,827 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:21,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:21,830 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:21,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:21,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:21,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:21,832 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:21,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:21,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:21,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:21,834 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:21,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:21,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:21,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:21,835 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:21,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:21,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-28 07:57:21,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:57:21,837 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:57:21,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:57:21,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-28 07:57:21,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-28 07:57:21,837 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:57:21,838 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:57:21,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:57:21,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:57:21,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:57:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:21,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:22,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:57:22,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:57:22,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:57:22,112 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:57:22,113 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:57:22,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:57:22,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:57:22,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:57:22,113 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:57:22,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:57:22,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:57:22,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 20)} is VALID [2022-04-28 07:57:22,118 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 20)} #55#return; {2079#(< ~counter~0 20)} is VALID [2022-04-28 07:57:22,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:57:22,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:57:22,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:57:22,121 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:57:22,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-28 07:57:22,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-28 07:57:22,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 19)} is VALID [2022-04-28 07:57:22,123 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 19)} #55#return; {2104#(< ~counter~0 19)} is VALID [2022-04-28 07:57:22,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:57:22,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:57:22,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:57:22,124 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:57:22,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-28 07:57:22,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-28 07:57:22,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 18)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:57:22,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 18)} #53#return; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:57:22,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:57:22,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:57:22,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:57:22,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 18)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:57:22,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 18)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:57:22,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 18)} call #t~ret6 := main(); {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:57:22,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 18)} {1925#true} #61#return; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:57:22,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 18)} assume true; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:57:22,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:57:22,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:57:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:57:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091144152] [2022-04-28 07:57:22,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366803755] [2022-04-28 07:57:22,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366803755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:22,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:22,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 07:57:22,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:22,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1642812096] [2022-04-28 07:57:22,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1642812096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:22,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:22,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:57:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768902697] [2022-04-28 07:57:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:22,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 07:57:22,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:22,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,163 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 07:57:22,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 07:57:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:22,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 07:57:22,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:57:22,164 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,322 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-28 07:57:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:57:22,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 07:57:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:57:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:57:22,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 07:57:22,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:22,374 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:57:22,374 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 07:57:22,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:57:22,375 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:22,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 07:57:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 07:57:22,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:22,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:22,416 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:22,416 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,419 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:57:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:57:22,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:22,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:22,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 07:57:22,420 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 07:57:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,422 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:57:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:57:22,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:22,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:22,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:22,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 07:57:22,424 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-28 07:57:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:22,424 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 07:57:22,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 07:57:22,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:57:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 07:57:22,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:22,537 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:22,563 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 07:57:22,737 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 07:57:22,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-28 07:57:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:22,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609495132] [2022-04-28 07:57:22,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:22,855 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:22,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-28 07:57:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:22,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221864449] [2022-04-28 07:57:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:22,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:22,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953543373] [2022-04-28 07:57:22,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:22,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:22,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:22,868 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 07:57:22,870 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 07:57:22,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:22,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:22,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:57:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:22,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:23,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-28 07:57:23,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:57:23,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-28 07:57:23,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:23,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:23,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:23,219 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:57:23,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:57:23,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:57:23,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:57:23,220 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:23,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:57:23,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:57:23,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:57:23,222 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:57:23,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:57:23,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:57:23,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:57:23,223 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:57:23,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:57:23,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:57:23,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:57:23,224 INFO L272 TraceCheckUtils]: 30: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:57:23,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:57:23,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:57:23,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:57:23,225 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:57:23,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:57:23,225 INFO L272 TraceCheckUtils]: 36: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:57:23,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:57:23,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:57:23,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:57:23,226 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:57:23,227 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:23,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:23,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-28 07:57:23,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-28 07:57:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 07:57:23,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:23,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:23,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221864449] [2022-04-28 07:57:23,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:23,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953543373] [2022-04-28 07:57:23,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953543373] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:23,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:23,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:57:23,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:23,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609495132] [2022-04-28 07:57:23,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609495132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:23,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:23,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:57:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504402900] [2022-04-28 07:57:23,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 07:57:23,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:23,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:23,561 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 07:57:23,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:57:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:57:23,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:57:23,562 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:23,910 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 07:57:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:57:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 07:57:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:57:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:57:23,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 07:57:23,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:23,953 INFO L225 Difference]: With dead ends: 52 [2022-04-28 07:57:23,953 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 07:57:23,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:57:23,954 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:23,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:57:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 07:57:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 07:57:24,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:24,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:24,001 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:24,002 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:24,004 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:57:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:57:24,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:24,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:24,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 07:57:24,006 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 07:57:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:24,007 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:57:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:57:24,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:24,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:24,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:24,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-28 07:57:24,017 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-28 07:57:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:24,017 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-28 07:57:24,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:24,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-28 07:57:24,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:57:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:57:24,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:24,200 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:24,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:24,403 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 07:57:24,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-28 07:57:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:24,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1490874289] [2022-04-28 07:57:24,524 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:24,524 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:24,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-28 07:57:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:24,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377112838] [2022-04-28 07:57:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:24,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:24,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563220257] [2022-04-28 07:57:24,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:24,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:24,548 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 07:57:24,573 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 07:57:24,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:24,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:24,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:57:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:24,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:24,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 07:57:24,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,880 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:24,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:24,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:24,886 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:24,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:24,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:24,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:24,887 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:24,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:24,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:24,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:24,889 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:24,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:24,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:24,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:24,891 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:24,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:24,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:24,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:24,892 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:24,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:24,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:24,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:24,894 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:24,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {3042#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:24,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-28 07:57:24,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-28 07:57:24,895 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 07:57:24,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:57:24,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-28 07:57:24,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-28 07:57:24,895 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 07:57:24,896 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 07:57:24,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:57:24,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 07:57:24,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 07:57:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:24,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:25,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 07:57:25,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 07:57:25,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:57:25,153 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 07:57:25,153 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 07:57:25,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:57:25,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:57:25,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:57:25,154 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:57:25,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-28 07:57:25,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:57:25,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 20)} is VALID [2022-04-28 07:57:25,155 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 20)} #55#return; {3129#(< ~counter~0 20)} is VALID [2022-04-28 07:57:25,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:57:25,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:57:25,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:57:25,156 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:57:25,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-28 07:57:25,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-28 07:57:25,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 19)} is VALID [2022-04-28 07:57:25,157 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 19)} #55#return; {3154#(< ~counter~0 19)} is VALID [2022-04-28 07:57:25,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:57:25,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:57:25,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:57:25,157 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:57:25,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-28 07:57:25,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-28 07:57:25,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 18)} is VALID [2022-04-28 07:57:25,161 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 18)} #55#return; {3179#(< ~counter~0 18)} is VALID [2022-04-28 07:57:25,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:57:25,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:57:25,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:57:25,161 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:57:25,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-28 07:57:25,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-28 07:57:25,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 17)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:57:25,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 17)} #53#return; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:57:25,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:57:25,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:57:25,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:57:25,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 17)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:57:25,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 17)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:57:25,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 17)} call #t~ret6 := main(); {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:57:25,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 17)} {2950#true} #61#return; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:57:25,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 17)} assume true; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:57:25,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:57:25,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 07:57:25,166 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 07:57:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:25,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377112838] [2022-04-28 07:57:25,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:25,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563220257] [2022-04-28 07:57:25,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563220257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:25,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:25,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 07:57:25,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:25,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1490874289] [2022-04-28 07:57:25,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1490874289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:25,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:25,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:57:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429062298] [2022-04-28 07:57:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:25,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 07:57:25,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:25,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:25,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:25,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:57:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:57:25,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:57:25,213 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:25,384 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-28 07:57:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:57:25,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 07:57:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:57:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:57:25,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 07:57:25,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:25,433 INFO L225 Difference]: With dead ends: 62 [2022-04-28 07:57:25,433 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 07:57:25,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:57:25,434 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:25,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 07:57:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 07:57:25,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:25,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:25,487 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:25,487 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:25,489 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:57:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:57:25,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:25,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:25,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 07:57:25,490 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 07:57:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:25,491 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:57:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:57:25,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:25,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:25,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:25,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 07:57:25,493 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-28 07:57:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:25,493 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 07:57:25,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:25,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 07:57:25,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:57:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 07:57:25,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:25,634 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:25,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 07:57:25,843 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 07:57:25,844 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-28 07:57:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:25,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143223233] [2022-04-28 07:57:26,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:26,006 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:26,006 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-28 07:57:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:26,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964136691] [2022-04-28 07:57:26,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:26,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:26,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946234742] [2022-04-28 07:57:26,019 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:57:26,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:26,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:26,024 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 07:57:26,025 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 07:57:32,678 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:57:32,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:32,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:57:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:32,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:33,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:57:33,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-28 07:57:33,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:33,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:33,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:33,073 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:57:33,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:57:33,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:57:33,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:57:33,074 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:33,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:57:33,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:57:33,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:57:33,075 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:57:33,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:57:33,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:57:33,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:57:33,076 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:57:33,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:33,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:33,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:33,077 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:57:33,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:57:33,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:57:33,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:57:33,078 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:33,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:57:33,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:57:33,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:57:33,079 INFO L272 TraceCheckUtils]: 38: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:57:33,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:57:33,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:57:33,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:57:33,088 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:57:33,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:57:33,089 INFO L272 TraceCheckUtils]: 44: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:57:33,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:57:33,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:57:33,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:57:33,092 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:57:33,092 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:33,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:33,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-28 07:57:33,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-28 07:57:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 07:57:33,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964136691] [2022-04-28 07:57:33,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:33,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946234742] [2022-04-28 07:57:33,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946234742] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:33,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:33,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:57:33,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:33,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143223233] [2022-04-28 07:57:33,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143223233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:33,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:33,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:57:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138660201] [2022-04-28 07:57:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:33,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 07:57:33,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:33,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:57:33,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:33,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:57:33,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:33,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:57:33,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:57:33,451 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:57:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:33,853 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 07:57:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:57:33,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 07:57:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:57:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:57:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:57:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:57:33,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 07:57:33,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:33,907 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:57:33,907 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 07:57:33,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:57:33,908 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:33,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:57:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 07:57:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 07:57:33,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:33,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:33,962 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:33,962 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:33,964 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:57:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:57:33,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:33,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:33,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 07:57:33,965 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 07:57:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:33,966 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:57:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:57:33,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:33,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:33,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:33,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-28 07:57:33,968 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-28 07:57:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:33,968 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-28 07:57:33,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:57:33,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-28 07:57:34,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:57:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 07:57:34,093 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:34,093 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:34,099 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 07:57:34,294 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 07:57:34,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-28 07:57:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:34,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083779618] [2022-04-28 07:57:34,429 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:34,429 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:34,429 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-28 07:57:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:34,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534144771] [2022-04-28 07:57:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:34,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:34,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493045730] [2022-04-28 07:57:34,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:57:34,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:34,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:34,460 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 07:57:34,491 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 07:57:34,865 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 07:57:34,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:34,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:57:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:34,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:35,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 07:57:35,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {4156#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {4156#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:35,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:35,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:35,149 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:35,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:35,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:35,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:35,151 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:35,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:35,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:35,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:35,153 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:35,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:35,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:35,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:35,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:35,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {4215#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:35,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {4215#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:35,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:35,157 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:35,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:35,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:35,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:35,158 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:35,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {4240#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:35,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {4240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:35,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:35,160 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:35,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:35,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:35,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:35,162 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:35,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {4265#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:35,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {4265#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4290#(<= |main_#t~post5| 4)} is VALID [2022-04-28 07:57:35,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 07:57:35,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 07:57:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:35,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:35,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 07:57:35,541 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 07:57:35,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:57:35,541 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 07:57:35,542 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 07:57:35,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:57:35,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:57:35,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:57:35,542 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:57:35,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-28 07:57:35,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:57:35,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4352#(< ~counter~0 20)} is VALID [2022-04-28 07:57:35,544 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 20)} #55#return; {4352#(< ~counter~0 20)} is VALID [2022-04-28 07:57:35,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:57:35,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:57:35,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:57:35,544 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:57:35,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-28 07:57:35,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-28 07:57:35,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(< ~counter~0 19)} is VALID [2022-04-28 07:57:35,546 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 19)} #55#return; {4377#(< ~counter~0 19)} is VALID [2022-04-28 07:57:35,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:57:35,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:57:35,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:57:35,546 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:57:35,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-28 07:57:35,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-28 07:57:35,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4402#(< ~counter~0 18)} is VALID [2022-04-28 07:57:35,548 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 18)} #55#return; {4402#(< ~counter~0 18)} is VALID [2022-04-28 07:57:35,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:57:35,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:57:35,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:57:35,548 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:57:35,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-28 07:57:35,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-28 07:57:35,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4427#(< ~counter~0 17)} is VALID [2022-04-28 07:57:35,550 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 17)} #55#return; {4427#(< ~counter~0 17)} is VALID [2022-04-28 07:57:35,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:57:35,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:57:35,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:57:35,550 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:57:35,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-28 07:57:35,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-28 07:57:35,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 16)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:57:35,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 16)} #53#return; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:57:35,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:57:35,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:57:35,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:57:35,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 16)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:57:35,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 16)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:57:35,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 16)} call #t~ret6 := main(); {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:57:35,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 16)} {4148#true} #61#return; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:57:35,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 16)} assume true; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:57:35,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:57:35,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 07:57:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 07:57:35,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:35,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534144771] [2022-04-28 07:57:35,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:35,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493045730] [2022-04-28 07:57:35,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493045730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:35,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:35,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 07:57:35,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:35,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083779618] [2022-04-28 07:57:35,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083779618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:35,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:35,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:57:35,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688012624] [2022-04-28 07:57:35,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:35,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 07:57:35,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:35,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:35,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:35,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:57:35,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:57:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:57:35,598 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:35,784 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-28 07:57:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:57:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 07:57:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:57:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:57:35,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 07:57:35,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:35,847 INFO L225 Difference]: With dead ends: 70 [2022-04-28 07:57:35,847 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 07:57:35,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:57:35,848 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:35,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 07:57:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 07:57:35,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:35,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:35,905 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:35,905 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:35,907 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:57:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:57:35,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:35,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:35,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 07:57:35,908 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 07:57:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:35,909 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:57:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:57:35,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:35,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:35,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:35,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 07:57:35,911 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 07:57:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:35,912 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 07:57:35,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:35,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 07:57:36,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:57:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 07:57:36,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:36,038 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:36,044 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 07:57:36,239 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 07:57:36,239 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-28 07:57:36,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:36,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243909897] [2022-04-28 07:57:36,432 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:36,432 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:36,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-28 07:57:36,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:36,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13630110] [2022-04-28 07:57:36,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:36,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:36,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:36,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245555598] [2022-04-28 07:57:36,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:36,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:36,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:36,464 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 07:57:36,465 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 07:57:36,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:36,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:36,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 07:57:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:36,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:37,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 07:57:37,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4879#true} is VALID [2022-04-28 07:57:37,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:57:37,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 07:57:37,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 07:57:37,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4879#true} is VALID [2022-04-28 07:57:37,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:57:37,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:57:37,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:57:37,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:57:37,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 07:57:37,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:37,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:37,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:37,521 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:57:37,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:57:37,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:57:37,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:57:37,522 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:37,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:57:37,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:57:37,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:57:37,523 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:57:37,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:57:37,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:57:37,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:57:37,523 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:57:37,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< 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 * ~y~0 * ~y~0 + ~x~0; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:37,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:37,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:37,525 INFO L272 TraceCheckUtils]: 30: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:57:37,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:57:37,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:57:37,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:57:37,526 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #55#return; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:37,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 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 * ~y~0 * ~y~0 + ~x~0; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:37,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:37,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:37,528 INFO L272 TraceCheckUtils]: 38: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:57:37,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:57:37,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:57:37,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:57:37,528 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4879#true} {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #55#return; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:37,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 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 * ~y~0 * ~y~0 + ~x~0; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:57:37,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:57:37,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:57:37,530 INFO L272 TraceCheckUtils]: 46: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:57:37,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:57:37,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:57:37,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:57:37,530 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:57:37,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:57:37,531 INFO L272 TraceCheckUtils]: 52: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:57:37,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:57:37,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:57:37,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:57:37,532 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:57:37,532 INFO L272 TraceCheckUtils]: 57: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:37,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:37,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 07:57:37,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 07:57:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 07:57:37,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:38,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:38,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13630110] [2022-04-28 07:57:38,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:38,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245555598] [2022-04-28 07:57:38,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245555598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:38,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:38,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:57:38,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:38,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243909897] [2022-04-28 07:57:38,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243909897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:38,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:38,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:57:38,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465764535] [2022-04-28 07:57:38,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:38,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 61 [2022-04-28 07:57:38,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:38,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 07:57:38,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:38,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:57:38,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:38,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:57:38,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:57:38,223 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 07:57:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:38,791 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 07:57:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:57:38,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 61 [2022-04-28 07:57:38,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 07:57:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 07:57:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 07:57:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 07:57:38,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-28 07:57:38,847 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 07:57:38,848 INFO L225 Difference]: With dead ends: 68 [2022-04-28 07:57:38,848 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 07:57:38,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:57:38,849 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:38,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:57:38,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 07:57:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 07:57:38,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:38,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:38,916 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:38,916 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:38,917 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:57:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:57:38,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:38,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:38,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 07:57:38,918 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 07:57:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:38,919 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:57:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:57:38,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:38,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:38,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:38,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 07:57:38,922 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-28 07:57:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:38,923 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 07:57:38,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 07:57:38,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 07:57:39,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:57:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 07:57:39,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:39,076 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:39,082 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 07:57:39,276 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 07:57:39,276 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-28 07:57:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:39,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943412257] [2022-04-28 07:57:39,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:39,390 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:39,390 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-28 07:57:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:39,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478582146] [2022-04-28 07:57:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:39,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:39,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456378634] [2022-04-28 07:57:39,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:39,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:39,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:39,407 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 07:57:39,422 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 07:57:39,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:39,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:39,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 07:57:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:39,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:39,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 07:57:39,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {5602#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {5602#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,783 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {5602#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:39,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {5602#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:39,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:39,785 INFO L272 TraceCheckUtils]: 14: Hoare triple {5636#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:39,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:39,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:39,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:39,786 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:39,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {5636#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:39,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {5636#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:39,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:39,788 INFO L272 TraceCheckUtils]: 22: Hoare triple {5661#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:39,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:39,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:39,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:39,790 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:39,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {5661#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:39,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {5661#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:39,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:39,792 INFO L272 TraceCheckUtils]: 30: Hoare triple {5686#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:39,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:39,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:39,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:39,794 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:39,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {5686#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:39,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {5686#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:39,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:39,796 INFO L272 TraceCheckUtils]: 38: Hoare triple {5711#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:39,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:39,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:39,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:39,798 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:39,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {5711#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:39,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:39,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:39,800 INFO L272 TraceCheckUtils]: 46: Hoare triple {5736#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:39,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:39,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:39,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:39,802 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:39,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {5736#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:39,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5761#(<= |main_#t~post5| 5)} is VALID [2022-04-28 07:57:39,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 07:57:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:39,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:40,164 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 07:57:40,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 07:57:40,164 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:57:40,164 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-28 07:57:40,164 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 07:57:40,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:40,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:40,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:40,165 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:57:40,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-28 07:57:40,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:57:40,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5823#(< ~counter~0 20)} is VALID [2022-04-28 07:57:40,166 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 20)} #55#return; {5823#(< ~counter~0 20)} is VALID [2022-04-28 07:57:40,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:40,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:40,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:40,166 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:57:40,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5823#(< ~counter~0 20)} is VALID [2022-04-28 07:57:40,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 20)} is VALID [2022-04-28 07:57:40,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5848#(< ~counter~0 19)} is VALID [2022-04-28 07:57:40,168 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 19)} #55#return; {5848#(< ~counter~0 19)} is VALID [2022-04-28 07:57:40,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:40,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:40,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:40,168 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:57:40,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5848#(< ~counter~0 19)} is VALID [2022-04-28 07:57:40,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 19)} is VALID [2022-04-28 07:57:40,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5873#(< ~counter~0 18)} is VALID [2022-04-28 07:57:40,169 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 18)} #55#return; {5873#(< ~counter~0 18)} is VALID [2022-04-28 07:57:40,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:40,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:40,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:40,170 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:57:40,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5873#(< ~counter~0 18)} is VALID [2022-04-28 07:57:40,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 18)} is VALID [2022-04-28 07:57:40,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5898#(< ~counter~0 17)} is VALID [2022-04-28 07:57:40,171 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 17)} #55#return; {5898#(< ~counter~0 17)} is VALID [2022-04-28 07:57:40,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:40,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:40,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:40,171 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:57:40,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5898#(< ~counter~0 17)} is VALID [2022-04-28 07:57:40,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 17)} is VALID [2022-04-28 07:57:40,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {5923#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5923#(< ~counter~0 16)} is VALID [2022-04-28 07:57:40,172 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5923#(< ~counter~0 16)} #55#return; {5923#(< ~counter~0 16)} is VALID [2022-04-28 07:57:40,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:40,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:40,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:40,173 INFO L272 TraceCheckUtils]: 14: Hoare triple {5923#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:57:40,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {5923#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {5923#(< ~counter~0 16)} is VALID [2022-04-28 07:57:40,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5923#(< ~counter~0 16)} is VALID [2022-04-28 07:57:40,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {5948#(< ~counter~0 15)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5948#(< ~counter~0 15)} is VALID [2022-04-28 07:57:40,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5948#(< ~counter~0 15)} #53#return; {5948#(< ~counter~0 15)} is VALID [2022-04-28 07:57:40,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:40,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:40,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:40,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {5948#(< ~counter~0 15)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:57:40,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#(< ~counter~0 15)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5948#(< ~counter~0 15)} is VALID [2022-04-28 07:57:40,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#(< ~counter~0 15)} call #t~ret6 := main(); {5948#(< ~counter~0 15)} is VALID [2022-04-28 07:57:40,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#(< ~counter~0 15)} {5594#true} #61#return; {5948#(< ~counter~0 15)} is VALID [2022-04-28 07:57:40,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#(< ~counter~0 15)} assume true; {5948#(< ~counter~0 15)} is VALID [2022-04-28 07:57:40,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5948#(< ~counter~0 15)} is VALID [2022-04-28 07:57:40,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 07:57:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 07:57:40,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:40,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478582146] [2022-04-28 07:57:40,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:40,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456378634] [2022-04-28 07:57:40,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456378634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:40,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:40,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 07:57:40,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:40,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943412257] [2022-04-28 07:57:40,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943412257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:40,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:40,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:57:40,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538020292] [2022-04-28 07:57:40,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:40,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-28 07:57:40,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:40,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:40,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:40,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:57:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:40,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:57:40,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:57:40,224 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:40,473 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-28 07:57:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:57:40,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-28 07:57:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 07:57:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 07:57:40,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-28 07:57:40,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:40,531 INFO L225 Difference]: With dead ends: 78 [2022-04-28 07:57:40,531 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 07:57:40,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:57:40,532 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:40,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:57:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 07:57:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 07:57:40,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:40,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:40,619 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:40,619 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:40,622 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:57:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:57:40,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:40,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:40,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-28 07:57:40,623 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-28 07:57:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:40,627 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:57:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:57:40,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:40,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:40,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:40,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-28 07:57:40,628 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-28 07:57:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:40,629 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-28 07:57:40,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:57:40,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-28 07:57:40,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:57:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 07:57:40,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:40,819 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:40,835 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 07:57:41,019 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 07:57:41,019 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-28 07:57:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:41,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486657665] [2022-04-28 07:57:41,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:41,128 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:41,128 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-28 07:57:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:41,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295839323] [2022-04-28 07:57:41,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:41,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:41,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172910620] [2022-04-28 07:57:41,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:41,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:41,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:41,140 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 07:57:41,143 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 07:57:41,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:41,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:41,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:57:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:41,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:41,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #61#return; {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret6 := main(); {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#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; {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L272 TraceCheckUtils]: 6: Hoare triple {6425#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,590 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6425#true} {6425#true} #53#return; {6425#true} is VALID [2022-04-28 07:57:41,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {6425#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:41,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:41,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:41,592 INFO L272 TraceCheckUtils]: 14: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-28 07:57:41,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:41,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:41,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,592 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6425#true} {6463#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:41,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:41,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:41,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:41,593 INFO L272 TraceCheckUtils]: 22: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-28 07:57:41,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:41,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:41,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,594 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6425#true} {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:41,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {6488#(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 * ~y~0 * ~y~0 + ~x~0; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:41,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:41,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:41,596 INFO L272 TraceCheckUtils]: 30: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-28 07:57:41,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:41,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:41,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,596 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6425#true} {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:41,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:41,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:41,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:41,597 INFO L272 TraceCheckUtils]: 38: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-28 07:57:41,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:41,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:41,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,598 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6425#true} {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:41,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:57:41,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:57:41,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:57:41,599 INFO L272 TraceCheckUtils]: 46: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-28 07:57:41,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:41,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:41,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,600 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6425#true} {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:57:41,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {6563#(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 * ~y~0 * ~y~0 + ~x~0; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:57:41,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:57:41,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:57:41,601 INFO L272 TraceCheckUtils]: 54: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-28 07:57:41,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:41,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:41,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,601 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6425#true} {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:57:41,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:57:41,602 INFO L272 TraceCheckUtils]: 60: Hoare triple {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-28 07:57:41,602 INFO L290 TraceCheckUtils]: 61: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:41,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:41,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:41,603 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6425#true} {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:57:41,603 INFO L272 TraceCheckUtils]: 65: Hoare triple {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:41,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:41,604 INFO L290 TraceCheckUtils]: 67: Hoare triple {6636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6426#false} is VALID [2022-04-28 07:57:41,604 INFO L290 TraceCheckUtils]: 68: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-28 07:57:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 07:57:41,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:41,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295839323] [2022-04-28 07:57:41,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172910620] [2022-04-28 07:57:41,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172910620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:41,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:41,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:57:41,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486657665] [2022-04-28 07:57:41,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486657665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:41,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:41,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:57:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674900934] [2022-04-28 07:57:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:41,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-28 07:57:41,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:41,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:57:41,920 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 07:57:41,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:57:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:41,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:57:41,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:57:41,921 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:57:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:42,607 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 07:57:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:57:42,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-28 07:57:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:57:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 07:57:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:57:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 07:57:42,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 07:57:42,667 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 07:57:42,668 INFO L225 Difference]: With dead ends: 76 [2022-04-28 07:57:42,668 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 07:57:42,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:57:42,669 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:42,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:57:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 07:57:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 07:57:42,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:42,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:42,744 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:42,744 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:42,745 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 07:57:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:57:42,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:42,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:42,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-28 07:57:42,746 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-28 07:57:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:42,747 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 07:57:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:57:42,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:42,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:42,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:42,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 07:57:42,749 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-28 07:57:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:42,749 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 07:57:42,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:57:42,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 07:57:42,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:57:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 07:57:42,886 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:42,886 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:42,902 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 07:57:43,087 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 07:57:43,088 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-28 07:57:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:43,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092699359] [2022-04-28 07:57:43,190 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:43,190 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:43,191 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-28 07:57:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:43,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002997030] [2022-04-28 07:57:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:43,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:43,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775098942] [2022-04-28 07:57:43,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:43,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:43,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:43,203 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 07:57:43,204 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 07:57:43,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:43,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:43,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 07:57:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:43,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:43,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-28 07:57:43,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7146#(<= ~counter~0 0)} {7138#true} #61#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {7146#(<= ~counter~0 0)} call #t~ret6 := main(); {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {7146#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,583 INFO L272 TraceCheckUtils]: 6: Hoare triple {7146#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {7146#(<= ~counter~0 0)} ~cond := #in~cond; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {7146#(<= ~counter~0 0)} assume !(0 == ~cond); {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7146#(<= ~counter~0 0)} {7146#(<= ~counter~0 0)} #53#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {7146#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:43,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {7146#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:43,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {7180#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:43,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {7180#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:43,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {7180#(<= ~counter~0 1)} ~cond := #in~cond; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:43,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {7180#(<= ~counter~0 1)} assume !(0 == ~cond); {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:43,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {7180#(<= ~counter~0 1)} assume true; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:43,587 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7180#(<= ~counter~0 1)} {7180#(<= ~counter~0 1)} #55#return; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:43,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {7180#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:43,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {7180#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:43,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {7205#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:43,606 INFO L272 TraceCheckUtils]: 22: Hoare triple {7205#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:43,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {7205#(<= ~counter~0 2)} ~cond := #in~cond; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:43,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {7205#(<= ~counter~0 2)} assume !(0 == ~cond); {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:43,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {7205#(<= ~counter~0 2)} assume true; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:43,607 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7205#(<= ~counter~0 2)} {7205#(<= ~counter~0 2)} #55#return; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:43,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {7205#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:43,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {7205#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:43,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {7230#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:43,609 INFO L272 TraceCheckUtils]: 30: Hoare triple {7230#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:43,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {7230#(<= ~counter~0 3)} ~cond := #in~cond; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:43,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {7230#(<= ~counter~0 3)} assume !(0 == ~cond); {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:43,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {7230#(<= ~counter~0 3)} assume true; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:43,610 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7230#(<= ~counter~0 3)} {7230#(<= ~counter~0 3)} #55#return; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:43,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {7230#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:43,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {7230#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:43,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {7255#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:43,612 INFO L272 TraceCheckUtils]: 38: Hoare triple {7255#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:43,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {7255#(<= ~counter~0 4)} ~cond := #in~cond; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:43,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {7255#(<= ~counter~0 4)} assume !(0 == ~cond); {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:43,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {7255#(<= ~counter~0 4)} assume true; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:43,613 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7255#(<= ~counter~0 4)} {7255#(<= ~counter~0 4)} #55#return; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:43,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {7255#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:43,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {7255#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:43,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {7280#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:43,614 INFO L272 TraceCheckUtils]: 46: Hoare triple {7280#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:43,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {7280#(<= ~counter~0 5)} ~cond := #in~cond; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:43,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {7280#(<= ~counter~0 5)} assume !(0 == ~cond); {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:43,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {7280#(<= ~counter~0 5)} assume true; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:43,615 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7280#(<= ~counter~0 5)} {7280#(<= ~counter~0 5)} #55#return; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:43,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {7280#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:43,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {7280#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:43,616 INFO L290 TraceCheckUtils]: 53: Hoare triple {7305#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:43,617 INFO L272 TraceCheckUtils]: 54: Hoare triple {7305#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:43,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {7305#(<= ~counter~0 6)} ~cond := #in~cond; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:43,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {7305#(<= ~counter~0 6)} assume !(0 == ~cond); {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:43,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= ~counter~0 6)} assume true; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:43,618 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7305#(<= ~counter~0 6)} {7305#(<= ~counter~0 6)} #55#return; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:43,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {7305#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:43,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {7305#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7330#(<= |main_#t~post5| 6)} is VALID [2022-04-28 07:57:43,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {7330#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L290 TraceCheckUtils]: 64: Hoare triple {7139#false} assume !(0 == ~cond); {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {7139#false} assume true; {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7139#false} {7139#false} #57#return; {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L272 TraceCheckUtils]: 67: Hoare triple {7139#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-28 07:57:43,619 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-28 07:57:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:43,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:43,970 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-28 07:57:43,970 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-28 07:57:43,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 07:57:43,971 INFO L272 TraceCheckUtils]: 67: Hoare triple {7139#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7139#false} is VALID [2022-04-28 07:57:43,971 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7138#true} {7139#false} #57#return; {7139#false} is VALID [2022-04-28 07:57:43,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:43,971 INFO L290 TraceCheckUtils]: 64: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:43,971 INFO L290 TraceCheckUtils]: 63: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:43,971 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:43,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {7388#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-28 07:57:43,972 INFO L290 TraceCheckUtils]: 60: Hoare triple {7392#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7388#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:57:43,972 INFO L290 TraceCheckUtils]: 59: Hoare triple {7392#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7392#(< ~counter~0 20)} is VALID [2022-04-28 07:57:43,972 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7138#true} {7392#(< ~counter~0 20)} #55#return; {7392#(< ~counter~0 20)} is VALID [2022-04-28 07:57:43,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:43,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:43,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:43,973 INFO L272 TraceCheckUtils]: 54: Hoare triple {7392#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:43,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {7392#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {7392#(< ~counter~0 20)} is VALID [2022-04-28 07:57:43,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {7417#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7392#(< ~counter~0 20)} is VALID [2022-04-28 07:57:43,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {7417#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7417#(< ~counter~0 19)} is VALID [2022-04-28 07:57:43,987 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7138#true} {7417#(< ~counter~0 19)} #55#return; {7417#(< ~counter~0 19)} is VALID [2022-04-28 07:57:43,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:43,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:43,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:43,988 INFO L272 TraceCheckUtils]: 46: Hoare triple {7417#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:43,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {7417#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {7417#(< ~counter~0 19)} is VALID [2022-04-28 07:57:43,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {7442#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7417#(< ~counter~0 19)} is VALID [2022-04-28 07:57:43,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {7442#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7442#(< ~counter~0 18)} is VALID [2022-04-28 07:57:43,990 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7138#true} {7442#(< ~counter~0 18)} #55#return; {7442#(< ~counter~0 18)} is VALID [2022-04-28 07:57:43,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:43,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:43,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:43,990 INFO L272 TraceCheckUtils]: 38: Hoare triple {7442#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:43,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {7442#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {7442#(< ~counter~0 18)} is VALID [2022-04-28 07:57:43,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7442#(< ~counter~0 18)} is VALID [2022-04-28 07:57:43,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7467#(< ~counter~0 17)} is VALID [2022-04-28 07:57:43,992 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7138#true} {7467#(< ~counter~0 17)} #55#return; {7467#(< ~counter~0 17)} is VALID [2022-04-28 07:57:43,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:43,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:43,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:43,992 INFO L272 TraceCheckUtils]: 30: Hoare triple {7467#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:43,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {7467#(< ~counter~0 17)} is VALID [2022-04-28 07:57:43,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {7492#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7467#(< ~counter~0 17)} is VALID [2022-04-28 07:57:43,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {7492#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7492#(< ~counter~0 16)} is VALID [2022-04-28 07:57:43,994 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7138#true} {7492#(< ~counter~0 16)} #55#return; {7492#(< ~counter~0 16)} is VALID [2022-04-28 07:57:43,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:43,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:43,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:43,994 INFO L272 TraceCheckUtils]: 22: Hoare triple {7492#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:43,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {7492#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {7492#(< ~counter~0 16)} is VALID [2022-04-28 07:57:43,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {7517#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7492#(< ~counter~0 16)} is VALID [2022-04-28 07:57:43,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {7517#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7517#(< ~counter~0 15)} is VALID [2022-04-28 07:57:43,996 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7138#true} {7517#(< ~counter~0 15)} #55#return; {7517#(< ~counter~0 15)} is VALID [2022-04-28 07:57:43,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:43,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:43,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:43,997 INFO L272 TraceCheckUtils]: 14: Hoare triple {7517#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:43,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {7517#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {7517#(< ~counter~0 15)} is VALID [2022-04-28 07:57:43,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {7542#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7517#(< ~counter~0 15)} is VALID [2022-04-28 07:57:43,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {7542#(< ~counter~0 14)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7542#(< ~counter~0 14)} is VALID [2022-04-28 07:57:43,998 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7138#true} {7542#(< ~counter~0 14)} #53#return; {7542#(< ~counter~0 14)} is VALID [2022-04-28 07:57:43,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:43,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:43,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:43,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {7542#(< ~counter~0 14)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:43,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {7542#(< ~counter~0 14)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7542#(< ~counter~0 14)} is VALID [2022-04-28 07:57:43,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {7542#(< ~counter~0 14)} call #t~ret6 := main(); {7542#(< ~counter~0 14)} is VALID [2022-04-28 07:57:44,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7542#(< ~counter~0 14)} {7138#true} #61#return; {7542#(< ~counter~0 14)} is VALID [2022-04-28 07:57:44,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {7542#(< ~counter~0 14)} assume true; {7542#(< ~counter~0 14)} is VALID [2022-04-28 07:57:44,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7542#(< ~counter~0 14)} is VALID [2022-04-28 07:57:44,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-28 07:57:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 07:57:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:44,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002997030] [2022-04-28 07:57:44,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:44,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775098942] [2022-04-28 07:57:44,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775098942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:44,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:44,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 07:57:44,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:44,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092699359] [2022-04-28 07:57:44,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092699359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:44,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:44,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:57:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779995959] [2022-04-28 07:57:44,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:44,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-28 07:57:44,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:44,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:44,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:44,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:57:44,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:44,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:57:44,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:57:44,064 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:44,312 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-28 07:57:44,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:57:44,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-28 07:57:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 07:57:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 07:57:44,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-28 07:57:44,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:44,389 INFO L225 Difference]: With dead ends: 86 [2022-04-28 07:57:44,389 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 07:57:44,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:57:44,390 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:44,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 07:57:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 07:57:44,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:44,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:44,476 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:44,476 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:44,478 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:57:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:57:44,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:44,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:44,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-28 07:57:44,479 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-28 07:57:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:44,480 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:57:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:57:44,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:44,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:44,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:44,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-28 07:57:44,482 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-28 07:57:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:44,483 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-28 07:57:44,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:57:44,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-28 07:57:44,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:57:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 07:57:44,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:44,696 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:44,712 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 07:57:44,896 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 07:57:44,897 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-28 07:57:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:44,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1099169045] [2022-04-28 07:57:44,988 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:44,988 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:44,988 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-28 07:57:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:44,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664671249] [2022-04-28 07:57:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:45,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:45,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997637866] [2022-04-28 07:57:45,011 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:57:45,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:45,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:45,012 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 07:57:45,019 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 07:57:50,411 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:57:50,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:50,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 07:57:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:50,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:50,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {8069#true} call ULTIMATE.init(); {8069#true} is VALID [2022-04-28 07:57:50,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {8069#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8069#true} is VALID [2022-04-28 07:57:50,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8069#true} {8069#true} #61#return; {8069#true} is VALID [2022-04-28 07:57:50,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {8069#true} call #t~ret6 := main(); {8069#true} is VALID [2022-04-28 07:57:50,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {8069#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; {8069#true} is VALID [2022-04-28 07:57:50,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {8069#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,966 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8069#true} {8069#true} #53#return; {8069#true} is VALID [2022-04-28 07:57:50,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {8069#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:50,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:50,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:50,967 INFO L272 TraceCheckUtils]: 14: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,968 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8069#true} {8107#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:50,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:50,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:50,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:50,970 INFO L272 TraceCheckUtils]: 22: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,971 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8069#true} {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:50,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {8132#(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 * ~y~0 * ~y~0 + ~x~0; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:50,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:50,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:50,972 INFO L272 TraceCheckUtils]: 30: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,973 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8069#true} {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:50,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:50,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:50,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:50,975 INFO L272 TraceCheckUtils]: 38: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,976 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8069#true} {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:50,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:57:50,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:57:50,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:57:50,978 INFO L272 TraceCheckUtils]: 46: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,978 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8069#true} {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:57:50,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:57:50,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:57:50,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:57:50,980 INFO L272 TraceCheckUtils]: 54: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,981 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8069#true} {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:57:50,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) 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 * ~y~0 * ~y~0 + ~x~0; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:57:50,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:57:50,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:57:50,983 INFO L272 TraceCheckUtils]: 62: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,983 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8069#true} {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:57:50,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:57:50,984 INFO L272 TraceCheckUtils]: 68: Hoare triple {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-28 07:57:50,984 INFO L290 TraceCheckUtils]: 69: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:50,984 INFO L290 TraceCheckUtils]: 70: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:50,984 INFO L290 TraceCheckUtils]: 71: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:50,985 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8069#true} {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:57:50,986 INFO L272 TraceCheckUtils]: 73: Hoare triple {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:50,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:50,986 INFO L290 TraceCheckUtils]: 75: Hoare triple {8305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8070#false} is VALID [2022-04-28 07:57:50,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {8070#false} assume !false; {8070#false} is VALID [2022-04-28 07:57:50,987 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 07:57:50,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:51,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664671249] [2022-04-28 07:57:51,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997637866] [2022-04-28 07:57:51,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997637866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:51,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:51,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:57:51,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1099169045] [2022-04-28 07:57:51,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1099169045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:51,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:51,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:57:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564175503] [2022-04-28 07:57:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-28 07:57:51,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:51,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:57:51,807 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 07:57:51,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:57:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:51,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:57:51,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:57:51,808 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:57:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:52,603 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 07:57:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:57:52,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-28 07:57:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:57:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 07:57:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:57:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 07:57:52,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-28 07:57:52,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:52,665 INFO L225 Difference]: With dead ends: 84 [2022-04-28 07:57:52,665 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 07:57:52,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:57:52,666 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:52,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 07:57:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 07:57:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 07:57:52,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:52,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:52,765 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:52,765 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:52,767 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 07:57:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:57:52,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:52,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:52,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-28 07:57:52,768 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-28 07:57:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:52,769 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 07:57:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:57:52,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:52,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:52,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:52,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 07:57:52,771 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-28 07:57:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:52,771 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 07:57:52,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:57:52,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 07:57:52,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:57:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 07:57:52,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:52,948 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:52,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 07:57:53,151 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 07:57:53,152 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-28 07:57:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:53,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1838976697] [2022-04-28 07:57:53,268 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:53,269 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:53,269 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-28 07:57:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:53,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231413881] [2022-04-28 07:57:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:53,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:53,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844404844] [2022-04-28 07:57:53,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:57:53,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:53,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:53,300 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 07:57:53,323 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 07:57:53,475 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 07:57:53,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:53,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 07:57:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:53,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:53,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-28 07:57:53,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#(<= ~counter~0 0)} {8955#true} #61#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#(<= ~counter~0 0)} call #t~ret6 := main(); {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {8963#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {8963#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#(<= ~counter~0 0)} ~cond := #in~cond; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#(<= ~counter~0 0)} assume !(0 == ~cond); {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#(<= ~counter~0 0)} {8963#(<= ~counter~0 0)} #53#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {8963#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:53,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {8963#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:53,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {8997#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:53,862 INFO L272 TraceCheckUtils]: 14: Hoare triple {8997#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:53,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#(<= ~counter~0 1)} ~cond := #in~cond; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:53,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#(<= ~counter~0 1)} assume !(0 == ~cond); {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:53,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#(<= ~counter~0 1)} assume true; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:53,863 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8997#(<= ~counter~0 1)} {8997#(<= ~counter~0 1)} #55#return; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:53,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {8997#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:53,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {8997#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:53,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {9022#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:53,865 INFO L272 TraceCheckUtils]: 22: Hoare triple {9022#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:53,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#(<= ~counter~0 2)} ~cond := #in~cond; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:53,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#(<= ~counter~0 2)} assume !(0 == ~cond); {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:53,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {9022#(<= ~counter~0 2)} assume true; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:53,866 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9022#(<= ~counter~0 2)} {9022#(<= ~counter~0 2)} #55#return; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:53,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {9022#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:53,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {9022#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:53,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {9047#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:53,867 INFO L272 TraceCheckUtils]: 30: Hoare triple {9047#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:53,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {9047#(<= ~counter~0 3)} ~cond := #in~cond; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:53,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {9047#(<= ~counter~0 3)} assume !(0 == ~cond); {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:53,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {9047#(<= ~counter~0 3)} assume true; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:53,868 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9047#(<= ~counter~0 3)} {9047#(<= ~counter~0 3)} #55#return; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:53,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {9047#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:53,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {9047#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:53,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {9072#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:53,870 INFO L272 TraceCheckUtils]: 38: Hoare triple {9072#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:53,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {9072#(<= ~counter~0 4)} ~cond := #in~cond; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:53,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {9072#(<= ~counter~0 4)} assume !(0 == ~cond); {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:53,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {9072#(<= ~counter~0 4)} assume true; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:53,871 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9072#(<= ~counter~0 4)} {9072#(<= ~counter~0 4)} #55#return; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:53,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {9072#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:53,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {9072#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:53,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {9097#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:53,873 INFO L272 TraceCheckUtils]: 46: Hoare triple {9097#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:53,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {9097#(<= ~counter~0 5)} ~cond := #in~cond; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:53,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {9097#(<= ~counter~0 5)} assume !(0 == ~cond); {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:53,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {9097#(<= ~counter~0 5)} assume true; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:53,874 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9097#(<= ~counter~0 5)} {9097#(<= ~counter~0 5)} #55#return; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:53,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {9097#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:53,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {9097#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:53,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {9122#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:53,875 INFO L272 TraceCheckUtils]: 54: Hoare triple {9122#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:53,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {9122#(<= ~counter~0 6)} ~cond := #in~cond; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:53,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {9122#(<= ~counter~0 6)} assume !(0 == ~cond); {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:53,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {9122#(<= ~counter~0 6)} assume true; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:53,876 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9122#(<= ~counter~0 6)} {9122#(<= ~counter~0 6)} #55#return; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:53,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {9122#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:53,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {9122#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:53,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {9147#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:53,878 INFO L272 TraceCheckUtils]: 62: Hoare triple {9147#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:53,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {9147#(<= ~counter~0 7)} ~cond := #in~cond; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:53,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {9147#(<= ~counter~0 7)} assume !(0 == ~cond); {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:53,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {9147#(<= ~counter~0 7)} assume true; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:53,879 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9147#(<= ~counter~0 7)} {9147#(<= ~counter~0 7)} #55#return; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:53,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {9147#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:53,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {9147#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9172#(<= |main_#t~post5| 7)} is VALID [2022-04-28 07:57:53,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {9172#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L272 TraceCheckUtils]: 70: Hoare triple {8956#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {8956#false} assume !(0 == ~cond); {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {8956#false} assume true; {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8956#false} {8956#false} #57#return; {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L272 TraceCheckUtils]: 75: Hoare triple {8956#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 07:57:53,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 07:57:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:53,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:54,311 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 07:57:54,311 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 07:57:54,311 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 07:57:54,311 INFO L272 TraceCheckUtils]: 75: Hoare triple {8956#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8956#false} is VALID [2022-04-28 07:57:54,312 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8955#true} {8956#false} #57#return; {8956#false} is VALID [2022-04-28 07:57:54,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,312 INFO L290 TraceCheckUtils]: 72: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,312 INFO L290 TraceCheckUtils]: 71: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,312 INFO L272 TraceCheckUtils]: 70: Hoare triple {8956#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,312 INFO L290 TraceCheckUtils]: 69: Hoare triple {9230#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-28 07:57:54,313 INFO L290 TraceCheckUtils]: 68: Hoare triple {9234#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9230#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:57:54,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9234#(< ~counter~0 20)} is VALID [2022-04-28 07:57:54,314 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8955#true} {9234#(< ~counter~0 20)} #55#return; {9234#(< ~counter~0 20)} is VALID [2022-04-28 07:57:54,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,314 INFO L272 TraceCheckUtils]: 62: Hoare triple {9234#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {9234#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9234#(< ~counter~0 20)} is VALID [2022-04-28 07:57:54,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {9259#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(< ~counter~0 20)} is VALID [2022-04-28 07:57:54,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {9259#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9259#(< ~counter~0 19)} is VALID [2022-04-28 07:57:54,316 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8955#true} {9259#(< ~counter~0 19)} #55#return; {9259#(< ~counter~0 19)} is VALID [2022-04-28 07:57:54,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,316 INFO L272 TraceCheckUtils]: 54: Hoare triple {9259#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {9259#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9259#(< ~counter~0 19)} is VALID [2022-04-28 07:57:54,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {9284#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(< ~counter~0 19)} is VALID [2022-04-28 07:57:54,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {9284#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9284#(< ~counter~0 18)} is VALID [2022-04-28 07:57:54,318 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8955#true} {9284#(< ~counter~0 18)} #55#return; {9284#(< ~counter~0 18)} is VALID [2022-04-28 07:57:54,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,318 INFO L272 TraceCheckUtils]: 46: Hoare triple {9284#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9284#(< ~counter~0 18)} is VALID [2022-04-28 07:57:54,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {9309#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9284#(< ~counter~0 18)} is VALID [2022-04-28 07:57:54,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {9309#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9309#(< ~counter~0 17)} is VALID [2022-04-28 07:57:54,320 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8955#true} {9309#(< ~counter~0 17)} #55#return; {9309#(< ~counter~0 17)} is VALID [2022-04-28 07:57:54,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,321 INFO L272 TraceCheckUtils]: 38: Hoare triple {9309#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {9309#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9309#(< ~counter~0 17)} is VALID [2022-04-28 07:57:54,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {9334#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9309#(< ~counter~0 17)} is VALID [2022-04-28 07:57:54,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {9334#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9334#(< ~counter~0 16)} is VALID [2022-04-28 07:57:54,322 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8955#true} {9334#(< ~counter~0 16)} #55#return; {9334#(< ~counter~0 16)} is VALID [2022-04-28 07:57:54,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,323 INFO L272 TraceCheckUtils]: 30: Hoare triple {9334#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {9334#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9334#(< ~counter~0 16)} is VALID [2022-04-28 07:57:54,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {9359#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9334#(< ~counter~0 16)} is VALID [2022-04-28 07:57:54,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {9359#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9359#(< ~counter~0 15)} is VALID [2022-04-28 07:57:54,325 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8955#true} {9359#(< ~counter~0 15)} #55#return; {9359#(< ~counter~0 15)} is VALID [2022-04-28 07:57:54,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,325 INFO L272 TraceCheckUtils]: 22: Hoare triple {9359#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {9359#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9359#(< ~counter~0 15)} is VALID [2022-04-28 07:57:54,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {9384#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9359#(< ~counter~0 15)} is VALID [2022-04-28 07:57:54,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {9384#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9384#(< ~counter~0 14)} is VALID [2022-04-28 07:57:54,327 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8955#true} {9384#(< ~counter~0 14)} #55#return; {9384#(< ~counter~0 14)} is VALID [2022-04-28 07:57:54,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,327 INFO L272 TraceCheckUtils]: 14: Hoare triple {9384#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9384#(< ~counter~0 14)} is VALID [2022-04-28 07:57:54,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {9409#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9384#(< ~counter~0 14)} is VALID [2022-04-28 07:57:54,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {9409#(< ~counter~0 13)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9409#(< ~counter~0 13)} is VALID [2022-04-28 07:57:54,329 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8955#true} {9409#(< ~counter~0 13)} #53#return; {9409#(< ~counter~0 13)} is VALID [2022-04-28 07:57:54,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:54,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:54,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:54,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {9409#(< ~counter~0 13)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:54,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {9409#(< ~counter~0 13)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9409#(< ~counter~0 13)} is VALID [2022-04-28 07:57:54,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {9409#(< ~counter~0 13)} call #t~ret6 := main(); {9409#(< ~counter~0 13)} is VALID [2022-04-28 07:57:54,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9409#(< ~counter~0 13)} {8955#true} #61#return; {9409#(< ~counter~0 13)} is VALID [2022-04-28 07:57:54,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {9409#(< ~counter~0 13)} assume true; {9409#(< ~counter~0 13)} is VALID [2022-04-28 07:57:54,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9409#(< ~counter~0 13)} is VALID [2022-04-28 07:57:54,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-28 07:57:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 07:57:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:54,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231413881] [2022-04-28 07:57:54,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:54,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844404844] [2022-04-28 07:57:54,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844404844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:54,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:54,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 07:57:54,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:54,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1838976697] [2022-04-28 07:57:54,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1838976697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:54,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:54,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:57:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167094926] [2022-04-28 07:57:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:54,333 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-28 07:57:54,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:54,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:54,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:54,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:57:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:57:54,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:57:54,390 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:54,691 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-28 07:57:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:57:54,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-28 07:57:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 07:57:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 07:57:54,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-28 07:57:54,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:54,780 INFO L225 Difference]: With dead ends: 94 [2022-04-28 07:57:54,780 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 07:57:54,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:57:54,780 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:54,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 07:57:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 07:57:54,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:54,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:54,878 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:54,878 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:54,880 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:57:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:57:54,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:54,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:54,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 07:57:54,881 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 07:57:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:54,882 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:57:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:57:54,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:54,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:54,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:54,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-28 07:57:54,885 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-28 07:57:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:54,885 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-28 07:57:54,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:57:54,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-28 07:57:55,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:57:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 07:57:55,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:55,070 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:55,078 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 07:57:55,278 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 07:57:55,279 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-28 07:57:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:55,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499690333] [2022-04-28 07:57:55,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:55,372 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:55,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-28 07:57:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:55,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27579927] [2022-04-28 07:57:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:55,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:55,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241679725] [2022-04-28 07:57:55,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:55,397 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 07:57:55,420 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 07:57:56,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:56,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:56,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:57:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:56,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:56,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9986#true} is VALID [2022-04-28 07:57:56,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {9986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9986#true} is VALID [2022-04-28 07:57:56,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:56,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #61#return; {9986#true} is VALID [2022-04-28 07:57:56,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret6 := main(); {9986#true} is VALID [2022-04-28 07:57:56,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {9986#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; {9986#true} is VALID [2022-04-28 07:57:56,998 INFO L272 TraceCheckUtils]: 6: Hoare triple {9986#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:56,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:56,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:56,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:56,998 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9986#true} {9986#true} #53#return; {9986#true} is VALID [2022-04-28 07:57:57,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {9986#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:57,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:57,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:57,005 INFO L272 TraceCheckUtils]: 14: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,005 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9986#true} {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:57,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:57:57,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:57:57,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:57:57,007 INFO L272 TraceCheckUtils]: 22: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,008 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9986#true} {10049#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:57:57,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:57:57,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:57:57,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:57:57,009 INFO L272 TraceCheckUtils]: 30: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,010 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9986#true} {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:57:57,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:57:57,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:57:57,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:57:57,011 INFO L272 TraceCheckUtils]: 38: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,012 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9986#true} {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:57:57,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {10099#(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 * ~y~0 * ~y~0 + ~x~0; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:57:57,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:57:57,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:57:57,014 INFO L272 TraceCheckUtils]: 46: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,014 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9986#true} {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:57:57,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:57:57,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:57:57,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:57:57,016 INFO L272 TraceCheckUtils]: 54: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,017 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9986#true} {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:57:57,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:57:57,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:57:57,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:57:57,018 INFO L272 TraceCheckUtils]: 62: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,019 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9986#true} {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:57:57,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:57,020 INFO L290 TraceCheckUtils]: 68: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:57,020 INFO L290 TraceCheckUtils]: 69: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:57,020 INFO L272 TraceCheckUtils]: 70: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,020 INFO L290 TraceCheckUtils]: 71: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,020 INFO L290 TraceCheckUtils]: 73: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,021 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9986#true} {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:57,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:57,022 INFO L272 TraceCheckUtils]: 76: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:57,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:57,022 INFO L290 TraceCheckUtils]: 78: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:57,022 INFO L290 TraceCheckUtils]: 79: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:57,023 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9986#true} {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:57,023 INFO L272 TraceCheckUtils]: 81: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:57,024 INFO L290 TraceCheckUtils]: 82: Hoare triple {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:57,024 INFO L290 TraceCheckUtils]: 83: Hoare triple {10247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9987#false} is VALID [2022-04-28 07:57:57,024 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-28 07:57:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 07:57:57,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:57,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27579927] [2022-04-28 07:57:57,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:57,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241679725] [2022-04-28 07:57:57,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241679725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:57,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:57,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:57:57,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:57,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499690333] [2022-04-28 07:57:57,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499690333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:57,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:57,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:57:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578789008] [2022-04-28 07:57:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:57,281 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-28 07:57:57,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:57,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:57:57,326 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 07:57:57,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:57:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:57:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:57:57,327 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:57:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:58,189 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 07:57:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:57:58,189 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-28 07:57:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:57:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 07:57:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:57:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 07:57:58,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-28 07:57:58,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:58,251 INFO L225 Difference]: With dead ends: 92 [2022-04-28 07:57:58,251 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 07:57:58,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:57:58,251 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:58,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 431 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 07:57:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 07:57:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 07:57:58,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:58,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:57:58,358 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:57:58,359 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:57:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:58,360 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 07:57:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:57:58,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:58,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:58,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-28 07:57:58,361 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-28 07:57:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:58,363 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 07:57:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:57:58,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:58,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:58,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:58,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:57:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-28 07:57:58,365 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-28 07:57:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:58,365 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-28 07:57:58,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:57:58,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-28 07:57:58,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:57:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 07:57:58,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:58,530 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:58,536 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 07:57:58,736 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 07:57:58,737 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:58,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:58,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-28 07:57:58,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:58,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558682709] [2022-04-28 07:57:58,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:58,825 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:58,825 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-28 07:57:58,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:58,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941838425] [2022-04-28 07:57:58,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:58,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:58,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:58,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361823598] [2022-04-28 07:57:58,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:58,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:58,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:58,839 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 07:57:58,843 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 07:57:58,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:58,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:58,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:57:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:58,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:59,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-28 07:57:59,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10853#(<= ~counter~0 0)} {10845#true} #61#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {10853#(<= ~counter~0 0)} call #t~ret6 := main(); {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {10853#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {10853#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {10853#(<= ~counter~0 0)} ~cond := #in~cond; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {10853#(<= ~counter~0 0)} assume !(0 == ~cond); {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10853#(<= ~counter~0 0)} {10853#(<= ~counter~0 0)} #53#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {10853#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:59,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {10853#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:59,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {10887#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:59,373 INFO L272 TraceCheckUtils]: 14: Hoare triple {10887#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:59,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {10887#(<= ~counter~0 1)} ~cond := #in~cond; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:59,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {10887#(<= ~counter~0 1)} assume !(0 == ~cond); {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:59,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {10887#(<= ~counter~0 1)} assume true; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:59,374 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10887#(<= ~counter~0 1)} {10887#(<= ~counter~0 1)} #55#return; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:59,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {10887#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:59,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {10887#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:59,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {10912#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:59,376 INFO L272 TraceCheckUtils]: 22: Hoare triple {10912#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:59,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {10912#(<= ~counter~0 2)} ~cond := #in~cond; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:59,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {10912#(<= ~counter~0 2)} assume !(0 == ~cond); {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:59,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {10912#(<= ~counter~0 2)} assume true; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:59,378 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10912#(<= ~counter~0 2)} {10912#(<= ~counter~0 2)} #55#return; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:59,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {10912#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:59,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {10912#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:59,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {10937#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:59,379 INFO L272 TraceCheckUtils]: 30: Hoare triple {10937#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:59,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(<= ~counter~0 3)} ~cond := #in~cond; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:59,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {10937#(<= ~counter~0 3)} assume !(0 == ~cond); {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:59,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {10937#(<= ~counter~0 3)} assume true; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:59,381 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10937#(<= ~counter~0 3)} {10937#(<= ~counter~0 3)} #55#return; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:59,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {10937#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:59,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {10937#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:59,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {10962#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:59,383 INFO L272 TraceCheckUtils]: 38: Hoare triple {10962#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:59,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(<= ~counter~0 4)} ~cond := #in~cond; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:59,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(<= ~counter~0 4)} assume !(0 == ~cond); {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:59,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {10962#(<= ~counter~0 4)} assume true; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:59,384 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10962#(<= ~counter~0 4)} {10962#(<= ~counter~0 4)} #55#return; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:59,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {10962#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:59,385 INFO L290 TraceCheckUtils]: 44: Hoare triple {10962#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:59,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {10987#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:59,386 INFO L272 TraceCheckUtils]: 46: Hoare triple {10987#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:59,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {10987#(<= ~counter~0 5)} ~cond := #in~cond; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:59,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {10987#(<= ~counter~0 5)} assume !(0 == ~cond); {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:59,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {10987#(<= ~counter~0 5)} assume true; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:59,388 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10987#(<= ~counter~0 5)} {10987#(<= ~counter~0 5)} #55#return; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:59,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {10987#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:59,389 INFO L290 TraceCheckUtils]: 52: Hoare triple {10987#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:59,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {11012#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:59,390 INFO L272 TraceCheckUtils]: 54: Hoare triple {11012#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:59,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {11012#(<= ~counter~0 6)} ~cond := #in~cond; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:59,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {11012#(<= ~counter~0 6)} assume !(0 == ~cond); {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:59,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {11012#(<= ~counter~0 6)} assume true; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:59,391 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11012#(<= ~counter~0 6)} {11012#(<= ~counter~0 6)} #55#return; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:59,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {11012#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:59,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {11012#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:59,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {11037#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:59,393 INFO L272 TraceCheckUtils]: 62: Hoare triple {11037#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:59,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {11037#(<= ~counter~0 7)} ~cond := #in~cond; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:59,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {11037#(<= ~counter~0 7)} assume !(0 == ~cond); {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:59,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {11037#(<= ~counter~0 7)} assume true; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:59,395 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11037#(<= ~counter~0 7)} {11037#(<= ~counter~0 7)} #55#return; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:59,395 INFO L290 TraceCheckUtils]: 67: Hoare triple {11037#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:59,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {11037#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:59,396 INFO L290 TraceCheckUtils]: 69: Hoare triple {11062#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:59,397 INFO L272 TraceCheckUtils]: 70: Hoare triple {11062#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:59,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {11062#(<= ~counter~0 8)} ~cond := #in~cond; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:59,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {11062#(<= ~counter~0 8)} assume !(0 == ~cond); {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:59,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {11062#(<= ~counter~0 8)} assume true; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:59,398 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11062#(<= ~counter~0 8)} {11062#(<= ~counter~0 8)} #55#return; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:59,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {11062#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:59,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {11062#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11087#(<= |main_#t~post5| 8)} is VALID [2022-04-28 07:57:59,399 INFO L290 TraceCheckUtils]: 77: Hoare triple {11087#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-28 07:57:59,399 INFO L272 TraceCheckUtils]: 78: Hoare triple {10846#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10846#false} is VALID [2022-04-28 07:57:59,399 INFO L290 TraceCheckUtils]: 79: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 07:57:59,400 INFO L290 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !(0 == ~cond); {10846#false} is VALID [2022-04-28 07:57:59,400 INFO L290 TraceCheckUtils]: 81: Hoare triple {10846#false} assume true; {10846#false} is VALID [2022-04-28 07:57:59,400 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10846#false} {10846#false} #57#return; {10846#false} is VALID [2022-04-28 07:57:59,400 INFO L272 TraceCheckUtils]: 83: Hoare triple {10846#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10846#false} is VALID [2022-04-28 07:57:59,400 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 07:57:59,400 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-28 07:57:59,400 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-28 07:57:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:59,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:59,916 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-28 07:57:59,916 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-28 07:57:59,916 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 07:57:59,916 INFO L272 TraceCheckUtils]: 83: Hoare triple {10846#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10846#false} is VALID [2022-04-28 07:57:59,916 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10845#true} {10846#false} #57#return; {10846#false} is VALID [2022-04-28 07:57:59,916 INFO L290 TraceCheckUtils]: 81: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,916 INFO L290 TraceCheckUtils]: 80: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,916 INFO L290 TraceCheckUtils]: 79: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,916 INFO L272 TraceCheckUtils]: 78: Hoare triple {10846#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,916 INFO L290 TraceCheckUtils]: 77: Hoare triple {11145#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-28 07:57:59,917 INFO L290 TraceCheckUtils]: 76: Hoare triple {11149#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11145#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:57:59,917 INFO L290 TraceCheckUtils]: 75: Hoare triple {11149#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11149#(< ~counter~0 20)} is VALID [2022-04-28 07:57:59,917 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10845#true} {11149#(< ~counter~0 20)} #55#return; {11149#(< ~counter~0 20)} is VALID [2022-04-28 07:57:59,918 INFO L290 TraceCheckUtils]: 73: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,918 INFO L290 TraceCheckUtils]: 72: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,918 INFO L290 TraceCheckUtils]: 71: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,918 INFO L272 TraceCheckUtils]: 70: Hoare triple {11149#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {11149#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11149#(< ~counter~0 20)} is VALID [2022-04-28 07:57:59,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {11174#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11149#(< ~counter~0 20)} is VALID [2022-04-28 07:57:59,919 INFO L290 TraceCheckUtils]: 67: Hoare triple {11174#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11174#(< ~counter~0 19)} is VALID [2022-04-28 07:57:59,919 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10845#true} {11174#(< ~counter~0 19)} #55#return; {11174#(< ~counter~0 19)} is VALID [2022-04-28 07:57:59,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,920 INFO L272 TraceCheckUtils]: 62: Hoare triple {11174#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,920 INFO L290 TraceCheckUtils]: 61: Hoare triple {11174#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11174#(< ~counter~0 19)} is VALID [2022-04-28 07:57:59,920 INFO L290 TraceCheckUtils]: 60: Hoare triple {11199#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11174#(< ~counter~0 19)} is VALID [2022-04-28 07:57:59,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {11199#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11199#(< ~counter~0 18)} is VALID [2022-04-28 07:57:59,921 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10845#true} {11199#(< ~counter~0 18)} #55#return; {11199#(< ~counter~0 18)} is VALID [2022-04-28 07:57:59,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,921 INFO L272 TraceCheckUtils]: 54: Hoare triple {11199#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {11199#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11199#(< ~counter~0 18)} is VALID [2022-04-28 07:57:59,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {11224#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11199#(< ~counter~0 18)} is VALID [2022-04-28 07:57:59,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {11224#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11224#(< ~counter~0 17)} is VALID [2022-04-28 07:57:59,923 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10845#true} {11224#(< ~counter~0 17)} #55#return; {11224#(< ~counter~0 17)} is VALID [2022-04-28 07:57:59,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,923 INFO L272 TraceCheckUtils]: 46: Hoare triple {11224#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {11224#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11224#(< ~counter~0 17)} is VALID [2022-04-28 07:57:59,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {11249#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11224#(< ~counter~0 17)} is VALID [2022-04-28 07:57:59,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {11249#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11249#(< ~counter~0 16)} is VALID [2022-04-28 07:57:59,924 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10845#true} {11249#(< ~counter~0 16)} #55#return; {11249#(< ~counter~0 16)} is VALID [2022-04-28 07:57:59,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,925 INFO L272 TraceCheckUtils]: 38: Hoare triple {11249#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {11249#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {11249#(< ~counter~0 16)} is VALID [2022-04-28 07:57:59,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {11274#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11249#(< ~counter~0 16)} is VALID [2022-04-28 07:57:59,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {11274#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11274#(< ~counter~0 15)} is VALID [2022-04-28 07:57:59,926 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10845#true} {11274#(< ~counter~0 15)} #55#return; {11274#(< ~counter~0 15)} is VALID [2022-04-28 07:57:59,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,926 INFO L272 TraceCheckUtils]: 30: Hoare triple {11274#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {11274#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {11274#(< ~counter~0 15)} is VALID [2022-04-28 07:57:59,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {11299#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11274#(< ~counter~0 15)} is VALID [2022-04-28 07:57:59,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {11299#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11299#(< ~counter~0 14)} is VALID [2022-04-28 07:57:59,928 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10845#true} {11299#(< ~counter~0 14)} #55#return; {11299#(< ~counter~0 14)} is VALID [2022-04-28 07:57:59,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,928 INFO L272 TraceCheckUtils]: 22: Hoare triple {11299#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {11299#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {11299#(< ~counter~0 14)} is VALID [2022-04-28 07:57:59,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {11324#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11299#(< ~counter~0 14)} is VALID [2022-04-28 07:57:59,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {11324#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11324#(< ~counter~0 13)} is VALID [2022-04-28 07:57:59,929 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10845#true} {11324#(< ~counter~0 13)} #55#return; {11324#(< ~counter~0 13)} is VALID [2022-04-28 07:57:59,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,929 INFO L272 TraceCheckUtils]: 14: Hoare triple {11324#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {11324#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {11324#(< ~counter~0 13)} is VALID [2022-04-28 07:57:59,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {11349#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11324#(< ~counter~0 13)} is VALID [2022-04-28 07:57:59,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {11349#(< ~counter~0 12)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11349#(< ~counter~0 12)} is VALID [2022-04-28 07:57:59,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10845#true} {11349#(< ~counter~0 12)} #53#return; {11349#(< ~counter~0 12)} is VALID [2022-04-28 07:57:59,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:59,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:59,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:59,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {11349#(< ~counter~0 12)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:59,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {11349#(< ~counter~0 12)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11349#(< ~counter~0 12)} is VALID [2022-04-28 07:57:59,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {11349#(< ~counter~0 12)} call #t~ret6 := main(); {11349#(< ~counter~0 12)} is VALID [2022-04-28 07:57:59,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11349#(< ~counter~0 12)} {10845#true} #61#return; {11349#(< ~counter~0 12)} is VALID [2022-04-28 07:57:59,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {11349#(< ~counter~0 12)} assume true; {11349#(< ~counter~0 12)} is VALID [2022-04-28 07:57:59,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11349#(< ~counter~0 12)} is VALID [2022-04-28 07:57:59,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-28 07:57:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 07:57:59,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:59,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941838425] [2022-04-28 07:57:59,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:59,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361823598] [2022-04-28 07:57:59,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361823598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:59,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:59,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 07:57:59,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:59,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558682709] [2022-04-28 07:57:59,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558682709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:59,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:59,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:57:59,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449245124] [2022-04-28 07:57:59,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:59,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-28 07:57:59,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:59,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:57:59,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:59,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:57:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:57:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:57:59,997 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:00,344 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-28 07:58:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:58:00,344 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-28 07:58:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 07:58:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 07:58:00,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-28 07:58:00,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:00,427 INFO L225 Difference]: With dead ends: 102 [2022-04-28 07:58:00,427 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 07:58:00,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-28 07:58:00,428 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:00,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 129 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 07:58:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 07:58:00,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:00,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:00,550 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:00,550 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:00,551 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:58:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:58:00,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:00,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:00,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-28 07:58:00,552 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-28 07:58:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:00,553 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:58:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:58:00,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:00,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:00,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:00,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-28 07:58:00,556 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-28 07:58:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:00,556 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-28 07:58:00,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:00,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-28 07:58:00,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:58:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 07:58:00,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:00,715 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:00,732 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 07:58:00,916 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 07:58:00,916 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-28 07:58:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:00,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960110347] [2022-04-28 07:58:01,007 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:01,007 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:01,007 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-28 07:58:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:01,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549567170] [2022-04-28 07:58:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:01,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:01,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606613459] [2022-04-28 07:58:01,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:01,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:01,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:01,027 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 07:58:01,030 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 07:58:01,080 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:01,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:01,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:58:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:01,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:01,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {11976#true} call ULTIMATE.init(); {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {11976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11976#true} {11976#true} #61#return; {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {11976#true} call #t~ret6 := main(); {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {11976#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; {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {11976#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11976#true} {11976#true} #53#return; {11976#true} is VALID [2022-04-28 07:58:01,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {11976#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:01,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:01,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:01,574 INFO L272 TraceCheckUtils]: 14: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,584 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11976#true} {12014#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:01,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:01,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:01,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:01,585 INFO L272 TraceCheckUtils]: 22: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,586 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11976#true} {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:01,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:58:01,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:58:01,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:58:01,588 INFO L272 TraceCheckUtils]: 30: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,589 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11976#true} {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:58:01,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:58:01,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:58:01,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:58:01,590 INFO L272 TraceCheckUtils]: 38: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,591 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11976#true} {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:58:01,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {12089#(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 * ~y~0 * ~y~0 + ~x~0; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:58:01,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:58:01,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:58:01,592 INFO L272 TraceCheckUtils]: 46: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,593 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11976#true} {12114#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:58:01,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {12114#(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 * ~y~0 * ~y~0 + ~x~0; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:01,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:01,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:01,595 INFO L272 TraceCheckUtils]: 54: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,595 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11976#true} {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:01,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {12139#(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 * ~y~0 * ~y~0 + ~x~0; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:01,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:01,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:01,597 INFO L272 TraceCheckUtils]: 62: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,597 INFO L290 TraceCheckUtils]: 64: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,597 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11976#true} {12164#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:01,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:01,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:01,599 INFO L290 TraceCheckUtils]: 69: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:01,599 INFO L272 TraceCheckUtils]: 70: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,599 INFO L290 TraceCheckUtils]: 71: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,599 INFO L290 TraceCheckUtils]: 72: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,599 INFO L290 TraceCheckUtils]: 73: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,600 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11976#true} {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:01,600 INFO L290 TraceCheckUtils]: 75: Hoare triple {12189#(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 * ~y~0 * ~y~0 + ~x~0; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:58:01,601 INFO L290 TraceCheckUtils]: 76: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:58:01,601 INFO L290 TraceCheckUtils]: 77: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:58:01,601 INFO L272 TraceCheckUtils]: 78: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,601 INFO L290 TraceCheckUtils]: 79: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,601 INFO L290 TraceCheckUtils]: 80: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,601 INFO L290 TraceCheckUtils]: 81: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,602 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11976#true} {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:58:01,602 INFO L290 TraceCheckUtils]: 83: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 07:58:01,602 INFO L272 TraceCheckUtils]: 84: Hoare triple {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-28 07:58:01,603 INFO L290 TraceCheckUtils]: 85: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:58:01,603 INFO L290 TraceCheckUtils]: 86: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:58:01,603 INFO L290 TraceCheckUtils]: 87: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:58:01,603 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11976#true} {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 07:58:01,604 INFO L272 TraceCheckUtils]: 89: Hoare triple {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:01,605 INFO L290 TraceCheckUtils]: 90: Hoare triple {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:01,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {12262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11977#false} is VALID [2022-04-28 07:58:01,605 INFO L290 TraceCheckUtils]: 92: Hoare triple {11977#false} assume !false; {11977#false} is VALID [2022-04-28 07:58:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 07:58:01,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:01,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549567170] [2022-04-28 07:58:01,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:01,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606613459] [2022-04-28 07:58:01,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606613459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:01,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:01,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:58:01,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:01,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960110347] [2022-04-28 07:58:01,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960110347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:01,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:01,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:58:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536494651] [2022-04-28 07:58:01,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:01,882 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-28 07:58:01,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:01,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:58:01,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:01,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:58:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:58:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:58:01,934 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:58:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:02,975 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-28 07:58:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:58:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-28 07:58:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:58:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 07:58:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:58:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 07:58:02,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-28 07:58:03,042 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 07:58:03,043 INFO L225 Difference]: With dead ends: 100 [2022-04-28 07:58:03,043 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 07:58:03,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:58:03,044 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:03,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:58:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 07:58:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 07:58:03,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:03,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:03,163 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:03,163 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:03,165 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 07:58:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:58:03,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:03,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:03,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-28 07:58:03,166 INFO L87 Difference]: Start difference. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-28 07:58:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:03,167 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 07:58:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:58:03,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:03,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:03,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:03,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-28 07:58:03,170 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-28 07:58:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:03,170 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-28 07:58:03,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:58:03,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-28 07:58:03,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:58:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 07:58:03,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:03,349 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:03,366 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 07:58:03,551 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 07:58:03,551 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:03,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:03,552 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-28 07:58:03,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:03,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721550234] [2022-04-28 07:58:03,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:03,644 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:03,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-28 07:58:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:03,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169759166] [2022-04-28 07:58:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:03,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:03,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235567515] [2022-04-28 07:58:03,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:03,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:03,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:03,658 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 07:58:03,660 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 07:58:03,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:03,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:03,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 07:58:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:03,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:04,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-28 07:58:04,177 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);~counter~0 := 0; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12916#(<= ~counter~0 0)} {12908#true} #61#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {12916#(<= ~counter~0 0)} call #t~ret6 := main(); {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {12916#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {12916#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {12916#(<= ~counter~0 0)} ~cond := #in~cond; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {12916#(<= ~counter~0 0)} assume !(0 == ~cond); {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12916#(<= ~counter~0 0)} {12916#(<= ~counter~0 0)} #53#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {12916#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:04,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {12916#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:04,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:04,181 INFO L272 TraceCheckUtils]: 14: Hoare triple {12950#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:04,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(<= ~counter~0 1)} ~cond := #in~cond; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:04,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {12950#(<= ~counter~0 1)} assume !(0 == ~cond); {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:04,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {12950#(<= ~counter~0 1)} assume true; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:04,182 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12950#(<= ~counter~0 1)} {12950#(<= ~counter~0 1)} #55#return; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:04,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {12950#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:04,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:04,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {12975#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:04,184 INFO L272 TraceCheckUtils]: 22: Hoare triple {12975#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:04,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {12975#(<= ~counter~0 2)} ~cond := #in~cond; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:04,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {12975#(<= ~counter~0 2)} assume !(0 == ~cond); {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:04,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {12975#(<= ~counter~0 2)} assume true; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:04,185 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12975#(<= ~counter~0 2)} {12975#(<= ~counter~0 2)} #55#return; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:04,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {12975#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:04,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {12975#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:04,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {13000#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:04,186 INFO L272 TraceCheckUtils]: 30: Hoare triple {13000#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:04,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {13000#(<= ~counter~0 3)} ~cond := #in~cond; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:04,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {13000#(<= ~counter~0 3)} assume !(0 == ~cond); {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:04,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {13000#(<= ~counter~0 3)} assume true; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:04,188 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13000#(<= ~counter~0 3)} {13000#(<= ~counter~0 3)} #55#return; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:04,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {13000#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:04,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {13000#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:04,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {13025#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:04,189 INFO L272 TraceCheckUtils]: 38: Hoare triple {13025#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:04,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {13025#(<= ~counter~0 4)} ~cond := #in~cond; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:04,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {13025#(<= ~counter~0 4)} assume !(0 == ~cond); {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:04,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {13025#(<= ~counter~0 4)} assume true; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:04,190 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13025#(<= ~counter~0 4)} {13025#(<= ~counter~0 4)} #55#return; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:04,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {13025#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:04,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {13025#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:04,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {13050#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:04,192 INFO L272 TraceCheckUtils]: 46: Hoare triple {13050#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:04,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {13050#(<= ~counter~0 5)} ~cond := #in~cond; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:04,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {13050#(<= ~counter~0 5)} assume !(0 == ~cond); {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:04,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {13050#(<= ~counter~0 5)} assume true; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:04,193 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13050#(<= ~counter~0 5)} {13050#(<= ~counter~0 5)} #55#return; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:04,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {13050#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:04,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {13050#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:04,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {13075#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:04,194 INFO L272 TraceCheckUtils]: 54: Hoare triple {13075#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:04,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {13075#(<= ~counter~0 6)} ~cond := #in~cond; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:04,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {13075#(<= ~counter~0 6)} assume !(0 == ~cond); {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:04,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {13075#(<= ~counter~0 6)} assume true; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:04,196 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13075#(<= ~counter~0 6)} {13075#(<= ~counter~0 6)} #55#return; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:04,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {13075#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:04,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {13075#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:04,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:04,197 INFO L272 TraceCheckUtils]: 62: Hoare triple {13100#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:04,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {13100#(<= ~counter~0 7)} ~cond := #in~cond; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:04,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {13100#(<= ~counter~0 7)} assume !(0 == ~cond); {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:04,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {13100#(<= ~counter~0 7)} assume true; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:04,198 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13100#(<= ~counter~0 7)} {13100#(<= ~counter~0 7)} #55#return; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:04,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {13100#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:04,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {13100#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:04,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {13125#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:04,200 INFO L272 TraceCheckUtils]: 70: Hoare triple {13125#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:04,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {13125#(<= ~counter~0 8)} ~cond := #in~cond; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:04,200 INFO L290 TraceCheckUtils]: 72: Hoare triple {13125#(<= ~counter~0 8)} assume !(0 == ~cond); {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:04,200 INFO L290 TraceCheckUtils]: 73: Hoare triple {13125#(<= ~counter~0 8)} assume true; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:04,201 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13125#(<= ~counter~0 8)} {13125#(<= ~counter~0 8)} #55#return; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:04,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {13125#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:04,202 INFO L290 TraceCheckUtils]: 76: Hoare triple {13125#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:04,202 INFO L290 TraceCheckUtils]: 77: Hoare triple {13150#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:04,202 INFO L272 TraceCheckUtils]: 78: Hoare triple {13150#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:04,203 INFO L290 TraceCheckUtils]: 79: Hoare triple {13150#(<= ~counter~0 9)} ~cond := #in~cond; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:04,203 INFO L290 TraceCheckUtils]: 80: Hoare triple {13150#(<= ~counter~0 9)} assume !(0 == ~cond); {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:04,203 INFO L290 TraceCheckUtils]: 81: Hoare triple {13150#(<= ~counter~0 9)} assume true; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:04,203 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13150#(<= ~counter~0 9)} {13150#(<= ~counter~0 9)} #55#return; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:04,204 INFO L290 TraceCheckUtils]: 83: Hoare triple {13150#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:04,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {13150#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13175#(<= |main_#t~post5| 9)} is VALID [2022-04-28 07:58:04,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {13175#(<= |main_#t~post5| 9)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-28 07:58:04,204 INFO L272 TraceCheckUtils]: 86: Hoare triple {12909#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12909#false} is VALID [2022-04-28 07:58:04,205 INFO L290 TraceCheckUtils]: 87: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 07:58:04,205 INFO L290 TraceCheckUtils]: 88: Hoare triple {12909#false} assume !(0 == ~cond); {12909#false} is VALID [2022-04-28 07:58:04,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {12909#false} assume true; {12909#false} is VALID [2022-04-28 07:58:04,205 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12909#false} {12909#false} #57#return; {12909#false} is VALID [2022-04-28 07:58:04,205 INFO L272 TraceCheckUtils]: 91: Hoare triple {12909#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12909#false} is VALID [2022-04-28 07:58:04,205 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 07:58:04,205 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-28 07:58:04,205 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-28 07:58:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:58:04,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:04,772 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-28 07:58:04,772 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-28 07:58:04,772 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 07:58:04,772 INFO L272 TraceCheckUtils]: 91: Hoare triple {12909#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12909#false} is VALID [2022-04-28 07:58:04,772 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12908#true} {12909#false} #57#return; {12909#false} is VALID [2022-04-28 07:58:04,772 INFO L290 TraceCheckUtils]: 89: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,772 INFO L290 TraceCheckUtils]: 88: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,772 INFO L290 TraceCheckUtils]: 87: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,772 INFO L272 TraceCheckUtils]: 86: Hoare triple {12909#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,773 INFO L290 TraceCheckUtils]: 85: Hoare triple {13233#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-28 07:58:04,773 INFO L290 TraceCheckUtils]: 84: Hoare triple {13237#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13233#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:58:04,773 INFO L290 TraceCheckUtils]: 83: Hoare triple {13237#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13237#(< ~counter~0 20)} is VALID [2022-04-28 07:58:04,774 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12908#true} {13237#(< ~counter~0 20)} #55#return; {13237#(< ~counter~0 20)} is VALID [2022-04-28 07:58:04,774 INFO L290 TraceCheckUtils]: 81: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,774 INFO L290 TraceCheckUtils]: 80: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,774 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,774 INFO L272 TraceCheckUtils]: 78: Hoare triple {13237#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {13237#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {13237#(< ~counter~0 20)} is VALID [2022-04-28 07:58:04,775 INFO L290 TraceCheckUtils]: 76: Hoare triple {13262#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13237#(< ~counter~0 20)} is VALID [2022-04-28 07:58:04,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {13262#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13262#(< ~counter~0 19)} is VALID [2022-04-28 07:58:04,776 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12908#true} {13262#(< ~counter~0 19)} #55#return; {13262#(< ~counter~0 19)} is VALID [2022-04-28 07:58:04,776 INFO L290 TraceCheckUtils]: 73: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,776 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,776 INFO L272 TraceCheckUtils]: 70: Hoare triple {13262#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,776 INFO L290 TraceCheckUtils]: 69: Hoare triple {13262#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {13262#(< ~counter~0 19)} is VALID [2022-04-28 07:58:04,776 INFO L290 TraceCheckUtils]: 68: Hoare triple {13287#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13262#(< ~counter~0 19)} is VALID [2022-04-28 07:58:04,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {13287#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13287#(< ~counter~0 18)} is VALID [2022-04-28 07:58:04,777 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13287#(< ~counter~0 18)} #55#return; {13287#(< ~counter~0 18)} is VALID [2022-04-28 07:58:04,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,777 INFO L272 TraceCheckUtils]: 62: Hoare triple {13287#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {13287#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {13287#(< ~counter~0 18)} is VALID [2022-04-28 07:58:04,778 INFO L290 TraceCheckUtils]: 60: Hoare triple {13312#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13287#(< ~counter~0 18)} is VALID [2022-04-28 07:58:04,778 INFO L290 TraceCheckUtils]: 59: Hoare triple {13312#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13312#(< ~counter~0 17)} is VALID [2022-04-28 07:58:04,779 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12908#true} {13312#(< ~counter~0 17)} #55#return; {13312#(< ~counter~0 17)} is VALID [2022-04-28 07:58:04,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,779 INFO L272 TraceCheckUtils]: 54: Hoare triple {13312#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {13312#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {13312#(< ~counter~0 17)} is VALID [2022-04-28 07:58:04,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {13337#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13312#(< ~counter~0 17)} is VALID [2022-04-28 07:58:04,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {13337#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13337#(< ~counter~0 16)} is VALID [2022-04-28 07:58:04,780 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12908#true} {13337#(< ~counter~0 16)} #55#return; {13337#(< ~counter~0 16)} is VALID [2022-04-28 07:58:04,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,781 INFO L272 TraceCheckUtils]: 46: Hoare triple {13337#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {13337#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {13337#(< ~counter~0 16)} is VALID [2022-04-28 07:58:04,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {13362#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13337#(< ~counter~0 16)} is VALID [2022-04-28 07:58:04,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {13362#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13362#(< ~counter~0 15)} is VALID [2022-04-28 07:58:04,782 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12908#true} {13362#(< ~counter~0 15)} #55#return; {13362#(< ~counter~0 15)} is VALID [2022-04-28 07:58:04,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,782 INFO L272 TraceCheckUtils]: 38: Hoare triple {13362#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {13362#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {13362#(< ~counter~0 15)} is VALID [2022-04-28 07:58:04,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {13387#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13362#(< ~counter~0 15)} is VALID [2022-04-28 07:58:04,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {13387#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13387#(< ~counter~0 14)} is VALID [2022-04-28 07:58:04,784 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12908#true} {13387#(< ~counter~0 14)} #55#return; {13387#(< ~counter~0 14)} is VALID [2022-04-28 07:58:04,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,784 INFO L272 TraceCheckUtils]: 30: Hoare triple {13387#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {13387#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {13387#(< ~counter~0 14)} is VALID [2022-04-28 07:58:04,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {13412#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13387#(< ~counter~0 14)} is VALID [2022-04-28 07:58:04,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {13412#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13412#(< ~counter~0 13)} is VALID [2022-04-28 07:58:04,785 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12908#true} {13412#(< ~counter~0 13)} #55#return; {13412#(< ~counter~0 13)} is VALID [2022-04-28 07:58:04,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,786 INFO L272 TraceCheckUtils]: 22: Hoare triple {13412#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {13412#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {13412#(< ~counter~0 13)} is VALID [2022-04-28 07:58:04,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {13437#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13412#(< ~counter~0 13)} is VALID [2022-04-28 07:58:04,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {13437#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13437#(< ~counter~0 12)} is VALID [2022-04-28 07:58:04,787 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12908#true} {13437#(< ~counter~0 12)} #55#return; {13437#(< ~counter~0 12)} is VALID [2022-04-28 07:58:04,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,787 INFO L272 TraceCheckUtils]: 14: Hoare triple {13437#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {13437#(< ~counter~0 12)} is VALID [2022-04-28 07:58:04,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {13462#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13437#(< ~counter~0 12)} is VALID [2022-04-28 07:58:04,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {13462#(< ~counter~0 11)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13462#(< ~counter~0 11)} is VALID [2022-04-28 07:58:04,791 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {13462#(< ~counter~0 11)} #53#return; {13462#(< ~counter~0 11)} is VALID [2022-04-28 07:58:04,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:58:04,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:58:04,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:58:04,791 INFO L272 TraceCheckUtils]: 6: Hoare triple {13462#(< ~counter~0 11)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:58:04,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {13462#(< ~counter~0 11)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13462#(< ~counter~0 11)} is VALID [2022-04-28 07:58:04,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {13462#(< ~counter~0 11)} call #t~ret6 := main(); {13462#(< ~counter~0 11)} is VALID [2022-04-28 07:58:04,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13462#(< ~counter~0 11)} {12908#true} #61#return; {13462#(< ~counter~0 11)} is VALID [2022-04-28 07:58:04,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {13462#(< ~counter~0 11)} assume true; {13462#(< ~counter~0 11)} is VALID [2022-04-28 07:58:04,800 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);~counter~0 := 0; {13462#(< ~counter~0 11)} is VALID [2022-04-28 07:58:04,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-28 07:58:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 20 proven. 162 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 07:58:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169759166] [2022-04-28 07:58:04,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:04,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235567515] [2022-04-28 07:58:04,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235567515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:04,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:04,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 07:58:04,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:04,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721550234] [2022-04-28 07:58:04,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721550234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:04,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:04,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:58:04,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253966968] [2022-04-28 07:58:04,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:04,802 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-28 07:58:04,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:04,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:04,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:04,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:58:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:04,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:58:04,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:58:04,890 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:05,337 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-28 07:58:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 07:58:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-28 07:58:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 07:58:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 07:58:05,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-28 07:58:05,439 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 07:58:05,441 INFO L225 Difference]: With dead ends: 110 [2022-04-28 07:58:05,441 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 07:58:05,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 07:58:05,442 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:05,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 07:58:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 07:58:05,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:05,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:05,601 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:05,601 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:05,603 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 07:58:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:58:05,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:05,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:05,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-28 07:58:05,605 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-28 07:58:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:05,606 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 07:58:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:58:05,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:05,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:05,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:05,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-28 07:58:05,609 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-28 07:58:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:05,609 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-28 07:58:05,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:05,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-28 07:58:05,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:58:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 07:58:05,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:05,836 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:05,867 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 07:58:06,036 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 07:58:06,036 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:06,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-28 07:58:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607796077] [2022-04-28 07:58:06,140 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:06,140 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:06,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-28 07:58:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:06,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662808337] [2022-04-28 07:58:06,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:06,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:06,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684245036] [2022-04-28 07:58:06,162 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:06,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:06,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:06,164 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 07:58:06,187 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 07:59:13,102 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 07:59:13,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:13,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 07:59:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:13,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:13,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {14139#true} call ULTIMATE.init(); {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {14139#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14139#true} {14139#true} #61#return; {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {14139#true} call #t~ret6 := main(); {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {14139#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; {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {14139#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,714 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14139#true} {14139#true} #53#return; {14139#true} is VALID [2022-04-28 07:59:13,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {14139#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:13,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:13,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:13,715 INFO L272 TraceCheckUtils]: 14: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,715 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14139#true} {14177#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:13,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:13,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:13,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:13,716 INFO L272 TraceCheckUtils]: 22: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,717 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14139#true} {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:13,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {14202#(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 * ~y~0 * ~y~0 + ~x~0; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,718 INFO L272 TraceCheckUtils]: 30: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,719 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14139#true} {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #55#return; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {14227#(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 * ~y~0 * ~y~0 + ~x~0; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:59:13,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:59:13,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:59:13,721 INFO L272 TraceCheckUtils]: 38: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,722 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14139#true} {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #55#return; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:59:13,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {14252#(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 * ~y~0 * ~y~0 + ~x~0; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:13,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:13,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:13,723 INFO L272 TraceCheckUtils]: 46: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,724 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14139#true} {14277#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:13,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {14277#(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 * ~y~0 * ~y~0 + ~x~0; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:13,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:13,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:13,725 INFO L272 TraceCheckUtils]: 54: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,726 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14139#true} {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:13,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {14302#(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 * ~y~0 * ~y~0 + ~x~0; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,728 INFO L272 TraceCheckUtils]: 62: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,729 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14139#true} {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {14327#(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 * ~y~0 * ~y~0 + ~x~0; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:13,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:13,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:13,730 INFO L272 TraceCheckUtils]: 70: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,730 INFO L290 TraceCheckUtils]: 72: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,730 INFO L290 TraceCheckUtils]: 73: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,731 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14139#true} {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:13,731 INFO L290 TraceCheckUtils]: 75: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 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 * ~y~0 * ~y~0 + ~x~0; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:59:13,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:59:13,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:59:13,732 INFO L272 TraceCheckUtils]: 78: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,732 INFO L290 TraceCheckUtils]: 79: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,733 INFO L290 TraceCheckUtils]: 81: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,733 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14139#true} {14377#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:59:13,733 INFO L290 TraceCheckUtils]: 83: Hoare triple {14377#(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 * ~y~0 * ~y~0 + ~x~0; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:59:13,734 INFO L290 TraceCheckUtils]: 84: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:59:13,734 INFO L290 TraceCheckUtils]: 85: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:59:13,734 INFO L272 TraceCheckUtils]: 86: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,735 INFO L290 TraceCheckUtils]: 87: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,735 INFO L290 TraceCheckUtils]: 88: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,735 INFO L290 TraceCheckUtils]: 89: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,735 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14139#true} {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:59:13,736 INFO L290 TraceCheckUtils]: 91: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:59:13,736 INFO L272 TraceCheckUtils]: 92: Hoare triple {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-28 07:59:13,736 INFO L290 TraceCheckUtils]: 93: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:59:13,736 INFO L290 TraceCheckUtils]: 94: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:59:13,736 INFO L290 TraceCheckUtils]: 95: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:59:13,737 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14139#true} {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:59:13,738 INFO L272 TraceCheckUtils]: 97: Hoare triple {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:13,738 INFO L290 TraceCheckUtils]: 98: Hoare triple {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:13,738 INFO L290 TraceCheckUtils]: 99: Hoare triple {14450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14140#false} is VALID [2022-04-28 07:59:13,738 INFO L290 TraceCheckUtils]: 100: Hoare triple {14140#false} assume !false; {14140#false} is VALID [2022-04-28 07:59:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 22 proven. 180 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 07:59:13,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:14,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662808337] [2022-04-28 07:59:14,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:14,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684245036] [2022-04-28 07:59:14,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684245036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:14,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:14,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 07:59:14,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:14,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607796077] [2022-04-28 07:59:14,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607796077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:14,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:14,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 07:59:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864281031] [2022-04-28 07:59:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 101 [2022-04-28 07:59:14,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:14,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 07:59:14,137 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 07:59:14,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 07:59:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:14,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 07:59:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:59:14,138 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 07:59:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:15,303 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-28 07:59:15,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 07:59:15,303 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 101 [2022-04-28 07:59:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 07:59:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 07:59:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 07:59:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 07:59:15,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-28 07:59:15,385 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 07:59:15,387 INFO L225 Difference]: With dead ends: 108 [2022-04-28 07:59:15,387 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 07:59:15,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:59:15,388 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:15,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 557 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:59:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 07:59:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-28 07:59:15,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:15,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:15,542 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:15,542 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:15,543 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 07:59:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 07:59:15,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:15,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:15,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-28 07:59:15,548 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-28 07:59:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:15,549 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 07:59:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 07:59:15,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:15,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:15,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:15,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-28 07:59:15,552 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-28 07:59:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:15,552 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-28 07:59:15,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 07:59:15,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-28 07:59:15,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 07:59:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 07:59:15,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:15,776 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:15,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:15,976 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 07:59:15,976 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-28 07:59:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:15,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1786533814] [2022-04-28 07:59:16,058 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:16,058 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:16,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-28 07:59:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:16,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766557438] [2022-04-28 07:59:16,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:16,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:16,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:16,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685662956] [2022-04-28 07:59:16,070 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:16,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:16,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:16,071 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 07:59:16,071 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 07:59:16,700 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-28 07:59:16,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:16,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 07:59:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:16,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:17,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-28 07:59:17,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15152#(<= ~counter~0 0)} {15144#true} #61#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {15152#(<= ~counter~0 0)} call #t~ret6 := main(); {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {15152#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {15152#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {15152#(<= ~counter~0 0)} ~cond := #in~cond; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {15152#(<= ~counter~0 0)} assume !(0 == ~cond); {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15152#(<= ~counter~0 0)} {15152#(<= ~counter~0 0)} #53#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {15152#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:17,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {15152#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:17,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {15186#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:17,195 INFO L272 TraceCheckUtils]: 14: Hoare triple {15186#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:17,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {15186#(<= ~counter~0 1)} ~cond := #in~cond; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:17,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {15186#(<= ~counter~0 1)} assume !(0 == ~cond); {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:17,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {15186#(<= ~counter~0 1)} assume true; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:17,196 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15186#(<= ~counter~0 1)} {15186#(<= ~counter~0 1)} #55#return; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:17,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {15186#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:17,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {15186#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:17,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {15211#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:17,198 INFO L272 TraceCheckUtils]: 22: Hoare triple {15211#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:17,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {15211#(<= ~counter~0 2)} ~cond := #in~cond; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:17,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {15211#(<= ~counter~0 2)} assume !(0 == ~cond); {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:17,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {15211#(<= ~counter~0 2)} assume true; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:17,199 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15211#(<= ~counter~0 2)} {15211#(<= ~counter~0 2)} #55#return; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:17,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {15211#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:17,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {15211#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:17,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {15236#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:17,200 INFO L272 TraceCheckUtils]: 30: Hoare triple {15236#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:17,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {15236#(<= ~counter~0 3)} ~cond := #in~cond; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:17,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {15236#(<= ~counter~0 3)} assume !(0 == ~cond); {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:17,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {15236#(<= ~counter~0 3)} assume true; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:17,201 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15236#(<= ~counter~0 3)} {15236#(<= ~counter~0 3)} #55#return; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:17,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {15236#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:17,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {15236#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:17,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {15261#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:17,203 INFO L272 TraceCheckUtils]: 38: Hoare triple {15261#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:17,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {15261#(<= ~counter~0 4)} ~cond := #in~cond; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:17,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {15261#(<= ~counter~0 4)} assume !(0 == ~cond); {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:17,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {15261#(<= ~counter~0 4)} assume true; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:17,204 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15261#(<= ~counter~0 4)} {15261#(<= ~counter~0 4)} #55#return; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:17,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {15261#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:17,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {15261#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:17,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {15286#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:17,205 INFO L272 TraceCheckUtils]: 46: Hoare triple {15286#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:17,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {15286#(<= ~counter~0 5)} ~cond := #in~cond; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:17,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {15286#(<= ~counter~0 5)} assume !(0 == ~cond); {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:17,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(<= ~counter~0 5)} assume true; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:17,206 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15286#(<= ~counter~0 5)} {15286#(<= ~counter~0 5)} #55#return; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:17,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {15286#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:17,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {15286#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:17,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {15311#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:17,208 INFO L272 TraceCheckUtils]: 54: Hoare triple {15311#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:17,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {15311#(<= ~counter~0 6)} ~cond := #in~cond; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:17,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {15311#(<= ~counter~0 6)} assume !(0 == ~cond); {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:17,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {15311#(<= ~counter~0 6)} assume true; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:17,209 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15311#(<= ~counter~0 6)} {15311#(<= ~counter~0 6)} #55#return; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:17,209 INFO L290 TraceCheckUtils]: 59: Hoare triple {15311#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:17,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {15311#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:17,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {15336#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:17,210 INFO L272 TraceCheckUtils]: 62: Hoare triple {15336#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:17,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(<= ~counter~0 7)} ~cond := #in~cond; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:17,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(<= ~counter~0 7)} assume !(0 == ~cond); {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:17,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(<= ~counter~0 7)} assume true; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:17,211 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15336#(<= ~counter~0 7)} {15336#(<= ~counter~0 7)} #55#return; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:17,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {15336#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:17,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {15336#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:17,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {15361#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:17,213 INFO L272 TraceCheckUtils]: 70: Hoare triple {15361#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:17,213 INFO L290 TraceCheckUtils]: 71: Hoare triple {15361#(<= ~counter~0 8)} ~cond := #in~cond; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:17,213 INFO L290 TraceCheckUtils]: 72: Hoare triple {15361#(<= ~counter~0 8)} assume !(0 == ~cond); {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:17,213 INFO L290 TraceCheckUtils]: 73: Hoare triple {15361#(<= ~counter~0 8)} assume true; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:17,214 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15361#(<= ~counter~0 8)} {15361#(<= ~counter~0 8)} #55#return; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:17,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {15361#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:17,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {15361#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {15386#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,215 INFO L272 TraceCheckUtils]: 78: Hoare triple {15386#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,216 INFO L290 TraceCheckUtils]: 79: Hoare triple {15386#(<= ~counter~0 9)} ~cond := #in~cond; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,216 INFO L290 TraceCheckUtils]: 80: Hoare triple {15386#(<= ~counter~0 9)} assume !(0 == ~cond); {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,216 INFO L290 TraceCheckUtils]: 81: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,216 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15386#(<= ~counter~0 9)} {15386#(<= ~counter~0 9)} #55#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,217 INFO L290 TraceCheckUtils]: 83: Hoare triple {15386#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,217 INFO L290 TraceCheckUtils]: 84: Hoare triple {15386#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,217 INFO L290 TraceCheckUtils]: 85: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,218 INFO L272 TraceCheckUtils]: 86: Hoare triple {15411#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,218 INFO L290 TraceCheckUtils]: 87: Hoare triple {15411#(<= ~counter~0 10)} ~cond := #in~cond; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,218 INFO L290 TraceCheckUtils]: 88: Hoare triple {15411#(<= ~counter~0 10)} assume !(0 == ~cond); {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,219 INFO L290 TraceCheckUtils]: 89: Hoare triple {15411#(<= ~counter~0 10)} assume true; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,219 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15411#(<= ~counter~0 10)} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,219 INFO L290 TraceCheckUtils]: 91: Hoare triple {15411#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,220 INFO L290 TraceCheckUtils]: 92: Hoare triple {15411#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15436#(<= |main_#t~post5| 10)} is VALID [2022-04-28 07:59:17,220 INFO L290 TraceCheckUtils]: 93: Hoare triple {15436#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L272 TraceCheckUtils]: 94: Hoare triple {15145#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L290 TraceCheckUtils]: 95: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L290 TraceCheckUtils]: 96: Hoare triple {15145#false} assume !(0 == ~cond); {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L290 TraceCheckUtils]: 97: Hoare triple {15145#false} assume true; {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15145#false} {15145#false} #57#return; {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L272 TraceCheckUtils]: 99: Hoare triple {15145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-28 07:59:17,220 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-28 07:59:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:59:17,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:17,778 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-28 07:59:17,778 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-28 07:59:17,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 07:59:17,778 INFO L272 TraceCheckUtils]: 99: Hoare triple {15145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {15145#false} is VALID [2022-04-28 07:59:17,778 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15144#true} {15145#false} #57#return; {15145#false} is VALID [2022-04-28 07:59:17,778 INFO L290 TraceCheckUtils]: 97: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,778 INFO L290 TraceCheckUtils]: 96: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,778 INFO L290 TraceCheckUtils]: 95: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,778 INFO L272 TraceCheckUtils]: 94: Hoare triple {15145#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,778 INFO L290 TraceCheckUtils]: 93: Hoare triple {15494#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-28 07:59:17,779 INFO L290 TraceCheckUtils]: 92: Hoare triple {15498#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15494#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:59:17,779 INFO L290 TraceCheckUtils]: 91: Hoare triple {15498#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15498#(< ~counter~0 20)} is VALID [2022-04-28 07:59:17,780 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15144#true} {15498#(< ~counter~0 20)} #55#return; {15498#(< ~counter~0 20)} is VALID [2022-04-28 07:59:17,780 INFO L290 TraceCheckUtils]: 89: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,780 INFO L290 TraceCheckUtils]: 88: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,780 INFO L290 TraceCheckUtils]: 87: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,780 INFO L272 TraceCheckUtils]: 86: Hoare triple {15498#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {15498#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {15498#(< ~counter~0 20)} is VALID [2022-04-28 07:59:17,781 INFO L290 TraceCheckUtils]: 84: Hoare triple {15523#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15498#(< ~counter~0 20)} is VALID [2022-04-28 07:59:17,781 INFO L290 TraceCheckUtils]: 83: Hoare triple {15523#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15523#(< ~counter~0 19)} is VALID [2022-04-28 07:59:17,781 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15144#true} {15523#(< ~counter~0 19)} #55#return; {15523#(< ~counter~0 19)} is VALID [2022-04-28 07:59:17,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,782 INFO L272 TraceCheckUtils]: 78: Hoare triple {15523#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {15523#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {15523#(< ~counter~0 19)} is VALID [2022-04-28 07:59:17,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {15548#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15523#(< ~counter~0 19)} is VALID [2022-04-28 07:59:17,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {15548#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15548#(< ~counter~0 18)} is VALID [2022-04-28 07:59:17,783 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15144#true} {15548#(< ~counter~0 18)} #55#return; {15548#(< ~counter~0 18)} is VALID [2022-04-28 07:59:17,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,783 INFO L272 TraceCheckUtils]: 70: Hoare triple {15548#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {15548#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {15548#(< ~counter~0 18)} is VALID [2022-04-28 07:59:17,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {15573#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15548#(< ~counter~0 18)} is VALID [2022-04-28 07:59:17,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {15573#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15573#(< ~counter~0 17)} is VALID [2022-04-28 07:59:17,785 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15144#true} {15573#(< ~counter~0 17)} #55#return; {15573#(< ~counter~0 17)} is VALID [2022-04-28 07:59:17,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,785 INFO L272 TraceCheckUtils]: 62: Hoare triple {15573#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,787 INFO L290 TraceCheckUtils]: 61: Hoare triple {15573#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {15573#(< ~counter~0 17)} is VALID [2022-04-28 07:59:17,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {15598#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15573#(< ~counter~0 17)} is VALID [2022-04-28 07:59:17,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {15598#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15598#(< ~counter~0 16)} is VALID [2022-04-28 07:59:17,789 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15144#true} {15598#(< ~counter~0 16)} #55#return; {15598#(< ~counter~0 16)} is VALID [2022-04-28 07:59:17,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,789 INFO L272 TraceCheckUtils]: 54: Hoare triple {15598#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {15598#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {15598#(< ~counter~0 16)} is VALID [2022-04-28 07:59:17,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {15623#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15598#(< ~counter~0 16)} is VALID [2022-04-28 07:59:17,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {15623#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15623#(< ~counter~0 15)} is VALID [2022-04-28 07:59:17,791 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15144#true} {15623#(< ~counter~0 15)} #55#return; {15623#(< ~counter~0 15)} is VALID [2022-04-28 07:59:17,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,791 INFO L290 TraceCheckUtils]: 47: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,791 INFO L272 TraceCheckUtils]: 46: Hoare triple {15623#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {15623#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {15623#(< ~counter~0 15)} is VALID [2022-04-28 07:59:17,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {15648#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15623#(< ~counter~0 15)} is VALID [2022-04-28 07:59:17,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {15648#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15648#(< ~counter~0 14)} is VALID [2022-04-28 07:59:17,792 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15144#true} {15648#(< ~counter~0 14)} #55#return; {15648#(< ~counter~0 14)} is VALID [2022-04-28 07:59:17,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,792 INFO L272 TraceCheckUtils]: 38: Hoare triple {15648#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {15648#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {15648#(< ~counter~0 14)} is VALID [2022-04-28 07:59:17,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {15673#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15648#(< ~counter~0 14)} is VALID [2022-04-28 07:59:17,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {15673#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15673#(< ~counter~0 13)} is VALID [2022-04-28 07:59:17,794 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15144#true} {15673#(< ~counter~0 13)} #55#return; {15673#(< ~counter~0 13)} is VALID [2022-04-28 07:59:17,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,794 INFO L272 TraceCheckUtils]: 30: Hoare triple {15673#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {15673#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {15673#(< ~counter~0 13)} is VALID [2022-04-28 07:59:17,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15673#(< ~counter~0 13)} is VALID [2022-04-28 07:59:17,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {15698#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15698#(< ~counter~0 12)} is VALID [2022-04-28 07:59:17,798 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15144#true} {15698#(< ~counter~0 12)} #55#return; {15698#(< ~counter~0 12)} is VALID [2022-04-28 07:59:17,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,798 INFO L272 TraceCheckUtils]: 22: Hoare triple {15698#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {15698#(< ~counter~0 12)} is VALID [2022-04-28 07:59:17,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {15411#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15698#(< ~counter~0 12)} is VALID [2022-04-28 07:59:17,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {15411#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,801 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15144#true} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,801 INFO L272 TraceCheckUtils]: 14: Hoare triple {15411#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {15386#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:17,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {15386#(<= ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,804 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15144#true} {15386#(<= ~counter~0 9)} #53#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:59:17,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:59:17,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:59:17,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {15386#(<= ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:59:17,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {15386#(<= ~counter~0 9)} 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; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {15386#(<= ~counter~0 9)} call #t~ret6 := main(); {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15386#(<= ~counter~0 9)} {15144#true} #61#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:17,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-28 07:59:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 07:59:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:17,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766557438] [2022-04-28 07:59:17,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:17,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685662956] [2022-04-28 07:59:17,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685662956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:17,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:17,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-28 07:59:17,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:17,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1786533814] [2022-04-28 07:59:17,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1786533814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:17,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:17,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:59:17,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425180170] [2022-04-28 07:59:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 103 [2022-04-28 07:59:17,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:17,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:17,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:17,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:59:17,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:17,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:59:17,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:59:17,880 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:18,291 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2022-04-28 07:59:18,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 07:59:18,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 103 [2022-04-28 07:59:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-28 07:59:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-28 07:59:18,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2022-04-28 07:59:18,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:18,376 INFO L225 Difference]: With dead ends: 118 [2022-04-28 07:59:18,376 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 07:59:18,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=466, Invalid=656, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 07:59:18,376 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:18,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 07:59:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-28 07:59:18,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:18,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:18,530 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:18,530 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:18,532 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-28 07:59:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 07:59:18,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:18,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:18,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 108 states. [2022-04-28 07:59:18,533 INFO L87 Difference]: Start difference. First operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 108 states. [2022-04-28 07:59:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:18,535 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-28 07:59:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 07:59:18,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:18,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:18,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:18,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2022-04-28 07:59:18,537 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 103 [2022-04-28 07:59:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:18,537 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2022-04-28 07:59:18,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:18,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 110 transitions. [2022-04-28 07:59:18,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 07:59:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 07:59:18,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:18,715 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:18,723 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 07:59:18,916 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 07:59:18,916 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 19 times [2022-04-28 07:59:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:18,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104059559] [2022-04-28 07:59:19,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:19,001 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:19,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:19,002 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 20 times [2022-04-28 07:59:19,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:19,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342610924] [2022-04-28 07:59:19,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:19,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:19,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401808008] [2022-04-28 07:59:19,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:19,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:19,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:19,032 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 07:59:19,059 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 07:59:19,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:19,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:19,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 07:59:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:19,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:20,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {16473#true} call ULTIMATE.init(); {16473#true} is VALID [2022-04-28 07:59:20,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {16473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16473#true} is VALID [2022-04-28 07:59:20,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16473#true} {16473#true} #61#return; {16473#true} is VALID [2022-04-28 07:59:20,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {16473#true} call #t~ret6 := main(); {16473#true} is VALID [2022-04-28 07:59:20,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {16473#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; {16473#true} is VALID [2022-04-28 07:59:20,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {16473#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16473#true} {16473#true} #53#return; {16473#true} is VALID [2022-04-28 07:59:20,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {16473#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:20,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:20,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:20,499 INFO L272 TraceCheckUtils]: 14: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,500 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16473#true} {16511#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:20,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:20,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:20,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:20,501 INFO L272 TraceCheckUtils]: 22: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,502 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16473#true} {16536#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:20,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:59:20,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:59:20,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:59:20,503 INFO L272 TraceCheckUtils]: 30: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,503 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16473#true} {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:59:20,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:59:20,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:59:20,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:59:20,504 INFO L272 TraceCheckUtils]: 38: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,505 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16473#true} {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #55#return; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:59:20,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {16586#(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 * ~y~0 * ~y~0 + ~x~0; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:20,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:20,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:20,506 INFO L272 TraceCheckUtils]: 46: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,506 INFO L290 TraceCheckUtils]: 48: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,507 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16473#true} {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:20,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {16611#(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 * ~y~0 * ~y~0 + ~x~0; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:20,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:20,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:20,508 INFO L272 TraceCheckUtils]: 54: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,508 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16473#true} {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:20,509 INFO L290 TraceCheckUtils]: 59: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:20,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:20,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:20,509 INFO L272 TraceCheckUtils]: 62: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,510 INFO L290 TraceCheckUtils]: 64: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,510 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16473#true} {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #55#return; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:20,510 INFO L290 TraceCheckUtils]: 67: Hoare triple {16661#(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 * ~y~0 * ~y~0 + ~x~0; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:59:20,511 INFO L290 TraceCheckUtils]: 68: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:59:20,511 INFO L290 TraceCheckUtils]: 69: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:59:20,511 INFO L272 TraceCheckUtils]: 70: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,511 INFO L290 TraceCheckUtils]: 71: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,511 INFO L290 TraceCheckUtils]: 72: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,511 INFO L290 TraceCheckUtils]: 73: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,512 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16473#true} {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #55#return; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:59:20,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:59:20,513 INFO L290 TraceCheckUtils]: 76: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:59:20,513 INFO L290 TraceCheckUtils]: 77: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:59:20,513 INFO L272 TraceCheckUtils]: 78: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,513 INFO L290 TraceCheckUtils]: 79: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,513 INFO L290 TraceCheckUtils]: 80: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,513 INFO L290 TraceCheckUtils]: 81: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,513 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16473#true} {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #55#return; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:59:20,514 INFO L290 TraceCheckUtils]: 83: Hoare triple {16711#(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 * ~y~0 * ~y~0 + ~x~0; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:59:20,514 INFO L290 TraceCheckUtils]: 84: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:59:20,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 20);havoc #t~post5; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:59:20,515 INFO L272 TraceCheckUtils]: 86: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,515 INFO L290 TraceCheckUtils]: 87: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,515 INFO L290 TraceCheckUtils]: 89: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,515 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16473#true} {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #55#return; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:59:20,516 INFO L290 TraceCheckUtils]: 91: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:20,516 INFO L290 TraceCheckUtils]: 92: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:20,516 INFO L290 TraceCheckUtils]: 93: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:20,516 INFO L272 TraceCheckUtils]: 94: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,516 INFO L290 TraceCheckUtils]: 95: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,516 INFO L290 TraceCheckUtils]: 96: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,517 INFO L290 TraceCheckUtils]: 97: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,517 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16473#true} {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #55#return; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:20,518 INFO L290 TraceCheckUtils]: 99: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:20,518 INFO L272 TraceCheckUtils]: 100: Hoare triple {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 07:59:20,518 INFO L290 TraceCheckUtils]: 101: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 07:59:20,518 INFO L290 TraceCheckUtils]: 102: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 07:59:20,518 INFO L290 TraceCheckUtils]: 103: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 07:59:20,518 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {16473#true} {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} #57#return; {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:59:20,519 INFO L272 TraceCheckUtils]: 105: Hoare triple {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:20,519 INFO L290 TraceCheckUtils]: 106: Hoare triple {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:20,520 INFO L290 TraceCheckUtils]: 107: Hoare triple {16809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16474#false} is VALID [2022-04-28 07:59:20,520 INFO L290 TraceCheckUtils]: 108: Hoare triple {16474#false} assume !false; {16474#false} is VALID [2022-04-28 07:59:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 07:59:20,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:20,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:20,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342610924] [2022-04-28 07:59:20,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:20,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401808008] [2022-04-28 07:59:20,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401808008] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:20,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:20,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 07:59:20,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:20,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104059559] [2022-04-28 07:59:20,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104059559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:20,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:20,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:59:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582271296] [2022-04-28 07:59:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:20,860 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 109 [2022-04-28 07:59:20,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:20,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 07:59:20,921 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 07:59:20,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:59:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:59:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:59:20,922 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 07:59:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:22,383 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-28 07:59:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:59:22,384 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 109 [2022-04-28 07:59:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 07:59:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-28 07:59:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 07:59:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-28 07:59:22,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-28 07:59:22,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:22,480 INFO L225 Difference]: With dead ends: 116 [2022-04-28 07:59:22,480 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 07:59:22,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:59:22,480 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:22,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 07:59:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 07:59:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-28 07:59:22,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:22,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:22,658 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:22,658 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:22,660 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-28 07:59:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 07:59:22,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:22,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:22,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 110 states. [2022-04-28 07:59:22,660 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 110 states. [2022-04-28 07:59:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:22,663 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-28 07:59:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 07:59:22,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:22,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:22,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:22,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2022-04-28 07:59:22,666 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 109 [2022-04-28 07:59:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:22,666 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2022-04-28 07:59:22,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 07:59:22,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 113 transitions. [2022-04-28 07:59:22,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 07:59:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 07:59:22,891 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:22,891 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:22,896 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 07:59:23,091 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 07:59:23,092 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 19 times [2022-04-28 07:59:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:23,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679875627] [2022-04-28 07:59:23,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:23,174 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:23,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:23,174 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 20 times [2022-04-28 07:59:23,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:23,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492167809] [2022-04-28 07:59:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:23,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:23,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361945141] [2022-04-28 07:59:23,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:23,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:23,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:23,190 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:23,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 07:59:23,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:23,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:23,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 07:59:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:23,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:23,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-28 07:59:23,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {17551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17559#(<= ~counter~0 0)} {17551#true} #61#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {17559#(<= ~counter~0 0)} call #t~ret6 := main(); {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {17559#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {17559#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {17559#(<= ~counter~0 0)} ~cond := #in~cond; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {17559#(<= ~counter~0 0)} assume !(0 == ~cond); {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17559#(<= ~counter~0 0)} {17559#(<= ~counter~0 0)} #53#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {17559#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:23,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {17559#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:23,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {17593#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:23,808 INFO L272 TraceCheckUtils]: 14: Hoare triple {17593#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17593#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:23,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {17593#(<= ~counter~0 1)} ~cond := #in~cond; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:23,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {17593#(<= ~counter~0 1)} assume !(0 == ~cond); {17593#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:23,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {17593#(<= ~counter~0 1)} assume true; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:23,809 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17593#(<= ~counter~0 1)} {17593#(<= ~counter~0 1)} #55#return; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:23,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {17593#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:23,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {17593#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:23,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {17618#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:23,810 INFO L272 TraceCheckUtils]: 22: Hoare triple {17618#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17618#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:23,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {17618#(<= ~counter~0 2)} ~cond := #in~cond; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:23,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {17618#(<= ~counter~0 2)} assume !(0 == ~cond); {17618#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:23,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {17618#(<= ~counter~0 2)} assume true; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:23,812 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17618#(<= ~counter~0 2)} {17618#(<= ~counter~0 2)} #55#return; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:23,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {17618#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:23,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {17618#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:23,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {17643#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:23,813 INFO L272 TraceCheckUtils]: 30: Hoare triple {17643#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17643#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:23,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {17643#(<= ~counter~0 3)} ~cond := #in~cond; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:23,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {17643#(<= ~counter~0 3)} assume !(0 == ~cond); {17643#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:23,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {17643#(<= ~counter~0 3)} assume true; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:23,814 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17643#(<= ~counter~0 3)} {17643#(<= ~counter~0 3)} #55#return; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:23,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {17643#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:23,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {17643#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:23,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {17668#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:23,816 INFO L272 TraceCheckUtils]: 38: Hoare triple {17668#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17668#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:23,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {17668#(<= ~counter~0 4)} ~cond := #in~cond; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:23,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {17668#(<= ~counter~0 4)} assume !(0 == ~cond); {17668#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:23,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {17668#(<= ~counter~0 4)} assume true; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:23,817 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17668#(<= ~counter~0 4)} {17668#(<= ~counter~0 4)} #55#return; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:23,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {17668#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:23,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {17668#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:23,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {17693#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:23,818 INFO L272 TraceCheckUtils]: 46: Hoare triple {17693#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17693#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:23,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {17693#(<= ~counter~0 5)} ~cond := #in~cond; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:23,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {17693#(<= ~counter~0 5)} assume !(0 == ~cond); {17693#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:23,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {17693#(<= ~counter~0 5)} assume true; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:23,819 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17693#(<= ~counter~0 5)} {17693#(<= ~counter~0 5)} #55#return; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:23,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {17693#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:23,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {17693#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:23,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {17718#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:23,821 INFO L272 TraceCheckUtils]: 54: Hoare triple {17718#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17718#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:23,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {17718#(<= ~counter~0 6)} ~cond := #in~cond; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:23,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {17718#(<= ~counter~0 6)} assume !(0 == ~cond); {17718#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:23,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {17718#(<= ~counter~0 6)} assume true; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:23,822 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17718#(<= ~counter~0 6)} {17718#(<= ~counter~0 6)} #55#return; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:23,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {17718#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:23,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {17718#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:23,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {17743#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:23,823 INFO L272 TraceCheckUtils]: 62: Hoare triple {17743#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17743#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:23,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {17743#(<= ~counter~0 7)} ~cond := #in~cond; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:23,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {17743#(<= ~counter~0 7)} assume !(0 == ~cond); {17743#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:23,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {17743#(<= ~counter~0 7)} assume true; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:23,824 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17743#(<= ~counter~0 7)} {17743#(<= ~counter~0 7)} #55#return; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:23,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {17743#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:23,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {17743#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:23,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {17768#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:23,826 INFO L272 TraceCheckUtils]: 70: Hoare triple {17768#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:23,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {17768#(<= ~counter~0 8)} ~cond := #in~cond; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:23,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {17768#(<= ~counter~0 8)} assume !(0 == ~cond); {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:23,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:23,827 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17768#(<= ~counter~0 8)} {17768#(<= ~counter~0 8)} #55#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:23,827 INFO L290 TraceCheckUtils]: 75: Hoare triple {17768#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:23,828 INFO L290 TraceCheckUtils]: 76: Hoare triple {17768#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:23,828 INFO L290 TraceCheckUtils]: 77: Hoare triple {17793#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:23,828 INFO L272 TraceCheckUtils]: 78: Hoare triple {17793#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:23,829 INFO L290 TraceCheckUtils]: 79: Hoare triple {17793#(<= ~counter~0 9)} ~cond := #in~cond; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:23,829 INFO L290 TraceCheckUtils]: 80: Hoare triple {17793#(<= ~counter~0 9)} assume !(0 == ~cond); {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:23,829 INFO L290 TraceCheckUtils]: 81: Hoare triple {17793#(<= ~counter~0 9)} assume true; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:23,830 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17793#(<= ~counter~0 9)} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:23,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {17793#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:23,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {17793#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:23,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {17818#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:23,831 INFO L272 TraceCheckUtils]: 86: Hoare triple {17818#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:23,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {17818#(<= ~counter~0 10)} ~cond := #in~cond; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:23,832 INFO L290 TraceCheckUtils]: 88: Hoare triple {17818#(<= ~counter~0 10)} assume !(0 == ~cond); {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:23,832 INFO L290 TraceCheckUtils]: 89: Hoare triple {17818#(<= ~counter~0 10)} assume true; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:23,832 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17818#(<= ~counter~0 10)} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:23,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {17818#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:23,833 INFO L290 TraceCheckUtils]: 92: Hoare triple {17818#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:23,833 INFO L290 TraceCheckUtils]: 93: Hoare triple {17843#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:23,834 INFO L272 TraceCheckUtils]: 94: Hoare triple {17843#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:23,834 INFO L290 TraceCheckUtils]: 95: Hoare triple {17843#(<= ~counter~0 11)} ~cond := #in~cond; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:23,834 INFO L290 TraceCheckUtils]: 96: Hoare triple {17843#(<= ~counter~0 11)} assume !(0 == ~cond); {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:23,834 INFO L290 TraceCheckUtils]: 97: Hoare triple {17843#(<= ~counter~0 11)} assume true; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:23,835 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17843#(<= ~counter~0 11)} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:23,835 INFO L290 TraceCheckUtils]: 99: Hoare triple {17843#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:23,835 INFO L290 TraceCheckUtils]: 100: Hoare triple {17843#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17868#(<= |main_#t~post5| 11)} is VALID [2022-04-28 07:59:23,836 INFO L290 TraceCheckUtils]: 101: Hoare triple {17868#(<= |main_#t~post5| 11)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L272 TraceCheckUtils]: 102: Hoare triple {17552#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L290 TraceCheckUtils]: 103: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L290 TraceCheckUtils]: 104: Hoare triple {17552#false} assume !(0 == ~cond); {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L290 TraceCheckUtils]: 105: Hoare triple {17552#false} assume true; {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17552#false} {17552#false} #57#return; {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L272 TraceCheckUtils]: 107: Hoare triple {17552#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-28 07:59:23,836 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-28 07:59:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:59:23,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:24,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-28 07:59:24,381 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-28 07:59:24,381 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-28 07:59:24,381 INFO L272 TraceCheckUtils]: 107: Hoare triple {17552#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17552#false} is VALID [2022-04-28 07:59:24,381 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17551#true} {17552#false} #57#return; {17552#false} is VALID [2022-04-28 07:59:24,381 INFO L290 TraceCheckUtils]: 105: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,381 INFO L290 TraceCheckUtils]: 104: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,381 INFO L290 TraceCheckUtils]: 103: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,381 INFO L272 TraceCheckUtils]: 102: Hoare triple {17552#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,381 INFO L290 TraceCheckUtils]: 101: Hoare triple {17926#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-28 07:59:24,382 INFO L290 TraceCheckUtils]: 100: Hoare triple {17930#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17926#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:59:24,382 INFO L290 TraceCheckUtils]: 99: Hoare triple {17930#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17930#(< ~counter~0 20)} is VALID [2022-04-28 07:59:24,382 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17551#true} {17930#(< ~counter~0 20)} #55#return; {17930#(< ~counter~0 20)} is VALID [2022-04-28 07:59:24,382 INFO L290 TraceCheckUtils]: 97: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,382 INFO L290 TraceCheckUtils]: 96: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,382 INFO L290 TraceCheckUtils]: 95: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,383 INFO L272 TraceCheckUtils]: 94: Hoare triple {17930#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,383 INFO L290 TraceCheckUtils]: 93: Hoare triple {17930#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {17930#(< ~counter~0 20)} is VALID [2022-04-28 07:59:24,384 INFO L290 TraceCheckUtils]: 92: Hoare triple {17955#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17930#(< ~counter~0 20)} is VALID [2022-04-28 07:59:24,384 INFO L290 TraceCheckUtils]: 91: Hoare triple {17955#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17955#(< ~counter~0 19)} is VALID [2022-04-28 07:59:24,384 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17551#true} {17955#(< ~counter~0 19)} #55#return; {17955#(< ~counter~0 19)} is VALID [2022-04-28 07:59:24,384 INFO L290 TraceCheckUtils]: 89: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,385 INFO L272 TraceCheckUtils]: 86: Hoare triple {17955#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {17955#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {17955#(< ~counter~0 19)} is VALID [2022-04-28 07:59:24,386 INFO L290 TraceCheckUtils]: 84: Hoare triple {17980#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17955#(< ~counter~0 19)} is VALID [2022-04-28 07:59:24,386 INFO L290 TraceCheckUtils]: 83: Hoare triple {17980#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17980#(< ~counter~0 18)} is VALID [2022-04-28 07:59:24,386 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17551#true} {17980#(< ~counter~0 18)} #55#return; {17980#(< ~counter~0 18)} is VALID [2022-04-28 07:59:24,387 INFO L290 TraceCheckUtils]: 81: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,387 INFO L272 TraceCheckUtils]: 78: Hoare triple {17980#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {17980#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {17980#(< ~counter~0 18)} is VALID [2022-04-28 07:59:24,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {18005#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17980#(< ~counter~0 18)} is VALID [2022-04-28 07:59:24,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {18005#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18005#(< ~counter~0 17)} is VALID [2022-04-28 07:59:24,388 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17551#true} {18005#(< ~counter~0 17)} #55#return; {18005#(< ~counter~0 17)} is VALID [2022-04-28 07:59:24,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,388 INFO L272 TraceCheckUtils]: 70: Hoare triple {18005#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {18005#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {18005#(< ~counter~0 17)} is VALID [2022-04-28 07:59:24,389 INFO L290 TraceCheckUtils]: 68: Hoare triple {18030#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18005#(< ~counter~0 17)} is VALID [2022-04-28 07:59:24,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {18030#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18030#(< ~counter~0 16)} is VALID [2022-04-28 07:59:24,390 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17551#true} {18030#(< ~counter~0 16)} #55#return; {18030#(< ~counter~0 16)} is VALID [2022-04-28 07:59:24,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,390 INFO L290 TraceCheckUtils]: 64: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,390 INFO L290 TraceCheckUtils]: 63: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,390 INFO L272 TraceCheckUtils]: 62: Hoare triple {18030#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {18030#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {18030#(< ~counter~0 16)} is VALID [2022-04-28 07:59:24,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {18055#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18030#(< ~counter~0 16)} is VALID [2022-04-28 07:59:24,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {18055#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18055#(< ~counter~0 15)} is VALID [2022-04-28 07:59:24,392 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17551#true} {18055#(< ~counter~0 15)} #55#return; {18055#(< ~counter~0 15)} is VALID [2022-04-28 07:59:24,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,392 INFO L272 TraceCheckUtils]: 54: Hoare triple {18055#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {18055#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {18055#(< ~counter~0 15)} is VALID [2022-04-28 07:59:24,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {18080#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18055#(< ~counter~0 15)} is VALID [2022-04-28 07:59:24,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {18080#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18080#(< ~counter~0 14)} is VALID [2022-04-28 07:59:24,393 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17551#true} {18080#(< ~counter~0 14)} #55#return; {18080#(< ~counter~0 14)} is VALID [2022-04-28 07:59:24,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,393 INFO L272 TraceCheckUtils]: 46: Hoare triple {18080#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {18080#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {18080#(< ~counter~0 14)} is VALID [2022-04-28 07:59:24,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {18105#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18080#(< ~counter~0 14)} is VALID [2022-04-28 07:59:24,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {18105#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18105#(< ~counter~0 13)} is VALID [2022-04-28 07:59:24,395 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17551#true} {18105#(< ~counter~0 13)} #55#return; {18105#(< ~counter~0 13)} is VALID [2022-04-28 07:59:24,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,395 INFO L272 TraceCheckUtils]: 38: Hoare triple {18105#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {18105#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {18105#(< ~counter~0 13)} is VALID [2022-04-28 07:59:24,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {17843#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18105#(< ~counter~0 13)} is VALID [2022-04-28 07:59:24,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {17843#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:24,397 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17551#true} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:24,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,397 INFO L272 TraceCheckUtils]: 30: Hoare triple {17843#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {17843#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:24,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {17818#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:24,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {17818#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:24,398 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17551#true} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:24,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,399 INFO L272 TraceCheckUtils]: 22: Hoare triple {17818#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {17818#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:24,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {17793#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:24,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {17793#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:24,400 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17551#true} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:24,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,400 INFO L272 TraceCheckUtils]: 14: Hoare triple {17793#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {17793#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:24,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {17768#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:24,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {17768#(<= ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:24,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17551#true} {17768#(<= ~counter~0 8)} #53#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:24,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 07:59:24,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 07:59:24,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 07:59:24,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {17768#(<= ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17551#true} is VALID [2022-04-28 07:59:24,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {17768#(<= ~counter~0 8)} 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; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:24,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {17768#(<= ~counter~0 8)} call #t~ret6 := main(); {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:24,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17768#(<= ~counter~0 8)} {17551#true} #61#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:24,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:24,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {17551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:24,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-28 07:59:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 07:59:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492167809] [2022-04-28 07:59:24,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361945141] [2022-04-28 07:59:24,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361945141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:24,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:24,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-28 07:59:24,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679875627] [2022-04-28 07:59:24,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679875627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:24,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:24,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 07:59:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957683714] [2022-04-28 07:59:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 111 [2022-04-28 07:59:24,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:24,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:24,494 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 07:59:24,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 07:59:24,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 07:59:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:59:24,495 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:24,974 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2022-04-28 07:59:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 07:59:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 111 [2022-04-28 07:59:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-28 07:59:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-28 07:59:24,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 126 transitions. [2022-04-28 07:59:25,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:25,100 INFO L225 Difference]: With dead ends: 126 [2022-04-28 07:59:25,100 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 07:59:25,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=489, Invalid=701, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 07:59:25,101 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:25,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 07:59:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-28 07:59:25,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:25,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:25,298 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:25,298 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:25,301 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-28 07:59:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 07:59:25,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:25,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:25,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 116 states. [2022-04-28 07:59:25,301 INFO L87 Difference]: Start difference. First operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 116 states. [2022-04-28 07:59:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:25,304 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-28 07:59:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 07:59:25,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:25,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:25,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:25,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-04-28 07:59:25,307 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 111 [2022-04-28 07:59:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:25,307 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-04-28 07:59:25,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:59:25,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 118 transitions. [2022-04-28 07:59:25,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 07:59:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 07:59:25,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:25,552 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:25,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:25,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 07:59:25,753 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 21 times [2022-04-28 07:59:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:25,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [900747611] [2022-04-28 07:59:25,837 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:25,837 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:25,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 22 times [2022-04-28 07:59:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:25,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6680800] [2022-04-28 07:59:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:25,852 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:25,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727604587] [2022-04-28 07:59:25,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:25,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:25,854 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 07:59:25,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:25,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:25,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 07:59:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:25,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:26,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {18978#true} call ULTIMATE.init(); {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {18978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18978#true} {18978#true} #61#return; {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {18978#true} call #t~ret6 := main(); {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {18978#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; {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {18978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,492 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18978#true} {18978#true} #53#return; {18978#true} is VALID [2022-04-28 07:59:26,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {18978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:26,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:26,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:26,493 INFO L272 TraceCheckUtils]: 14: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,493 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18978#true} {19016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:26,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:26,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:26,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:26,494 INFO L272 TraceCheckUtils]: 22: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,495 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18978#true} {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:26,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:26,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:26,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:26,496 INFO L272 TraceCheckUtils]: 30: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,496 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18978#true} {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:26,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:59:26,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:59:26,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:59:26,497 INFO L272 TraceCheckUtils]: 38: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,498 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18978#true} {19091#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:59:26,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:59:26,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:59:26,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:59:26,499 INFO L272 TraceCheckUtils]: 46: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,500 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18978#true} {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:59:26,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {19116#(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 * ~y~0 * ~y~0 + ~x~0; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:26,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:26,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:26,501 INFO L272 TraceCheckUtils]: 54: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,501 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18978#true} {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:26,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {19141#(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 * ~y~0 * ~y~0 + ~x~0; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:26,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:26,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:26,502 INFO L272 TraceCheckUtils]: 62: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,503 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18978#true} {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:26,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {19166#(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 * ~y~0 * ~y~0 + ~x~0; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:26,504 INFO L290 TraceCheckUtils]: 68: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:26,504 INFO L290 TraceCheckUtils]: 69: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:26,504 INFO L272 TraceCheckUtils]: 70: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,504 INFO L290 TraceCheckUtils]: 71: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,504 INFO L290 TraceCheckUtils]: 72: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,504 INFO L290 TraceCheckUtils]: 73: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,505 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18978#true} {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:26,505 INFO L290 TraceCheckUtils]: 75: Hoare triple {19191#(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 * ~y~0 * ~y~0 + ~x~0; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:59:26,505 INFO L290 TraceCheckUtils]: 76: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:59:26,506 INFO L290 TraceCheckUtils]: 77: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:59:26,506 INFO L272 TraceCheckUtils]: 78: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,506 INFO L290 TraceCheckUtils]: 79: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,506 INFO L290 TraceCheckUtils]: 80: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,506 INFO L290 TraceCheckUtils]: 81: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,506 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18978#true} {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #55#return; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:59:26,507 INFO L290 TraceCheckUtils]: 83: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:59:26,507 INFO L290 TraceCheckUtils]: 84: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:59:26,507 INFO L290 TraceCheckUtils]: 85: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:59:26,507 INFO L272 TraceCheckUtils]: 86: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,507 INFO L290 TraceCheckUtils]: 87: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,508 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18978#true} {19241#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:59:26,508 INFO L290 TraceCheckUtils]: 91: Hoare triple {19241#(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 * ~y~0 * ~y~0 + ~x~0; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:59:26,509 INFO L290 TraceCheckUtils]: 92: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:59:26,509 INFO L290 TraceCheckUtils]: 93: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:59:26,509 INFO L272 TraceCheckUtils]: 94: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,509 INFO L290 TraceCheckUtils]: 95: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,509 INFO L290 TraceCheckUtils]: 96: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,509 INFO L290 TraceCheckUtils]: 97: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,510 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {18978#true} {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #55#return; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:59:26,510 INFO L290 TraceCheckUtils]: 99: Hoare triple {19266#(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 * ~y~0 * ~y~0 + ~x~0; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:59:26,510 INFO L290 TraceCheckUtils]: 100: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:59:26,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !!(#t~post5 < 20);havoc #t~post5; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:59:26,511 INFO L272 TraceCheckUtils]: 102: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,511 INFO L290 TraceCheckUtils]: 103: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,511 INFO L290 TraceCheckUtils]: 104: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,511 INFO L290 TraceCheckUtils]: 105: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,511 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18978#true} {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #55#return; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:59:26,512 INFO L290 TraceCheckUtils]: 107: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 07:59:26,512 INFO L272 TraceCheckUtils]: 108: Hoare triple {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 07:59:26,512 INFO L290 TraceCheckUtils]: 109: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 07:59:26,512 INFO L290 TraceCheckUtils]: 110: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 07:59:26,512 INFO L290 TraceCheckUtils]: 111: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 07:59:26,513 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {18978#true} {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} #57#return; {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 07:59:26,513 INFO L272 TraceCheckUtils]: 113: Hoare triple {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:26,513 INFO L290 TraceCheckUtils]: 114: Hoare triple {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:26,514 INFO L290 TraceCheckUtils]: 115: Hoare triple {19339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18979#false} is VALID [2022-04-28 07:59:26,514 INFO L290 TraceCheckUtils]: 116: Hoare triple {18979#false} assume !false; {18979#false} is VALID [2022-04-28 07:59:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 07:59:26,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:26,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:26,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6680800] [2022-04-28 07:59:26,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:26,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727604587] [2022-04-28 07:59:26,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727604587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:26,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:26,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 07:59:26,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:26,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [900747611] [2022-04-28 07:59:26,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [900747611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:26,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:26,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 07:59:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156260388] [2022-04-28 07:59:26,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:26,780 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 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 117 [2022-04-28 07:59:26,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:26,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 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 07:59:26,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 07:59:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 07:59:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:59:26,843 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 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 07:59:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:28,492 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-28 07:59:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 07:59:28,493 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 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 117 [2022-04-28 07:59:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 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 07:59:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-28 07:59:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 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 07:59:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-28 07:59:28,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-28 07:59:28,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:28,582 INFO L225 Difference]: With dead ends: 124 [2022-04-28 07:59:28,582 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 07:59:28,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:59:28,583 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:28,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 703 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 07:59:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 07:59:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-28 07:59:28,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:28,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:28,773 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:28,774 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:28,776 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-28 07:59:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 07:59:28,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:28,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:28,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-28 07:59:28,777 INFO L87 Difference]: Start difference. First operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-28 07:59:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:28,778 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-28 07:59:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 07:59:28,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:28,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:28,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:28,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-28 07:59:28,781 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 117 [2022-04-28 07:59:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:28,782 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-28 07:59:28,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 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 07:59:28,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-28 07:59:29,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 07:59:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 07:59:29,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:29,045 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:29,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:29,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 07:59:29,246 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:29,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 21 times [2022-04-28 07:59:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:29,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938841277] [2022-04-28 07:59:29,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:29,355 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:29,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 22 times [2022-04-28 07:59:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:29,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525741457] [2022-04-28 07:59:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:29,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:29,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:29,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300967115] [2022-04-28 07:59:29,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:29,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:29,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:29,371 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:29,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 07:59:29,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:29,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:29,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 07:59:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:29,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:30,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-28 07:59:30,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {20129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20137#(<= ~counter~0 0)} {20129#true} #61#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {20137#(<= ~counter~0 0)} call #t~ret6 := main(); {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {20137#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {20137#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {20137#(<= ~counter~0 0)} ~cond := #in~cond; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {20137#(<= ~counter~0 0)} assume !(0 == ~cond); {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,043 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20137#(<= ~counter~0 0)} {20137#(<= ~counter~0 0)} #53#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {20137#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:30,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {20137#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:30,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {20171#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:30,045 INFO L272 TraceCheckUtils]: 14: Hoare triple {20171#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20171#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:30,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {20171#(<= ~counter~0 1)} ~cond := #in~cond; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:30,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {20171#(<= ~counter~0 1)} assume !(0 == ~cond); {20171#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:30,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {20171#(<= ~counter~0 1)} assume true; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:30,047 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20171#(<= ~counter~0 1)} {20171#(<= ~counter~0 1)} #55#return; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:30,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {20171#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:30,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {20171#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:30,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {20196#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:30,049 INFO L272 TraceCheckUtils]: 22: Hoare triple {20196#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20196#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:30,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {20196#(<= ~counter~0 2)} ~cond := #in~cond; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:30,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {20196#(<= ~counter~0 2)} assume !(0 == ~cond); {20196#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:30,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {20196#(<= ~counter~0 2)} assume true; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:30,050 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20196#(<= ~counter~0 2)} {20196#(<= ~counter~0 2)} #55#return; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:30,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {20196#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:30,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {20196#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:30,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {20221#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:30,052 INFO L272 TraceCheckUtils]: 30: Hoare triple {20221#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20221#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:30,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {20221#(<= ~counter~0 3)} ~cond := #in~cond; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:30,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {20221#(<= ~counter~0 3)} assume !(0 == ~cond); {20221#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:30,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {20221#(<= ~counter~0 3)} assume true; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:30,053 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20221#(<= ~counter~0 3)} {20221#(<= ~counter~0 3)} #55#return; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:30,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {20221#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:30,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {20221#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:30,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {20246#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:30,055 INFO L272 TraceCheckUtils]: 38: Hoare triple {20246#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20246#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:30,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {20246#(<= ~counter~0 4)} ~cond := #in~cond; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:30,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {20246#(<= ~counter~0 4)} assume !(0 == ~cond); {20246#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:30,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {20246#(<= ~counter~0 4)} assume true; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:30,057 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20246#(<= ~counter~0 4)} {20246#(<= ~counter~0 4)} #55#return; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:30,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {20246#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:30,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {20246#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:30,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {20271#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:30,059 INFO L272 TraceCheckUtils]: 46: Hoare triple {20271#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20271#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:30,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {20271#(<= ~counter~0 5)} ~cond := #in~cond; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:30,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {20271#(<= ~counter~0 5)} assume !(0 == ~cond); {20271#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:30,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {20271#(<= ~counter~0 5)} assume true; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:30,060 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20271#(<= ~counter~0 5)} {20271#(<= ~counter~0 5)} #55#return; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:30,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {20271#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:30,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {20271#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:30,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {20296#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:30,062 INFO L272 TraceCheckUtils]: 54: Hoare triple {20296#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20296#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:30,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {20296#(<= ~counter~0 6)} ~cond := #in~cond; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:30,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {20296#(<= ~counter~0 6)} assume !(0 == ~cond); {20296#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:30,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {20296#(<= ~counter~0 6)} assume true; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:30,064 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20296#(<= ~counter~0 6)} {20296#(<= ~counter~0 6)} #55#return; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:30,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {20296#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:30,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {20296#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {20321#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,066 INFO L272 TraceCheckUtils]: 62: Hoare triple {20321#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {20321#(<= ~counter~0 7)} ~cond := #in~cond; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,067 INFO L290 TraceCheckUtils]: 64: Hoare triple {20321#(<= ~counter~0 7)} assume !(0 == ~cond); {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,067 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20321#(<= ~counter~0 7)} {20321#(<= ~counter~0 7)} #55#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,068 INFO L290 TraceCheckUtils]: 67: Hoare triple {20321#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,068 INFO L290 TraceCheckUtils]: 68: Hoare triple {20321#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,069 INFO L290 TraceCheckUtils]: 69: Hoare triple {20346#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,069 INFO L272 TraceCheckUtils]: 70: Hoare triple {20346#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,070 INFO L290 TraceCheckUtils]: 71: Hoare triple {20346#(<= ~counter~0 8)} ~cond := #in~cond; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,070 INFO L290 TraceCheckUtils]: 72: Hoare triple {20346#(<= ~counter~0 8)} assume !(0 == ~cond); {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,070 INFO L290 TraceCheckUtils]: 73: Hoare triple {20346#(<= ~counter~0 8)} assume true; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,071 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20346#(<= ~counter~0 8)} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,071 INFO L290 TraceCheckUtils]: 75: Hoare triple {20346#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,072 INFO L290 TraceCheckUtils]: 76: Hoare triple {20346#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,072 INFO L290 TraceCheckUtils]: 77: Hoare triple {20371#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,073 INFO L272 TraceCheckUtils]: 78: Hoare triple {20371#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,073 INFO L290 TraceCheckUtils]: 79: Hoare triple {20371#(<= ~counter~0 9)} ~cond := #in~cond; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,073 INFO L290 TraceCheckUtils]: 80: Hoare triple {20371#(<= ~counter~0 9)} assume !(0 == ~cond); {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,074 INFO L290 TraceCheckUtils]: 81: Hoare triple {20371#(<= ~counter~0 9)} assume true; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,074 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20371#(<= ~counter~0 9)} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,074 INFO L290 TraceCheckUtils]: 83: Hoare triple {20371#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,075 INFO L290 TraceCheckUtils]: 84: Hoare triple {20371#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,076 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,076 INFO L272 TraceCheckUtils]: 86: Hoare triple {20396#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,076 INFO L290 TraceCheckUtils]: 87: Hoare triple {20396#(<= ~counter~0 10)} ~cond := #in~cond; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,077 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#(<= ~counter~0 10)} assume !(0 == ~cond); {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,077 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#(<= ~counter~0 10)} assume true; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,078 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20396#(<= ~counter~0 10)} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,078 INFO L290 TraceCheckUtils]: 91: Hoare triple {20396#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,078 INFO L290 TraceCheckUtils]: 92: Hoare triple {20396#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {20421#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,079 INFO L272 TraceCheckUtils]: 94: Hoare triple {20421#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,079 INFO L290 TraceCheckUtils]: 95: Hoare triple {20421#(<= ~counter~0 11)} ~cond := #in~cond; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,080 INFO L290 TraceCheckUtils]: 96: Hoare triple {20421#(<= ~counter~0 11)} assume !(0 == ~cond); {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,080 INFO L290 TraceCheckUtils]: 97: Hoare triple {20421#(<= ~counter~0 11)} assume true; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,080 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20421#(<= ~counter~0 11)} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,081 INFO L290 TraceCheckUtils]: 99: Hoare triple {20421#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,081 INFO L290 TraceCheckUtils]: 100: Hoare triple {20421#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,081 INFO L290 TraceCheckUtils]: 101: Hoare triple {20446#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,082 INFO L272 TraceCheckUtils]: 102: Hoare triple {20446#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,082 INFO L290 TraceCheckUtils]: 103: Hoare triple {20446#(<= ~counter~0 12)} ~cond := #in~cond; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,082 INFO L290 TraceCheckUtils]: 104: Hoare triple {20446#(<= ~counter~0 12)} assume !(0 == ~cond); {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,082 INFO L290 TraceCheckUtils]: 105: Hoare triple {20446#(<= ~counter~0 12)} assume true; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,083 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20446#(<= ~counter~0 12)} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,083 INFO L290 TraceCheckUtils]: 107: Hoare triple {20446#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,083 INFO L290 TraceCheckUtils]: 108: Hoare triple {20446#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20471#(<= |main_#t~post5| 12)} is VALID [2022-04-28 07:59:30,084 INFO L290 TraceCheckUtils]: 109: Hoare triple {20471#(<= |main_#t~post5| 12)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L272 TraceCheckUtils]: 110: Hoare triple {20130#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L290 TraceCheckUtils]: 111: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L290 TraceCheckUtils]: 112: Hoare triple {20130#false} assume !(0 == ~cond); {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L290 TraceCheckUtils]: 113: Hoare triple {20130#false} assume true; {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20130#false} {20130#false} #57#return; {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L272 TraceCheckUtils]: 115: Hoare triple {20130#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-28 07:59:30,084 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-28 07:59:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:59:30,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:30,662 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-28 07:59:30,662 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-28 07:59:30,662 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-28 07:59:30,662 INFO L272 TraceCheckUtils]: 115: Hoare triple {20130#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20130#false} is VALID [2022-04-28 07:59:30,662 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20129#true} {20130#false} #57#return; {20130#false} is VALID [2022-04-28 07:59:30,662 INFO L290 TraceCheckUtils]: 113: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,662 INFO L290 TraceCheckUtils]: 112: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,663 INFO L290 TraceCheckUtils]: 111: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,663 INFO L272 TraceCheckUtils]: 110: Hoare triple {20130#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,663 INFO L290 TraceCheckUtils]: 109: Hoare triple {20529#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-28 07:59:30,663 INFO L290 TraceCheckUtils]: 108: Hoare triple {20533#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20529#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:59:30,664 INFO L290 TraceCheckUtils]: 107: Hoare triple {20533#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20533#(< ~counter~0 20)} is VALID [2022-04-28 07:59:30,664 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20129#true} {20533#(< ~counter~0 20)} #55#return; {20533#(< ~counter~0 20)} is VALID [2022-04-28 07:59:30,664 INFO L290 TraceCheckUtils]: 105: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,664 INFO L290 TraceCheckUtils]: 104: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,664 INFO L290 TraceCheckUtils]: 103: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,665 INFO L272 TraceCheckUtils]: 102: Hoare triple {20533#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,665 INFO L290 TraceCheckUtils]: 101: Hoare triple {20533#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {20533#(< ~counter~0 20)} is VALID [2022-04-28 07:59:30,666 INFO L290 TraceCheckUtils]: 100: Hoare triple {20558#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20533#(< ~counter~0 20)} is VALID [2022-04-28 07:59:30,666 INFO L290 TraceCheckUtils]: 99: Hoare triple {20558#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20558#(< ~counter~0 19)} is VALID [2022-04-28 07:59:30,667 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20129#true} {20558#(< ~counter~0 19)} #55#return; {20558#(< ~counter~0 19)} is VALID [2022-04-28 07:59:30,667 INFO L290 TraceCheckUtils]: 97: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,667 INFO L290 TraceCheckUtils]: 96: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,667 INFO L290 TraceCheckUtils]: 95: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,667 INFO L272 TraceCheckUtils]: 94: Hoare triple {20558#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,668 INFO L290 TraceCheckUtils]: 93: Hoare triple {20558#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {20558#(< ~counter~0 19)} is VALID [2022-04-28 07:59:30,668 INFO L290 TraceCheckUtils]: 92: Hoare triple {20583#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20558#(< ~counter~0 19)} is VALID [2022-04-28 07:59:30,669 INFO L290 TraceCheckUtils]: 91: Hoare triple {20583#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20583#(< ~counter~0 18)} is VALID [2022-04-28 07:59:30,669 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20129#true} {20583#(< ~counter~0 18)} #55#return; {20583#(< ~counter~0 18)} is VALID [2022-04-28 07:59:30,669 INFO L290 TraceCheckUtils]: 89: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,669 INFO L290 TraceCheckUtils]: 88: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,670 INFO L290 TraceCheckUtils]: 87: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,670 INFO L272 TraceCheckUtils]: 86: Hoare triple {20583#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,670 INFO L290 TraceCheckUtils]: 85: Hoare triple {20583#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {20583#(< ~counter~0 18)} is VALID [2022-04-28 07:59:30,671 INFO L290 TraceCheckUtils]: 84: Hoare triple {20608#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20583#(< ~counter~0 18)} is VALID [2022-04-28 07:59:30,671 INFO L290 TraceCheckUtils]: 83: Hoare triple {20608#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20608#(< ~counter~0 17)} is VALID [2022-04-28 07:59:30,672 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20129#true} {20608#(< ~counter~0 17)} #55#return; {20608#(< ~counter~0 17)} is VALID [2022-04-28 07:59:30,672 INFO L290 TraceCheckUtils]: 81: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,672 INFO L290 TraceCheckUtils]: 80: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,672 INFO L290 TraceCheckUtils]: 79: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,672 INFO L272 TraceCheckUtils]: 78: Hoare triple {20608#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {20608#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {20608#(< ~counter~0 17)} is VALID [2022-04-28 07:59:30,673 INFO L290 TraceCheckUtils]: 76: Hoare triple {20633#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20608#(< ~counter~0 17)} is VALID [2022-04-28 07:59:30,673 INFO L290 TraceCheckUtils]: 75: Hoare triple {20633#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20633#(< ~counter~0 16)} is VALID [2022-04-28 07:59:30,673 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20129#true} {20633#(< ~counter~0 16)} #55#return; {20633#(< ~counter~0 16)} is VALID [2022-04-28 07:59:30,674 INFO L290 TraceCheckUtils]: 73: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,674 INFO L290 TraceCheckUtils]: 72: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,674 INFO L290 TraceCheckUtils]: 71: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,674 INFO L272 TraceCheckUtils]: 70: Hoare triple {20633#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,674 INFO L290 TraceCheckUtils]: 69: Hoare triple {20633#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {20633#(< ~counter~0 16)} is VALID [2022-04-28 07:59:30,675 INFO L290 TraceCheckUtils]: 68: Hoare triple {20658#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20633#(< ~counter~0 16)} is VALID [2022-04-28 07:59:30,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {20658#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20658#(< ~counter~0 15)} is VALID [2022-04-28 07:59:30,683 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20129#true} {20658#(< ~counter~0 15)} #55#return; {20658#(< ~counter~0 15)} is VALID [2022-04-28 07:59:30,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,684 INFO L272 TraceCheckUtils]: 62: Hoare triple {20658#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {20658#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {20658#(< ~counter~0 15)} is VALID [2022-04-28 07:59:30,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {20683#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20658#(< ~counter~0 15)} is VALID [2022-04-28 07:59:30,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {20683#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20683#(< ~counter~0 14)} is VALID [2022-04-28 07:59:30,686 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20129#true} {20683#(< ~counter~0 14)} #55#return; {20683#(< ~counter~0 14)} is VALID [2022-04-28 07:59:30,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,687 INFO L272 TraceCheckUtils]: 54: Hoare triple {20683#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {20683#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {20683#(< ~counter~0 14)} is VALID [2022-04-28 07:59:30,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {20446#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20683#(< ~counter~0 14)} is VALID [2022-04-28 07:59:30,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {20446#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,688 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20129#true} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,689 INFO L272 TraceCheckUtils]: 46: Hoare triple {20446#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {20446#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {20421#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:30,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {20421#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,690 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20129#true} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,690 INFO L272 TraceCheckUtils]: 38: Hoare triple {20421#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {20421#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:30,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,692 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20129#true} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,692 INFO L272 TraceCheckUtils]: 30: Hoare triple {20396#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {20396#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {20371#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:30,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {20371#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,693 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20129#true} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,694 INFO L272 TraceCheckUtils]: 22: Hoare triple {20371#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {20371#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {20346#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:30,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {20346#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,695 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20129#true} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,695 INFO L272 TraceCheckUtils]: 14: Hoare triple {20346#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {20346#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {20321#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:30,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {20321#(<= ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20129#true} {20321#(<= ~counter~0 7)} #53#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 07:59:30,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 07:59:30,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 07:59:30,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {20321#(<= ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20129#true} is VALID [2022-04-28 07:59:30,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {20321#(<= ~counter~0 7)} 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; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {20321#(<= ~counter~0 7)} call #t~ret6 := main(); {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20321#(<= ~counter~0 7)} {20129#true} #61#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {20129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:30,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-28 07:59:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 26 proven. 288 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 07:59:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:30,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525741457] [2022-04-28 07:59:30,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:30,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300967115] [2022-04-28 07:59:30,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300967115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:30,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:30,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-28 07:59:30,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:30,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938841277] [2022-04-28 07:59:30,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938841277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:30,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:30,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:59:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059873494] [2022-04-28 07:59:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 119 [2022-04-28 07:59:30,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:30,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:30,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:30,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:59:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:59:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:59:30,786 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:31,362 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-04-28 07:59:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 07:59:31,363 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 119 [2022-04-28 07:59:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-28 07:59:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-28 07:59:31,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 134 transitions. [2022-04-28 07:59:31,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:31,484 INFO L225 Difference]: With dead ends: 134 [2022-04-28 07:59:31,484 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 07:59:31,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 07:59:31,485 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:31,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 162 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 07:59:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-28 07:59:31,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:31,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:31,698 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:31,698 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:31,701 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-28 07:59:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 07:59:31,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:31,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:31,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 124 states. [2022-04-28 07:59:31,701 INFO L87 Difference]: Start difference. First operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 124 states. [2022-04-28 07:59:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:31,704 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-28 07:59:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 07:59:31,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:31,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:31,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:31,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:59:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2022-04-28 07:59:31,707 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 119 [2022-04-28 07:59:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:31,707 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2022-04-28 07:59:31,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:59:31,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 126 transitions. [2022-04-28 07:59:31,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 07:59:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 07:59:31,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:31,998 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:32,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:32,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 07:59:32,199 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:32,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 23 times [2022-04-28 07:59:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:32,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86969900] [2022-04-28 07:59:32,308 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:32,308 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:32,308 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 24 times [2022-04-28 07:59:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:32,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016363943] [2022-04-28 07:59:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:32,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:32,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258447000] [2022-04-28 07:59:32,325 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:32,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:32,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:32,326 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:32,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 08:09:24,016 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 08:09:24,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:09:24,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 08:09:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:09:24,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:09:24,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {21654#true} call ULTIMATE.init(); {21654#true} is VALID [2022-04-28 08:09:24,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {21654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21654#true} is VALID [2022-04-28 08:09:24,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21654#true} {21654#true} #61#return; {21654#true} is VALID [2022-04-28 08:09:24,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {21654#true} call #t~ret6 := main(); {21654#true} is VALID [2022-04-28 08:09:24,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {21654#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; {21654#true} is VALID [2022-04-28 08:09:24,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {21654#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21654#true} {21654#true} #53#return; {21654#true} is VALID [2022-04-28 08:09:24,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {21654#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:24,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:24,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:24,931 INFO L272 TraceCheckUtils]: 14: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,931 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21654#true} {21692#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:24,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 08:09:24,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 08:09:24,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 08:09:24,933 INFO L272 TraceCheckUtils]: 22: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,933 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21654#true} {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 08:09:24,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 08:09:24,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 08:09:24,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 08:09:24,934 INFO L272 TraceCheckUtils]: 30: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,935 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21654#true} {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #55#return; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 08:09:24,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {21742#(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 * ~y~0 * ~y~0 + ~x~0; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 08:09:24,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 08:09:24,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 08:09:24,937 INFO L272 TraceCheckUtils]: 38: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,937 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21654#true} {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 08:09:24,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {21767#(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 * ~y~0 * ~y~0 + ~x~0; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 08:09:24,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 08:09:24,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 08:09:24,938 INFO L272 TraceCheckUtils]: 46: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,939 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21654#true} {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 08:09:24,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 08:09:24,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 08:09:24,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 08:09:24,940 INFO L272 TraceCheckUtils]: 54: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,941 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21654#true} {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 08:09:24,942 INFO L290 TraceCheckUtils]: 59: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< 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 * ~y~0 * ~y~0 + ~x~0; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 08:09:24,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 08:09:24,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 08:09:24,943 INFO L272 TraceCheckUtils]: 62: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,943 INFO L290 TraceCheckUtils]: 63: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,943 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21654#true} {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} #55#return; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 08:09:24,944 INFO L290 TraceCheckUtils]: 67: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 08:09:24,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 08:09:24,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 08:09:24,945 INFO L272 TraceCheckUtils]: 70: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,945 INFO L290 TraceCheckUtils]: 71: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,945 INFO L290 TraceCheckUtils]: 72: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,945 INFO L290 TraceCheckUtils]: 73: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,945 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21654#true} {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} #55#return; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 08:09:24,946 INFO L290 TraceCheckUtils]: 75: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,947 INFO L290 TraceCheckUtils]: 76: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,947 INFO L290 TraceCheckUtils]: 77: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,947 INFO L272 TraceCheckUtils]: 78: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,947 INFO L290 TraceCheckUtils]: 79: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,947 INFO L290 TraceCheckUtils]: 80: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,947 INFO L290 TraceCheckUtils]: 81: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,948 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21654#true} {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} #55#return; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,948 INFO L290 TraceCheckUtils]: 83: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,948 INFO L290 TraceCheckUtils]: 84: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,949 INFO L290 TraceCheckUtils]: 85: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,949 INFO L272 TraceCheckUtils]: 86: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,949 INFO L290 TraceCheckUtils]: 87: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,949 INFO L290 TraceCheckUtils]: 88: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,949 INFO L290 TraceCheckUtils]: 89: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,949 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {21654#true} {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} #55#return; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,950 INFO L290 TraceCheckUtils]: 91: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,950 INFO L290 TraceCheckUtils]: 92: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,950 INFO L290 TraceCheckUtils]: 93: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,951 INFO L272 TraceCheckUtils]: 94: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,951 INFO L290 TraceCheckUtils]: 95: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,951 INFO L290 TraceCheckUtils]: 96: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,951 INFO L290 TraceCheckUtils]: 97: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,951 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21654#true} {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} #55#return; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,952 INFO L290 TraceCheckUtils]: 99: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,952 INFO L290 TraceCheckUtils]: 100: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,952 INFO L290 TraceCheckUtils]: 101: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,952 INFO L272 TraceCheckUtils]: 102: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,952 INFO L290 TraceCheckUtils]: 103: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,952 INFO L290 TraceCheckUtils]: 104: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,952 INFO L290 TraceCheckUtils]: 105: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,953 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {21654#true} {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} #55#return; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-28 08:09:24,953 INFO L290 TraceCheckUtils]: 107: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 08:09:24,954 INFO L290 TraceCheckUtils]: 108: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 08:09:24,954 INFO L290 TraceCheckUtils]: 109: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 08:09:24,954 INFO L272 TraceCheckUtils]: 110: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,954 INFO L290 TraceCheckUtils]: 111: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,954 INFO L290 TraceCheckUtils]: 112: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,954 INFO L290 TraceCheckUtils]: 113: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,955 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {21654#true} {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #55#return; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 08:09:24,955 INFO L290 TraceCheckUtils]: 115: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 08:09:24,955 INFO L272 TraceCheckUtils]: 116: Hoare triple {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-28 08:09:24,955 INFO L290 TraceCheckUtils]: 117: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-28 08:09:24,955 INFO L290 TraceCheckUtils]: 118: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-28 08:09:24,955 INFO L290 TraceCheckUtils]: 119: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-28 08:09:24,956 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {21654#true} {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} #57#return; {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 08:09:24,956 INFO L272 TraceCheckUtils]: 121: Hoare triple {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {22036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:09:24,957 INFO L290 TraceCheckUtils]: 122: Hoare triple {22036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:09:24,957 INFO L290 TraceCheckUtils]: 123: Hoare triple {22040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21655#false} is VALID [2022-04-28 08:09:24,957 INFO L290 TraceCheckUtils]: 124: Hoare triple {21655#false} assume !false; {21655#false} is VALID [2022-04-28 08:09:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 28 proven. 312 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-28 08:09:24,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:09:25,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:09:25,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016363943] [2022-04-28 08:09:25,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:09:25,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258447000] [2022-04-28 08:09:25,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258447000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:09:25,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 08:09:25,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 08:09:25,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:09:25,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86969900] [2022-04-28 08:09:25,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86969900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:09:25,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:09:25,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 08:09:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84139606] [2022-04-28 08:09:25,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:09:25,900 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 125 [2022-04-28 08:09:25,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:09:25,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 08:09:26,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:26,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 08:09:26,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:26,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 08:09:26,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2022-04-28 08:09:26,002 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 08:09:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:28,019 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-04-28 08:09:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 08:09:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 125 [2022-04-28 08:09:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:09:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 08:09:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-28 08:09:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 08:09:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-28 08:09:28,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 99 transitions. [2022-04-28 08:09:28,123 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 08:09:28,125 INFO L225 Difference]: With dead ends: 132 [2022-04-28 08:09:28,125 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 08:09:28,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2022-04-28 08:09:28,126 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:09:28,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 774 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 08:09:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 08:09:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-04-28 08:09:28,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:09:28,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:28,361 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:28,362 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:28,365 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-28 08:09:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 08:09:28,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:28,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:28,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 126 states. [2022-04-28 08:09:28,366 INFO L87 Difference]: Start difference. First operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 126 states. [2022-04-28 08:09:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:28,368 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-28 08:09:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 08:09:28,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:28,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:28,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:09:28,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:09:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2022-04-28 08:09:28,371 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 125 [2022-04-28 08:09:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:09:28,372 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2022-04-28 08:09:28,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 08:09:28,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 129 transitions. [2022-04-28 08:09:28,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 08:09:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 08:09:28,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:09:28,704 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:09:28,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 08:09:28,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 08:09:28,911 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:09:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:09:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 23 times [2022-04-28 08:09:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:28,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [225599769] [2022-04-28 08:09:29,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:09:29,005 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 08:09:29,005 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:09:29,005 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 24 times [2022-04-28 08:09:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:09:29,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680358616] [2022-04-28 08:09:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:09:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:09:29,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:09:29,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366728712] [2022-04-28 08:09:29,033 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 08:09:29,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:29,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:09:29,034 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:09:29,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 08:09:30,150 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-28 08:09:30,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:09:30,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 08:09:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:09:30,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:09:30,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID [2022-04-28 08:09:30,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {23061#(<= ~counter~0 0)} assume true; {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23061#(<= ~counter~0 0)} {23053#true} #61#return; {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {23061#(<= ~counter~0 0)} call #t~ret6 := main(); {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {23061#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {23061#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {23061#(<= ~counter~0 0)} ~cond := #in~cond; {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {23061#(<= ~counter~0 0)} assume !(0 == ~cond); {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {23061#(<= ~counter~0 0)} assume true; {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23061#(<= ~counter~0 0)} {23061#(<= ~counter~0 0)} #53#return; {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {23061#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23061#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:30,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {23061#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23095#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:30,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {23095#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {23095#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:30,930 INFO L272 TraceCheckUtils]: 14: Hoare triple {23095#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23095#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:30,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {23095#(<= ~counter~0 1)} ~cond := #in~cond; {23095#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:30,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {23095#(<= ~counter~0 1)} assume !(0 == ~cond); {23095#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:30,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {23095#(<= ~counter~0 1)} assume true; {23095#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:30,931 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23095#(<= ~counter~0 1)} {23095#(<= ~counter~0 1)} #55#return; {23095#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:30,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {23095#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23095#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:30,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {23095#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23120#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:30,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {23120#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {23120#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:30,932 INFO L272 TraceCheckUtils]: 22: Hoare triple {23120#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23120#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:30,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {23120#(<= ~counter~0 2)} ~cond := #in~cond; {23120#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:30,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {23120#(<= ~counter~0 2)} assume !(0 == ~cond); {23120#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:30,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {23120#(<= ~counter~0 2)} assume true; {23120#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:30,933 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23120#(<= ~counter~0 2)} {23120#(<= ~counter~0 2)} #55#return; {23120#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:30,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {23120#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23120#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:30,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {23120#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23145#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:30,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {23145#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {23145#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:30,935 INFO L272 TraceCheckUtils]: 30: Hoare triple {23145#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23145#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:30,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {23145#(<= ~counter~0 3)} ~cond := #in~cond; {23145#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:30,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {23145#(<= ~counter~0 3)} assume !(0 == ~cond); {23145#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:30,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {23145#(<= ~counter~0 3)} assume true; {23145#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:30,936 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23145#(<= ~counter~0 3)} {23145#(<= ~counter~0 3)} #55#return; {23145#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:30,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {23145#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23145#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:30,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {23145#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23170#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:30,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {23170#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {23170#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:30,938 INFO L272 TraceCheckUtils]: 38: Hoare triple {23170#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23170#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:30,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {23170#(<= ~counter~0 4)} ~cond := #in~cond; {23170#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:30,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {23170#(<= ~counter~0 4)} assume !(0 == ~cond); {23170#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:30,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {23170#(<= ~counter~0 4)} assume true; {23170#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:30,939 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23170#(<= ~counter~0 4)} {23170#(<= ~counter~0 4)} #55#return; {23170#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:30,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {23170#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23170#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:30,940 INFO L290 TraceCheckUtils]: 44: Hoare triple {23170#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23195#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:30,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {23195#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {23195#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:30,940 INFO L272 TraceCheckUtils]: 46: Hoare triple {23195#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23195#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:30,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {23195#(<= ~counter~0 5)} ~cond := #in~cond; {23195#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:30,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {23195#(<= ~counter~0 5)} assume !(0 == ~cond); {23195#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:30,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {23195#(<= ~counter~0 5)} assume true; {23195#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:30,942 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23195#(<= ~counter~0 5)} {23195#(<= ~counter~0 5)} #55#return; {23195#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:30,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {23195#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23195#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:30,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {23195#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:30,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {23220#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:30,943 INFO L272 TraceCheckUtils]: 54: Hoare triple {23220#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:30,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {23220#(<= ~counter~0 6)} ~cond := #in~cond; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:30,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {23220#(<= ~counter~0 6)} assume !(0 == ~cond); {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:30,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {23220#(<= ~counter~0 6)} assume true; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:30,944 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23220#(<= ~counter~0 6)} {23220#(<= ~counter~0 6)} #55#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:30,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {23220#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:30,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {23220#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:30,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {23245#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:30,946 INFO L272 TraceCheckUtils]: 62: Hoare triple {23245#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:30,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {23245#(<= ~counter~0 7)} ~cond := #in~cond; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:30,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {23245#(<= ~counter~0 7)} assume !(0 == ~cond); {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:30,946 INFO L290 TraceCheckUtils]: 65: Hoare triple {23245#(<= ~counter~0 7)} assume true; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:30,947 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23245#(<= ~counter~0 7)} {23245#(<= ~counter~0 7)} #55#return; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:30,947 INFO L290 TraceCheckUtils]: 67: Hoare triple {23245#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:30,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {23245#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:30,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {23270#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:30,948 INFO L272 TraceCheckUtils]: 70: Hoare triple {23270#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:30,949 INFO L290 TraceCheckUtils]: 71: Hoare triple {23270#(<= ~counter~0 8)} ~cond := #in~cond; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:30,949 INFO L290 TraceCheckUtils]: 72: Hoare triple {23270#(<= ~counter~0 8)} assume !(0 == ~cond); {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:30,949 INFO L290 TraceCheckUtils]: 73: Hoare triple {23270#(<= ~counter~0 8)} assume true; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:30,949 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23270#(<= ~counter~0 8)} {23270#(<= ~counter~0 8)} #55#return; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:30,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {23270#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:30,950 INFO L290 TraceCheckUtils]: 76: Hoare triple {23270#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:30,950 INFO L290 TraceCheckUtils]: 77: Hoare triple {23295#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:30,951 INFO L272 TraceCheckUtils]: 78: Hoare triple {23295#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:30,951 INFO L290 TraceCheckUtils]: 79: Hoare triple {23295#(<= ~counter~0 9)} ~cond := #in~cond; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:30,951 INFO L290 TraceCheckUtils]: 80: Hoare triple {23295#(<= ~counter~0 9)} assume !(0 == ~cond); {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:30,952 INFO L290 TraceCheckUtils]: 81: Hoare triple {23295#(<= ~counter~0 9)} assume true; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:30,952 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23295#(<= ~counter~0 9)} {23295#(<= ~counter~0 9)} #55#return; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:30,952 INFO L290 TraceCheckUtils]: 83: Hoare triple {23295#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:30,953 INFO L290 TraceCheckUtils]: 84: Hoare triple {23295#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:30,953 INFO L290 TraceCheckUtils]: 85: Hoare triple {23320#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:30,954 INFO L272 TraceCheckUtils]: 86: Hoare triple {23320#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:30,954 INFO L290 TraceCheckUtils]: 87: Hoare triple {23320#(<= ~counter~0 10)} ~cond := #in~cond; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:30,954 INFO L290 TraceCheckUtils]: 88: Hoare triple {23320#(<= ~counter~0 10)} assume !(0 == ~cond); {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:30,954 INFO L290 TraceCheckUtils]: 89: Hoare triple {23320#(<= ~counter~0 10)} assume true; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:30,955 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23320#(<= ~counter~0 10)} {23320#(<= ~counter~0 10)} #55#return; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:30,955 INFO L290 TraceCheckUtils]: 91: Hoare triple {23320#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:30,956 INFO L290 TraceCheckUtils]: 92: Hoare triple {23320#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:30,956 INFO L290 TraceCheckUtils]: 93: Hoare triple {23345#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:30,956 INFO L272 TraceCheckUtils]: 94: Hoare triple {23345#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:30,956 INFO L290 TraceCheckUtils]: 95: Hoare triple {23345#(<= ~counter~0 11)} ~cond := #in~cond; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:30,957 INFO L290 TraceCheckUtils]: 96: Hoare triple {23345#(<= ~counter~0 11)} assume !(0 == ~cond); {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:30,957 INFO L290 TraceCheckUtils]: 97: Hoare triple {23345#(<= ~counter~0 11)} assume true; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:30,957 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23345#(<= ~counter~0 11)} {23345#(<= ~counter~0 11)} #55#return; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:30,958 INFO L290 TraceCheckUtils]: 99: Hoare triple {23345#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:30,958 INFO L290 TraceCheckUtils]: 100: Hoare triple {23345#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:30,958 INFO L290 TraceCheckUtils]: 101: Hoare triple {23370#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:30,959 INFO L272 TraceCheckUtils]: 102: Hoare triple {23370#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:30,959 INFO L290 TraceCheckUtils]: 103: Hoare triple {23370#(<= ~counter~0 12)} ~cond := #in~cond; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:30,959 INFO L290 TraceCheckUtils]: 104: Hoare triple {23370#(<= ~counter~0 12)} assume !(0 == ~cond); {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:30,960 INFO L290 TraceCheckUtils]: 105: Hoare triple {23370#(<= ~counter~0 12)} assume true; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:30,960 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23370#(<= ~counter~0 12)} {23370#(<= ~counter~0 12)} #55#return; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:30,960 INFO L290 TraceCheckUtils]: 107: Hoare triple {23370#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:30,961 INFO L290 TraceCheckUtils]: 108: Hoare triple {23370#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:30,961 INFO L290 TraceCheckUtils]: 109: Hoare triple {23395#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:30,961 INFO L272 TraceCheckUtils]: 110: Hoare triple {23395#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:30,962 INFO L290 TraceCheckUtils]: 111: Hoare triple {23395#(<= ~counter~0 13)} ~cond := #in~cond; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:30,962 INFO L290 TraceCheckUtils]: 112: Hoare triple {23395#(<= ~counter~0 13)} assume !(0 == ~cond); {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:30,962 INFO L290 TraceCheckUtils]: 113: Hoare triple {23395#(<= ~counter~0 13)} assume true; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:30,963 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23395#(<= ~counter~0 13)} {23395#(<= ~counter~0 13)} #55#return; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:30,963 INFO L290 TraceCheckUtils]: 115: Hoare triple {23395#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:30,963 INFO L290 TraceCheckUtils]: 116: Hoare triple {23395#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23420#(<= |main_#t~post5| 13)} is VALID [2022-04-28 08:09:30,964 INFO L290 TraceCheckUtils]: 117: Hoare triple {23420#(<= |main_#t~post5| 13)} assume !(#t~post5 < 20);havoc #t~post5; {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L272 TraceCheckUtils]: 118: Hoare triple {23054#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L290 TraceCheckUtils]: 119: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L290 TraceCheckUtils]: 120: Hoare triple {23054#false} assume !(0 == ~cond); {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L290 TraceCheckUtils]: 121: Hoare triple {23054#false} assume true; {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23054#false} {23054#false} #57#return; {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L272 TraceCheckUtils]: 123: Hoare triple {23054#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L290 TraceCheckUtils]: 124: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L290 TraceCheckUtils]: 125: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L290 TraceCheckUtils]: 126: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-28 08:09:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 08:09:30,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:09:31,707 INFO L290 TraceCheckUtils]: 126: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-28 08:09:31,707 INFO L290 TraceCheckUtils]: 125: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-28 08:09:31,707 INFO L290 TraceCheckUtils]: 124: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-28 08:09:31,708 INFO L272 TraceCheckUtils]: 123: Hoare triple {23054#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {23054#false} is VALID [2022-04-28 08:09:31,708 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23053#true} {23054#false} #57#return; {23054#false} is VALID [2022-04-28 08:09:31,708 INFO L290 TraceCheckUtils]: 121: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,708 INFO L290 TraceCheckUtils]: 120: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,708 INFO L290 TraceCheckUtils]: 119: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,708 INFO L272 TraceCheckUtils]: 118: Hoare triple {23054#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,708 INFO L290 TraceCheckUtils]: 117: Hoare triple {23478#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {23054#false} is VALID [2022-04-28 08:09:31,709 INFO L290 TraceCheckUtils]: 116: Hoare triple {23482#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23478#(< |main_#t~post5| 20)} is VALID [2022-04-28 08:09:31,709 INFO L290 TraceCheckUtils]: 115: Hoare triple {23482#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23482#(< ~counter~0 20)} is VALID [2022-04-28 08:09:31,710 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23053#true} {23482#(< ~counter~0 20)} #55#return; {23482#(< ~counter~0 20)} is VALID [2022-04-28 08:09:31,710 INFO L290 TraceCheckUtils]: 113: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,710 INFO L290 TraceCheckUtils]: 112: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,710 INFO L290 TraceCheckUtils]: 111: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,710 INFO L272 TraceCheckUtils]: 110: Hoare triple {23482#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,710 INFO L290 TraceCheckUtils]: 109: Hoare triple {23482#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {23482#(< ~counter~0 20)} is VALID [2022-04-28 08:09:31,712 INFO L290 TraceCheckUtils]: 108: Hoare triple {23507#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23482#(< ~counter~0 20)} is VALID [2022-04-28 08:09:31,712 INFO L290 TraceCheckUtils]: 107: Hoare triple {23507#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23507#(< ~counter~0 19)} is VALID [2022-04-28 08:09:31,712 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23053#true} {23507#(< ~counter~0 19)} #55#return; {23507#(< ~counter~0 19)} is VALID [2022-04-28 08:09:31,712 INFO L290 TraceCheckUtils]: 105: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,713 INFO L290 TraceCheckUtils]: 104: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,713 INFO L290 TraceCheckUtils]: 103: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,713 INFO L272 TraceCheckUtils]: 102: Hoare triple {23507#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,713 INFO L290 TraceCheckUtils]: 101: Hoare triple {23507#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {23507#(< ~counter~0 19)} is VALID [2022-04-28 08:09:31,714 INFO L290 TraceCheckUtils]: 100: Hoare triple {23532#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23507#(< ~counter~0 19)} is VALID [2022-04-28 08:09:31,714 INFO L290 TraceCheckUtils]: 99: Hoare triple {23532#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23532#(< ~counter~0 18)} is VALID [2022-04-28 08:09:31,714 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23053#true} {23532#(< ~counter~0 18)} #55#return; {23532#(< ~counter~0 18)} is VALID [2022-04-28 08:09:31,715 INFO L290 TraceCheckUtils]: 97: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,715 INFO L290 TraceCheckUtils]: 96: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,715 INFO L290 TraceCheckUtils]: 95: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,715 INFO L272 TraceCheckUtils]: 94: Hoare triple {23532#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,715 INFO L290 TraceCheckUtils]: 93: Hoare triple {23532#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {23532#(< ~counter~0 18)} is VALID [2022-04-28 08:09:31,716 INFO L290 TraceCheckUtils]: 92: Hoare triple {23557#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23532#(< ~counter~0 18)} is VALID [2022-04-28 08:09:31,716 INFO L290 TraceCheckUtils]: 91: Hoare triple {23557#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23557#(< ~counter~0 17)} is VALID [2022-04-28 08:09:31,716 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23053#true} {23557#(< ~counter~0 17)} #55#return; {23557#(< ~counter~0 17)} is VALID [2022-04-28 08:09:31,717 INFO L290 TraceCheckUtils]: 89: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,717 INFO L290 TraceCheckUtils]: 88: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,717 INFO L290 TraceCheckUtils]: 87: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,717 INFO L272 TraceCheckUtils]: 86: Hoare triple {23557#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,717 INFO L290 TraceCheckUtils]: 85: Hoare triple {23557#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {23557#(< ~counter~0 17)} is VALID [2022-04-28 08:09:31,718 INFO L290 TraceCheckUtils]: 84: Hoare triple {23582#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23557#(< ~counter~0 17)} is VALID [2022-04-28 08:09:31,718 INFO L290 TraceCheckUtils]: 83: Hoare triple {23582#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23582#(< ~counter~0 16)} is VALID [2022-04-28 08:09:31,719 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23053#true} {23582#(< ~counter~0 16)} #55#return; {23582#(< ~counter~0 16)} is VALID [2022-04-28 08:09:31,719 INFO L290 TraceCheckUtils]: 81: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,719 INFO L272 TraceCheckUtils]: 78: Hoare triple {23582#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {23582#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {23582#(< ~counter~0 16)} is VALID [2022-04-28 08:09:31,720 INFO L290 TraceCheckUtils]: 76: Hoare triple {23607#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23582#(< ~counter~0 16)} is VALID [2022-04-28 08:09:31,720 INFO L290 TraceCheckUtils]: 75: Hoare triple {23607#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23607#(< ~counter~0 15)} is VALID [2022-04-28 08:09:31,721 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23053#true} {23607#(< ~counter~0 15)} #55#return; {23607#(< ~counter~0 15)} is VALID [2022-04-28 08:09:31,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,721 INFO L290 TraceCheckUtils]: 72: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,721 INFO L290 TraceCheckUtils]: 71: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,721 INFO L272 TraceCheckUtils]: 70: Hoare triple {23607#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {23607#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {23607#(< ~counter~0 15)} is VALID [2022-04-28 08:09:31,722 INFO L290 TraceCheckUtils]: 68: Hoare triple {23395#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23607#(< ~counter~0 15)} is VALID [2022-04-28 08:09:31,722 INFO L290 TraceCheckUtils]: 67: Hoare triple {23395#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:31,723 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23053#true} {23395#(<= ~counter~0 13)} #55#return; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:31,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,723 INFO L272 TraceCheckUtils]: 62: Hoare triple {23395#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {23395#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:31,724 INFO L290 TraceCheckUtils]: 60: Hoare triple {23370#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23395#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:31,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {23370#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:31,725 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23053#true} {23370#(<= ~counter~0 12)} #55#return; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:31,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,726 INFO L272 TraceCheckUtils]: 54: Hoare triple {23370#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {23370#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:31,727 INFO L290 TraceCheckUtils]: 52: Hoare triple {23345#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23370#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:31,727 INFO L290 TraceCheckUtils]: 51: Hoare triple {23345#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:31,727 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23053#true} {23345#(<= ~counter~0 11)} #55#return; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:31,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,728 INFO L272 TraceCheckUtils]: 46: Hoare triple {23345#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {23345#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:31,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {23320#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23345#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:31,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {23320#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:31,730 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23053#true} {23320#(<= ~counter~0 10)} #55#return; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:31,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,730 INFO L272 TraceCheckUtils]: 38: Hoare triple {23320#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {23320#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:31,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {23295#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23320#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:31,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {23295#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:31,732 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23053#true} {23295#(<= ~counter~0 9)} #55#return; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:31,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,732 INFO L272 TraceCheckUtils]: 30: Hoare triple {23295#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {23295#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:31,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {23270#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23295#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:31,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {23270#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:31,734 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23053#true} {23270#(<= ~counter~0 8)} #55#return; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:31,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,734 INFO L272 TraceCheckUtils]: 22: Hoare triple {23270#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {23270#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:31,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {23245#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23270#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:31,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {23245#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:31,736 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23053#true} {23245#(<= ~counter~0 7)} #55#return; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:31,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,736 INFO L272 TraceCheckUtils]: 14: Hoare triple {23245#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {23245#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:31,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {23220#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23245#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:31,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {23220#(<= ~counter~0 6)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:31,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23053#true} {23220#(<= ~counter~0 6)} #53#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:31,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 08:09:31,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-28 08:09:31,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-28 08:09:31,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {23220#(<= ~counter~0 6)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {23053#true} is VALID [2022-04-28 08:09:31,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {23220#(<= ~counter~0 6)} 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; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:31,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {23220#(<= ~counter~0 6)} call #t~ret6 := main(); {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:31,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23220#(<= ~counter~0 6)} {23053#true} #61#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:31,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {23220#(<= ~counter~0 6)} assume true; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:31,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23220#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:31,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID [2022-04-28 08:09:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 28 proven. 338 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-28 08:09:31,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:09:31,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680358616] [2022-04-28 08:09:31,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:09:31,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366728712] [2022-04-28 08:09:31,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366728712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 08:09:31,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:09:31,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-28 08:09:31,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:09:31,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [225599769] [2022-04-28 08:09:31,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [225599769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:09:31,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:09:31,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 08:09:31,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251732494] [2022-04-28 08:09:31,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:09:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 127 [2022-04-28 08:09:31,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:09:31,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 08:09:31,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:31,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 08:09:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 08:09:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 08:09:31,868 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 08:09:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:32,486 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2022-04-28 08:09:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 08:09:32,486 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 127 [2022-04-28 08:09:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:09:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 08:09:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-28 08:09:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 08:09:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-28 08:09:32,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2022-04-28 08:09:32,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:32,614 INFO L225 Difference]: With dead ends: 142 [2022-04-28 08:09:32,614 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 08:09:32,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=535, Invalid=797, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 08:09:32,615 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:09:32,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 168 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:09:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 08:09:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 08:09:32,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:09:32,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:32,838 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:32,838 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:32,840 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-28 08:09:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-28 08:09:32,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:32,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:32,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-28 08:09:32,841 INFO L87 Difference]: Start difference. First operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-28 08:09:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:32,843 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-28 08:09:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-28 08:09:32,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:32,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:32,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:09:32,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:09:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2022-04-28 08:09:32,846 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 127 [2022-04-28 08:09:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:09:32,846 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2022-04-28 08:09:32,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 08:09:32,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 134 transitions. [2022-04-28 08:09:33,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-28 08:09:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 08:09:33,162 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:09:33,162 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:09:33,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 08:09:33,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 08:09:33,363 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:09:33,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:09:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 25 times [2022-04-28 08:09:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:33,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [445191410] [2022-04-28 08:09:33,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:09:33,468 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 08:09:33,468 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:09:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 26 times [2022-04-28 08:09:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:09:33,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275539559] [2022-04-28 08:09:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:09:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:09:33,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:09:33,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106360102] [2022-04-28 08:09:33,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:09:33,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:09:33,492 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:09:33,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 08:09:35,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:09:35,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:09:35,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 08:09:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:09:35,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:09:36,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {24676#true} call ULTIMATE.init(); {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {24676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24676#true} {24676#true} #61#return; {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {24676#true} call #t~ret6 := main(); {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {24676#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; {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {24676#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24676#true} {24676#true} #53#return; {24676#true} is VALID [2022-04-28 08:09:36,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {24676#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {24714#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:36,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {24714#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24714#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:36,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {24714#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {24714#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:36,160 INFO L272 TraceCheckUtils]: 14: Hoare triple {24714#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,161 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24676#true} {24714#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {24714#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:36,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {24714#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24739#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 08:09:36,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {24739#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24739#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 08:09:36,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {24739#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {24739#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 08:09:36,162 INFO L272 TraceCheckUtils]: 22: Hoare triple {24739#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,163 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24676#true} {24739#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {24739#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 08:09:36,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {24739#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 08:09:36,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 08:09:36,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 08:09:36,164 INFO L272 TraceCheckUtils]: 30: Hoare triple {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,165 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {24676#true} {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 08:09:36,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24789#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 08:09:36,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {24789#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24789#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 08:09:36,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {24789#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {24789#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 08:09:36,166 INFO L272 TraceCheckUtils]: 38: Hoare triple {24789#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,167 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {24676#true} {24789#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {24789#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 08:09:36,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {24789#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 08:09:36,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 08:09:36,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 08:09:36,169 INFO L272 TraceCheckUtils]: 46: Hoare triple {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,169 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24676#true} {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 08:09:36,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {24814#(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 * ~y~0 * ~y~0 + ~x~0; {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 08:09:36,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 08:09:36,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 08:09:36,171 INFO L272 TraceCheckUtils]: 54: Hoare triple {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,171 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24676#true} {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #55#return; {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 08:09:36,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 08:09:36,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 08:09:36,173 INFO L290 TraceCheckUtils]: 61: Hoare triple {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 08:09:36,173 INFO L272 TraceCheckUtils]: 62: Hoare triple {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,174 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24676#true} {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} #55#return; {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 08:09:36,174 INFO L290 TraceCheckUtils]: 67: Hoare triple {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 08:09:36,174 INFO L290 TraceCheckUtils]: 68: Hoare triple {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 08:09:36,175 INFO L290 TraceCheckUtils]: 69: Hoare triple {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 08:09:36,175 INFO L272 TraceCheckUtils]: 70: Hoare triple {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,175 INFO L290 TraceCheckUtils]: 71: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,175 INFO L290 TraceCheckUtils]: 73: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,176 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24676#true} {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 08:09:36,176 INFO L290 TraceCheckUtils]: 75: Hoare triple {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 08:09:36,177 INFO L290 TraceCheckUtils]: 76: Hoare triple {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 08:09:36,177 INFO L290 TraceCheckUtils]: 77: Hoare triple {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 08:09:36,177 INFO L272 TraceCheckUtils]: 78: Hoare triple {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,177 INFO L290 TraceCheckUtils]: 79: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,177 INFO L290 TraceCheckUtils]: 81: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,178 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {24676#true} {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #55#return; {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 08:09:36,178 INFO L290 TraceCheckUtils]: 83: Hoare triple {24914#(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 * ~y~0 * ~y~0 + ~x~0; {24939#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 08:09:36,179 INFO L290 TraceCheckUtils]: 84: Hoare triple {24939#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24939#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 08:09:36,179 INFO L290 TraceCheckUtils]: 85: Hoare triple {24939#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {24939#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 08:09:36,179 INFO L272 TraceCheckUtils]: 86: Hoare triple {24939#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,179 INFO L290 TraceCheckUtils]: 87: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,179 INFO L290 TraceCheckUtils]: 88: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,180 INFO L290 TraceCheckUtils]: 89: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,180 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {24676#true} {24939#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {24939#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 08:09:36,181 INFO L290 TraceCheckUtils]: 91: Hoare triple {24939#(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 * ~y~0 * ~y~0 + ~x~0; {24964#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 08:09:36,181 INFO L290 TraceCheckUtils]: 92: Hoare triple {24964#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24964#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 08:09:36,181 INFO L290 TraceCheckUtils]: 93: Hoare triple {24964#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {24964#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 08:09:36,182 INFO L272 TraceCheckUtils]: 94: Hoare triple {24964#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,182 INFO L290 TraceCheckUtils]: 95: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,182 INFO L290 TraceCheckUtils]: 96: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,182 INFO L290 TraceCheckUtils]: 97: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,182 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {24676#true} {24964#(and (= main_~y~0 10) (= main_~c~0 10))} #55#return; {24964#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 08:09:36,183 INFO L290 TraceCheckUtils]: 99: Hoare triple {24964#(and (= main_~y~0 10) (= 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 * ~y~0 * ~y~0 + ~x~0; {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 08:09:36,183 INFO L290 TraceCheckUtils]: 100: Hoare triple {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 08:09:36,184 INFO L290 TraceCheckUtils]: 101: Hoare triple {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 20);havoc #t~post5; {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 08:09:36,184 INFO L272 TraceCheckUtils]: 102: Hoare triple {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,184 INFO L290 TraceCheckUtils]: 103: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,184 INFO L290 TraceCheckUtils]: 104: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,184 INFO L290 TraceCheckUtils]: 105: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,184 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {24676#true} {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #55#return; {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 08:09:36,185 INFO L290 TraceCheckUtils]: 107: Hoare triple {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 08:09:36,185 INFO L290 TraceCheckUtils]: 108: Hoare triple {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 08:09:36,186 INFO L290 TraceCheckUtils]: 109: Hoare triple {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 08:09:36,186 INFO L272 TraceCheckUtils]: 110: Hoare triple {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,186 INFO L290 TraceCheckUtils]: 111: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,186 INFO L290 TraceCheckUtils]: 112: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,186 INFO L290 TraceCheckUtils]: 113: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,187 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {24676#true} {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #55#return; {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 08:09:36,187 INFO L290 TraceCheckUtils]: 115: Hoare triple {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 08:09:36,188 INFO L290 TraceCheckUtils]: 116: Hoare triple {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 08:09:36,188 INFO L290 TraceCheckUtils]: 117: Hoare triple {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !!(#t~post5 < 20);havoc #t~post5; {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 08:09:36,188 INFO L272 TraceCheckUtils]: 118: Hoare triple {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,188 INFO L290 TraceCheckUtils]: 119: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,188 INFO L290 TraceCheckUtils]: 120: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,188 INFO L290 TraceCheckUtils]: 121: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,189 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24676#true} {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #55#return; {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 08:09:36,190 INFO L290 TraceCheckUtils]: 123: Hoare triple {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-28 08:09:36,190 INFO L272 TraceCheckUtils]: 124: Hoare triple {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-28 08:09:36,190 INFO L290 TraceCheckUtils]: 125: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-28 08:09:36,190 INFO L290 TraceCheckUtils]: 126: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-28 08:09:36,190 INFO L290 TraceCheckUtils]: 127: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-28 08:09:36,191 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24676#true} {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} #57#return; {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-28 08:09:36,191 INFO L272 TraceCheckUtils]: 129: Hoare triple {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {25083#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:09:36,192 INFO L290 TraceCheckUtils]: 130: Hoare triple {25083#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25087#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:09:36,192 INFO L290 TraceCheckUtils]: 131: Hoare triple {25087#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24677#false} is VALID [2022-04-28 08:09:36,192 INFO L290 TraceCheckUtils]: 132: Hoare triple {24677#false} assume !false; {24677#false} is VALID [2022-04-28 08:09:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 30 proven. 364 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 08:09:36,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:09:36,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:09:36,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275539559] [2022-04-28 08:09:36,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:09:36,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106360102] [2022-04-28 08:09:36,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106360102] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:09:36,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 08:09:36,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 08:09:36,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:09:36,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [445191410] [2022-04-28 08:09:36,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [445191410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:09:36,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:09:36,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 08:09:36,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874130876] [2022-04-28 08:09:36,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:09:36,480 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 133 [2022-04-28 08:09:36,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:09:36,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 08:09:36,555 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 08:09:36,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 08:09:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 08:09:36,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 08:09:36,556 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 08:09:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:38,711 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-28 08:09:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 08:09:38,711 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 133 [2022-04-28 08:09:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:09:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 08:09:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-28 08:09:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 08:09:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-28 08:09:38,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 104 transitions. [2022-04-28 08:09:38,808 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 08:09:38,809 INFO L225 Difference]: With dead ends: 140 [2022-04-28 08:09:38,809 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 08:09:38,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-28 08:09:38,811 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:09:38,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 861 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 08:09:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 08:09:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-28 08:09:39,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:09:39,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:39,034 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:39,034 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:39,036 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-28 08:09:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-28 08:09:39,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:39,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:39,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 134 states. [2022-04-28 08:09:39,037 INFO L87 Difference]: Start difference. First operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 134 states. [2022-04-28 08:09:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:39,038 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-28 08:09:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-28 08:09:39,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:39,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:39,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:09:39,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:09:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2022-04-28 08:09:39,041 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 133 [2022-04-28 08:09:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:09:39,041 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2022-04-28 08:09:39,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 08:09:39,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 137 transitions. [2022-04-28 08:09:39,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-28 08:09:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 08:09:39,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:09:39,439 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:09:39,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 08:09:39,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:39,647 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:09:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:09:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 25 times [2022-04-28 08:09:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [662860547] [2022-04-28 08:09:39,728 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:09:39,728 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 08:09:39,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:09:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 26 times [2022-04-28 08:09:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:09:39,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389293108] [2022-04-28 08:09:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:09:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:09:39,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:09:39,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271497225] [2022-04-28 08:09:39,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:09:39,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:09:39,745 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:09:39,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 08:09:39,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:09:39,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:09:39,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 08:09:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:09:39,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:09:40,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {25973#true} call ULTIMATE.init(); {25973#true} is VALID [2022-04-28 08:09:40,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {25973#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {25981#(<= ~counter~0 0)} assume true; {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25981#(<= ~counter~0 0)} {25973#true} #61#return; {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {25981#(<= ~counter~0 0)} call #t~ret6 := main(); {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {25981#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,528 INFO L272 TraceCheckUtils]: 6: Hoare triple {25981#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {25981#(<= ~counter~0 0)} ~cond := #in~cond; {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {25981#(<= ~counter~0 0)} assume !(0 == ~cond); {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {25981#(<= ~counter~0 0)} assume true; {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25981#(<= ~counter~0 0)} {25981#(<= ~counter~0 0)} #53#return; {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {25981#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {25981#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:40,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {25981#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26015#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:40,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {26015#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {26015#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:40,551 INFO L272 TraceCheckUtils]: 14: Hoare triple {26015#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26015#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:40,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {26015#(<= ~counter~0 1)} ~cond := #in~cond; {26015#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:40,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {26015#(<= ~counter~0 1)} assume !(0 == ~cond); {26015#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:40,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {26015#(<= ~counter~0 1)} assume true; {26015#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:40,553 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26015#(<= ~counter~0 1)} {26015#(<= ~counter~0 1)} #55#return; {26015#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:40,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {26015#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26015#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:40,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {26015#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26040#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:40,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {26040#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {26040#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:40,556 INFO L272 TraceCheckUtils]: 22: Hoare triple {26040#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26040#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:40,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {26040#(<= ~counter~0 2)} ~cond := #in~cond; {26040#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:40,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {26040#(<= ~counter~0 2)} assume !(0 == ~cond); {26040#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:40,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {26040#(<= ~counter~0 2)} assume true; {26040#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:40,559 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26040#(<= ~counter~0 2)} {26040#(<= ~counter~0 2)} #55#return; {26040#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:40,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {26040#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26040#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:40,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {26040#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26065#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:40,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {26065#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {26065#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:40,561 INFO L272 TraceCheckUtils]: 30: Hoare triple {26065#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26065#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:40,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {26065#(<= ~counter~0 3)} ~cond := #in~cond; {26065#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:40,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {26065#(<= ~counter~0 3)} assume !(0 == ~cond); {26065#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:40,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {26065#(<= ~counter~0 3)} assume true; {26065#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:40,564 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {26065#(<= ~counter~0 3)} {26065#(<= ~counter~0 3)} #55#return; {26065#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:40,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {26065#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26065#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:40,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {26065#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26090#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:40,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {26090#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {26090#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:40,567 INFO L272 TraceCheckUtils]: 38: Hoare triple {26090#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26090#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:40,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {26090#(<= ~counter~0 4)} ~cond := #in~cond; {26090#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:40,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {26090#(<= ~counter~0 4)} assume !(0 == ~cond); {26090#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:40,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {26090#(<= ~counter~0 4)} assume true; {26090#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:40,569 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26090#(<= ~counter~0 4)} {26090#(<= ~counter~0 4)} #55#return; {26090#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:40,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {26090#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26090#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:40,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {26090#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:40,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {26115#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:40,572 INFO L272 TraceCheckUtils]: 46: Hoare triple {26115#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:40,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {26115#(<= ~counter~0 5)} ~cond := #in~cond; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:40,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {26115#(<= ~counter~0 5)} assume !(0 == ~cond); {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:40,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {26115#(<= ~counter~0 5)} assume true; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:40,573 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26115#(<= ~counter~0 5)} {26115#(<= ~counter~0 5)} #55#return; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:40,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {26115#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:40,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {26115#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:40,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {26140#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:40,576 INFO L272 TraceCheckUtils]: 54: Hoare triple {26140#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:40,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {26140#(<= ~counter~0 6)} ~cond := #in~cond; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:40,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {26140#(<= ~counter~0 6)} assume !(0 == ~cond); {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:40,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {26140#(<= ~counter~0 6)} assume true; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:40,577 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26140#(<= ~counter~0 6)} {26140#(<= ~counter~0 6)} #55#return; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:40,577 INFO L290 TraceCheckUtils]: 59: Hoare triple {26140#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:40,578 INFO L290 TraceCheckUtils]: 60: Hoare triple {26140#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:40,578 INFO L290 TraceCheckUtils]: 61: Hoare triple {26165#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:40,579 INFO L272 TraceCheckUtils]: 62: Hoare triple {26165#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:40,579 INFO L290 TraceCheckUtils]: 63: Hoare triple {26165#(<= ~counter~0 7)} ~cond := #in~cond; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:40,580 INFO L290 TraceCheckUtils]: 64: Hoare triple {26165#(<= ~counter~0 7)} assume !(0 == ~cond); {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:40,580 INFO L290 TraceCheckUtils]: 65: Hoare triple {26165#(<= ~counter~0 7)} assume true; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:40,580 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26165#(<= ~counter~0 7)} {26165#(<= ~counter~0 7)} #55#return; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:40,581 INFO L290 TraceCheckUtils]: 67: Hoare triple {26165#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:40,581 INFO L290 TraceCheckUtils]: 68: Hoare triple {26165#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:40,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {26190#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:40,582 INFO L272 TraceCheckUtils]: 70: Hoare triple {26190#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:40,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {26190#(<= ~counter~0 8)} ~cond := #in~cond; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:40,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {26190#(<= ~counter~0 8)} assume !(0 == ~cond); {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:40,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {26190#(<= ~counter~0 8)} assume true; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:40,584 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26190#(<= ~counter~0 8)} {26190#(<= ~counter~0 8)} #55#return; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:40,584 INFO L290 TraceCheckUtils]: 75: Hoare triple {26190#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:40,585 INFO L290 TraceCheckUtils]: 76: Hoare triple {26190#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:40,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {26215#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:40,586 INFO L272 TraceCheckUtils]: 78: Hoare triple {26215#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:40,586 INFO L290 TraceCheckUtils]: 79: Hoare triple {26215#(<= ~counter~0 9)} ~cond := #in~cond; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:40,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {26215#(<= ~counter~0 9)} assume !(0 == ~cond); {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:40,587 INFO L290 TraceCheckUtils]: 81: Hoare triple {26215#(<= ~counter~0 9)} assume true; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:40,587 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {26215#(<= ~counter~0 9)} {26215#(<= ~counter~0 9)} #55#return; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:40,587 INFO L290 TraceCheckUtils]: 83: Hoare triple {26215#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:40,588 INFO L290 TraceCheckUtils]: 84: Hoare triple {26215#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:40,588 INFO L290 TraceCheckUtils]: 85: Hoare triple {26240#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:40,589 INFO L272 TraceCheckUtils]: 86: Hoare triple {26240#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:40,589 INFO L290 TraceCheckUtils]: 87: Hoare triple {26240#(<= ~counter~0 10)} ~cond := #in~cond; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:40,590 INFO L290 TraceCheckUtils]: 88: Hoare triple {26240#(<= ~counter~0 10)} assume !(0 == ~cond); {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:40,590 INFO L290 TraceCheckUtils]: 89: Hoare triple {26240#(<= ~counter~0 10)} assume true; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:40,590 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26240#(<= ~counter~0 10)} {26240#(<= ~counter~0 10)} #55#return; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:40,591 INFO L290 TraceCheckUtils]: 91: Hoare triple {26240#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:40,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {26240#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:40,592 INFO L290 TraceCheckUtils]: 93: Hoare triple {26265#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:40,592 INFO L272 TraceCheckUtils]: 94: Hoare triple {26265#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:40,593 INFO L290 TraceCheckUtils]: 95: Hoare triple {26265#(<= ~counter~0 11)} ~cond := #in~cond; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:40,593 INFO L290 TraceCheckUtils]: 96: Hoare triple {26265#(<= ~counter~0 11)} assume !(0 == ~cond); {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:40,593 INFO L290 TraceCheckUtils]: 97: Hoare triple {26265#(<= ~counter~0 11)} assume true; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:40,594 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {26265#(<= ~counter~0 11)} {26265#(<= ~counter~0 11)} #55#return; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:40,594 INFO L290 TraceCheckUtils]: 99: Hoare triple {26265#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:40,595 INFO L290 TraceCheckUtils]: 100: Hoare triple {26265#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:40,595 INFO L290 TraceCheckUtils]: 101: Hoare triple {26290#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:40,596 INFO L272 TraceCheckUtils]: 102: Hoare triple {26290#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:40,596 INFO L290 TraceCheckUtils]: 103: Hoare triple {26290#(<= ~counter~0 12)} ~cond := #in~cond; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:40,596 INFO L290 TraceCheckUtils]: 104: Hoare triple {26290#(<= ~counter~0 12)} assume !(0 == ~cond); {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:40,597 INFO L290 TraceCheckUtils]: 105: Hoare triple {26290#(<= ~counter~0 12)} assume true; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:40,597 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {26290#(<= ~counter~0 12)} {26290#(<= ~counter~0 12)} #55#return; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:40,598 INFO L290 TraceCheckUtils]: 107: Hoare triple {26290#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:40,598 INFO L290 TraceCheckUtils]: 108: Hoare triple {26290#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:40,599 INFO L290 TraceCheckUtils]: 109: Hoare triple {26315#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:40,599 INFO L272 TraceCheckUtils]: 110: Hoare triple {26315#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:40,599 INFO L290 TraceCheckUtils]: 111: Hoare triple {26315#(<= ~counter~0 13)} ~cond := #in~cond; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:40,600 INFO L290 TraceCheckUtils]: 112: Hoare triple {26315#(<= ~counter~0 13)} assume !(0 == ~cond); {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:40,600 INFO L290 TraceCheckUtils]: 113: Hoare triple {26315#(<= ~counter~0 13)} assume true; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:40,601 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {26315#(<= ~counter~0 13)} {26315#(<= ~counter~0 13)} #55#return; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:40,601 INFO L290 TraceCheckUtils]: 115: Hoare triple {26315#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:40,602 INFO L290 TraceCheckUtils]: 116: Hoare triple {26315#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:40,602 INFO L290 TraceCheckUtils]: 117: Hoare triple {26340#(<= ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:40,602 INFO L272 TraceCheckUtils]: 118: Hoare triple {26340#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:40,603 INFO L290 TraceCheckUtils]: 119: Hoare triple {26340#(<= ~counter~0 14)} ~cond := #in~cond; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:40,603 INFO L290 TraceCheckUtils]: 120: Hoare triple {26340#(<= ~counter~0 14)} assume !(0 == ~cond); {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:40,603 INFO L290 TraceCheckUtils]: 121: Hoare triple {26340#(<= ~counter~0 14)} assume true; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:40,604 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26340#(<= ~counter~0 14)} {26340#(<= ~counter~0 14)} #55#return; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:40,604 INFO L290 TraceCheckUtils]: 123: Hoare triple {26340#(<= ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:40,605 INFO L290 TraceCheckUtils]: 124: Hoare triple {26340#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26365#(<= |main_#t~post5| 14)} is VALID [2022-04-28 08:09:40,605 INFO L290 TraceCheckUtils]: 125: Hoare triple {26365#(<= |main_#t~post5| 14)} assume !(#t~post5 < 20);havoc #t~post5; {25974#false} is VALID [2022-04-28 08:09:40,605 INFO L272 TraceCheckUtils]: 126: Hoare triple {25974#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25974#false} is VALID [2022-04-28 08:09:40,605 INFO L290 TraceCheckUtils]: 127: Hoare triple {25974#false} ~cond := #in~cond; {25974#false} is VALID [2022-04-28 08:09:40,605 INFO L290 TraceCheckUtils]: 128: Hoare triple {25974#false} assume !(0 == ~cond); {25974#false} is VALID [2022-04-28 08:09:40,605 INFO L290 TraceCheckUtils]: 129: Hoare triple {25974#false} assume true; {25974#false} is VALID [2022-04-28 08:09:40,605 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25974#false} {25974#false} #57#return; {25974#false} is VALID [2022-04-28 08:09:40,606 INFO L272 TraceCheckUtils]: 131: Hoare triple {25974#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {25974#false} is VALID [2022-04-28 08:09:40,606 INFO L290 TraceCheckUtils]: 132: Hoare triple {25974#false} ~cond := #in~cond; {25974#false} is VALID [2022-04-28 08:09:40,606 INFO L290 TraceCheckUtils]: 133: Hoare triple {25974#false} assume 0 == ~cond; {25974#false} is VALID [2022-04-28 08:09:40,606 INFO L290 TraceCheckUtils]: 134: Hoare triple {25974#false} assume !false; {25974#false} is VALID [2022-04-28 08:09:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 08:09:40,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:09:41,301 INFO L290 TraceCheckUtils]: 134: Hoare triple {25974#false} assume !false; {25974#false} is VALID [2022-04-28 08:09:41,301 INFO L290 TraceCheckUtils]: 133: Hoare triple {25974#false} assume 0 == ~cond; {25974#false} is VALID [2022-04-28 08:09:41,301 INFO L290 TraceCheckUtils]: 132: Hoare triple {25974#false} ~cond := #in~cond; {25974#false} is VALID [2022-04-28 08:09:41,301 INFO L272 TraceCheckUtils]: 131: Hoare triple {25974#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {25974#false} is VALID [2022-04-28 08:09:41,301 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25973#true} {25974#false} #57#return; {25974#false} is VALID [2022-04-28 08:09:41,301 INFO L290 TraceCheckUtils]: 129: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,301 INFO L290 TraceCheckUtils]: 128: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,301 INFO L290 TraceCheckUtils]: 127: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,301 INFO L272 TraceCheckUtils]: 126: Hoare triple {25974#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,302 INFO L290 TraceCheckUtils]: 125: Hoare triple {26423#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {25974#false} is VALID [2022-04-28 08:09:41,302 INFO L290 TraceCheckUtils]: 124: Hoare triple {26427#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26423#(< |main_#t~post5| 20)} is VALID [2022-04-28 08:09:41,302 INFO L290 TraceCheckUtils]: 123: Hoare triple {26427#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26427#(< ~counter~0 20)} is VALID [2022-04-28 08:09:41,303 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {25973#true} {26427#(< ~counter~0 20)} #55#return; {26427#(< ~counter~0 20)} is VALID [2022-04-28 08:09:41,303 INFO L290 TraceCheckUtils]: 121: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,303 INFO L290 TraceCheckUtils]: 120: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,303 INFO L290 TraceCheckUtils]: 119: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,303 INFO L272 TraceCheckUtils]: 118: Hoare triple {26427#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,303 INFO L290 TraceCheckUtils]: 117: Hoare triple {26427#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {26427#(< ~counter~0 20)} is VALID [2022-04-28 08:09:41,304 INFO L290 TraceCheckUtils]: 116: Hoare triple {26452#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26427#(< ~counter~0 20)} is VALID [2022-04-28 08:09:41,305 INFO L290 TraceCheckUtils]: 115: Hoare triple {26452#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26452#(< ~counter~0 19)} is VALID [2022-04-28 08:09:41,305 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {25973#true} {26452#(< ~counter~0 19)} #55#return; {26452#(< ~counter~0 19)} is VALID [2022-04-28 08:09:41,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,305 INFO L290 TraceCheckUtils]: 112: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,305 INFO L290 TraceCheckUtils]: 111: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,305 INFO L272 TraceCheckUtils]: 110: Hoare triple {26452#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,305 INFO L290 TraceCheckUtils]: 109: Hoare triple {26452#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {26452#(< ~counter~0 19)} is VALID [2022-04-28 08:09:41,306 INFO L290 TraceCheckUtils]: 108: Hoare triple {26477#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26452#(< ~counter~0 19)} is VALID [2022-04-28 08:09:41,306 INFO L290 TraceCheckUtils]: 107: Hoare triple {26477#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26477#(< ~counter~0 18)} is VALID [2022-04-28 08:09:41,307 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {25973#true} {26477#(< ~counter~0 18)} #55#return; {26477#(< ~counter~0 18)} is VALID [2022-04-28 08:09:41,307 INFO L290 TraceCheckUtils]: 105: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,307 INFO L290 TraceCheckUtils]: 104: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,307 INFO L290 TraceCheckUtils]: 103: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,307 INFO L272 TraceCheckUtils]: 102: Hoare triple {26477#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {26477#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {26477#(< ~counter~0 18)} is VALID [2022-04-28 08:09:41,308 INFO L290 TraceCheckUtils]: 100: Hoare triple {26502#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26477#(< ~counter~0 18)} is VALID [2022-04-28 08:09:41,308 INFO L290 TraceCheckUtils]: 99: Hoare triple {26502#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26502#(< ~counter~0 17)} is VALID [2022-04-28 08:09:41,309 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25973#true} {26502#(< ~counter~0 17)} #55#return; {26502#(< ~counter~0 17)} is VALID [2022-04-28 08:09:41,309 INFO L290 TraceCheckUtils]: 97: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,309 INFO L290 TraceCheckUtils]: 96: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,309 INFO L290 TraceCheckUtils]: 95: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,309 INFO L272 TraceCheckUtils]: 94: Hoare triple {26502#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,309 INFO L290 TraceCheckUtils]: 93: Hoare triple {26502#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {26502#(< ~counter~0 17)} is VALID [2022-04-28 08:09:41,310 INFO L290 TraceCheckUtils]: 92: Hoare triple {26527#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26502#(< ~counter~0 17)} is VALID [2022-04-28 08:09:41,310 INFO L290 TraceCheckUtils]: 91: Hoare triple {26527#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26527#(< ~counter~0 16)} is VALID [2022-04-28 08:09:41,310 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {25973#true} {26527#(< ~counter~0 16)} #55#return; {26527#(< ~counter~0 16)} is VALID [2022-04-28 08:09:41,310 INFO L290 TraceCheckUtils]: 89: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,310 INFO L290 TraceCheckUtils]: 88: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,310 INFO L290 TraceCheckUtils]: 87: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,310 INFO L272 TraceCheckUtils]: 86: Hoare triple {26527#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,311 INFO L290 TraceCheckUtils]: 85: Hoare triple {26527#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {26527#(< ~counter~0 16)} is VALID [2022-04-28 08:09:41,311 INFO L290 TraceCheckUtils]: 84: Hoare triple {26340#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26527#(< ~counter~0 16)} is VALID [2022-04-28 08:09:41,312 INFO L290 TraceCheckUtils]: 83: Hoare triple {26340#(<= ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:41,312 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {25973#true} {26340#(<= ~counter~0 14)} #55#return; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:41,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,312 INFO L290 TraceCheckUtils]: 80: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,312 INFO L290 TraceCheckUtils]: 79: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,312 INFO L272 TraceCheckUtils]: 78: Hoare triple {26340#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {26340#(<= ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:41,313 INFO L290 TraceCheckUtils]: 76: Hoare triple {26315#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26340#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:41,313 INFO L290 TraceCheckUtils]: 75: Hoare triple {26315#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:41,314 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25973#true} {26315#(<= ~counter~0 13)} #55#return; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:41,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,314 INFO L290 TraceCheckUtils]: 72: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,314 INFO L290 TraceCheckUtils]: 71: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,314 INFO L272 TraceCheckUtils]: 70: Hoare triple {26315#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {26315#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:41,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {26290#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26315#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:41,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {26290#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:41,315 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {25973#true} {26290#(<= ~counter~0 12)} #55#return; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:41,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,316 INFO L290 TraceCheckUtils]: 64: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,316 INFO L290 TraceCheckUtils]: 63: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,316 INFO L272 TraceCheckUtils]: 62: Hoare triple {26290#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {26290#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:41,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {26265#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26290#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:41,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {26265#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:41,317 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {25973#true} {26265#(<= ~counter~0 11)} #55#return; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:41,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,317 INFO L272 TraceCheckUtils]: 54: Hoare triple {26265#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {26265#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:41,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {26240#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26265#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:41,327 INFO L290 TraceCheckUtils]: 51: Hoare triple {26240#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:41,327 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25973#true} {26240#(<= ~counter~0 10)} #55#return; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:41,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,328 INFO L272 TraceCheckUtils]: 46: Hoare triple {26240#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {26240#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:41,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {26215#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26240#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:41,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {26215#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:41,329 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25973#true} {26215#(<= ~counter~0 9)} #55#return; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:41,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,329 INFO L272 TraceCheckUtils]: 38: Hoare triple {26215#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {26215#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:41,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {26190#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26215#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:41,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {26190#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:41,331 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {25973#true} {26190#(<= ~counter~0 8)} #55#return; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:41,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,331 INFO L272 TraceCheckUtils]: 30: Hoare triple {26190#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {26190#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:41,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {26165#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26190#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:41,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {26165#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:41,333 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25973#true} {26165#(<= ~counter~0 7)} #55#return; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:41,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,333 INFO L272 TraceCheckUtils]: 22: Hoare triple {26165#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {26165#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:41,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {26140#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26165#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:41,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {26140#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:41,334 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25973#true} {26140#(<= ~counter~0 6)} #55#return; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:41,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,335 INFO L272 TraceCheckUtils]: 14: Hoare triple {26140#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {26140#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:41,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {26115#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26140#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:41,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {26115#(<= ~counter~0 5)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:41,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25973#true} {26115#(<= ~counter~0 5)} #53#return; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:41,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-28 08:09:41,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-28 08:09:41,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-28 08:09:41,336 INFO L272 TraceCheckUtils]: 6: Hoare triple {26115#(<= ~counter~0 5)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {25973#true} is VALID [2022-04-28 08:09:41,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {26115#(<= ~counter~0 5)} 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; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:41,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {26115#(<= ~counter~0 5)} call #t~ret6 := main(); {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:41,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26115#(<= ~counter~0 5)} {25973#true} #61#return; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:41,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {26115#(<= ~counter~0 5)} assume true; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:41,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {25973#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26115#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:41,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {25973#true} call ULTIMATE.init(); {25973#true} is VALID [2022-04-28 08:09:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 30 proven. 392 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 08:09:41,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:09:41,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389293108] [2022-04-28 08:09:41,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:09:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271497225] [2022-04-28 08:09:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271497225] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 08:09:41,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:09:41,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-28 08:09:41,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:09:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [662860547] [2022-04-28 08:09:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [662860547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:09:41,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:09:41,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 08:09:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708048398] [2022-04-28 08:09:41,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:09:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 135 [2022-04-28 08:09:41,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:09:41,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:41,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:41,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 08:09:41,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:41,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 08:09:41,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 08:09:41,442 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:42,094 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2022-04-28 08:09:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 08:09:42,094 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 135 [2022-04-28 08:09:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:09:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 150 transitions. [2022-04-28 08:09:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 150 transitions. [2022-04-28 08:09:42,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 150 transitions. [2022-04-28 08:09:42,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:42,258 INFO L225 Difference]: With dead ends: 150 [2022-04-28 08:09:42,258 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 08:09:42,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=558, Invalid=848, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 08:09:42,259 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:09:42,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 174 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:09:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 08:09:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-28 08:09:42,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:09:42,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:42,500 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:42,500 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:42,502 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2022-04-28 08:09:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-28 08:09:42,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:42,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:42,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-04-28 08:09:42,502 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-04-28 08:09:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:42,504 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2022-04-28 08:09:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-28 08:09:42,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:42,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:42,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:09:42,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:09:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2022-04-28 08:09:42,507 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 135 [2022-04-28 08:09:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:09:42,507 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2022-04-28 08:09:42,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 08:09:42,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 142 transitions. [2022-04-28 08:09:42,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-28 08:09:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-28 08:09:42,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:09:42,793 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:09:42,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 08:09:42,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 08:09:42,993 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:09:42,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:09:42,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1590123308, now seen corresponding path program 27 times [2022-04-28 08:09:42,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:42,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217361978] [2022-04-28 08:09:43,097 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:09:43,097 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 08:09:43,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:09:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1590123308, now seen corresponding path program 28 times [2022-04-28 08:09:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:09:43,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394655904] [2022-04-28 08:09:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:09:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:09:43,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:09:43,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409808780] [2022-04-28 08:09:43,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 08:09:43,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:43,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:09:43,116 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:09:43,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 08:09:43,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 08:09:43,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:09:43,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 08:09:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:09:43,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:09:44,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {27694#true} call ULTIMATE.init(); {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {27694#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27694#true} {27694#true} #61#return; {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {27694#true} call #t~ret6 := main(); {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {27694#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; {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {27694#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27694#true} {27694#true} #53#return; {27694#true} is VALID [2022-04-28 08:09:44,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {27694#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {27732#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:44,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {27732#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27732#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:44,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {27732#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {27732#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:44,088 INFO L272 TraceCheckUtils]: 14: Hoare triple {27732#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,088 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27694#true} {27732#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {27732#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:09:44,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {27732#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 08:09:44,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 08:09:44,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 08:09:44,101 INFO L272 TraceCheckUtils]: 22: Hoare triple {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,103 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27694#true} {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 08:09:44,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {27757#(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 * ~y~0 * ~y~0 + ~x~0; {27782#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 08:09:44,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {27782#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27782#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 08:09:44,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {27782#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {27782#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 08:09:44,105 INFO L272 TraceCheckUtils]: 30: Hoare triple {27782#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,106 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27694#true} {27782#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {27782#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 08:09:44,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {27782#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 08:09:44,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 08:09:44,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 08:09:44,107 INFO L272 TraceCheckUtils]: 38: Hoare triple {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,108 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27694#true} {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #55#return; {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 08:09:44,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {27832#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 08:09:44,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {27832#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27832#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 08:09:44,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {27832#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {27832#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 08:09:44,109 INFO L272 TraceCheckUtils]: 46: Hoare triple {27832#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,110 INFO L290 TraceCheckUtils]: 49: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,110 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {27694#true} {27832#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {27832#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 08:09:44,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {27832#(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 * ~y~0 * ~y~0 + ~x~0; {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 08:09:44,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 08:09:44,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 08:09:44,112 INFO L272 TraceCheckUtils]: 54: Hoare triple {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,112 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27694#true} {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 08:09:44,113 INFO L290 TraceCheckUtils]: 59: Hoare triple {27857#(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 * ~y~0 * ~y~0 + ~x~0; {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 08:09:44,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 08:09:44,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 08:09:44,114 INFO L272 TraceCheckUtils]: 62: Hoare triple {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,114 INFO L290 TraceCheckUtils]: 63: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,114 INFO L290 TraceCheckUtils]: 64: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,114 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27694#true} {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #55#return; {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 08:09:44,115 INFO L290 TraceCheckUtils]: 67: Hoare triple {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 08:09:44,115 INFO L290 TraceCheckUtils]: 68: Hoare triple {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 08:09:44,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 08:09:44,116 INFO L272 TraceCheckUtils]: 70: Hoare triple {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,117 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27694#true} {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #55#return; {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 08:09:44,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {27907#(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 * ~y~0 * ~y~0 + ~x~0; {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 08:09:44,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 08:09:44,118 INFO L290 TraceCheckUtils]: 77: Hoare triple {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} assume !!(#t~post5 < 20);havoc #t~post5; {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 08:09:44,118 INFO L272 TraceCheckUtils]: 78: Hoare triple {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,119 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {27694#true} {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} #55#return; {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 08:09:44,119 INFO L290 TraceCheckUtils]: 83: Hoare triple {27932#(and (= 7 (+ (- 1) 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 * ~y~0 * ~y~0 + ~x~0; {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 08:09:44,120 INFO L290 TraceCheckUtils]: 84: Hoare triple {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 08:09:44,120 INFO L290 TraceCheckUtils]: 85: Hoare triple {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 08:09:44,120 INFO L272 TraceCheckUtils]: 86: Hoare triple {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,120 INFO L290 TraceCheckUtils]: 87: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,120 INFO L290 TraceCheckUtils]: 88: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,120 INFO L290 TraceCheckUtils]: 89: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,121 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27694#true} {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #55#return; {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 08:09:44,121 INFO L290 TraceCheckUtils]: 91: Hoare triple {27957#(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 * ~y~0 * ~y~0 + ~x~0; {27982#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 08:09:44,122 INFO L290 TraceCheckUtils]: 92: Hoare triple {27982#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27982#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 08:09:44,122 INFO L290 TraceCheckUtils]: 93: Hoare triple {27982#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {27982#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 08:09:44,122 INFO L272 TraceCheckUtils]: 94: Hoare triple {27982#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,122 INFO L290 TraceCheckUtils]: 95: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,122 INFO L290 TraceCheckUtils]: 96: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,122 INFO L290 TraceCheckUtils]: 97: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,123 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {27694#true} {27982#(and (= main_~y~0 10) (= main_~c~0 10))} #55#return; {27982#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 08:09:44,123 INFO L290 TraceCheckUtils]: 99: Hoare triple {27982#(and (= main_~y~0 10) (= 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 * ~y~0 * ~y~0 + ~x~0; {28007#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 08:09:44,124 INFO L290 TraceCheckUtils]: 100: Hoare triple {28007#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28007#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 08:09:44,124 INFO L290 TraceCheckUtils]: 101: Hoare triple {28007#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 20);havoc #t~post5; {28007#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 08:09:44,124 INFO L272 TraceCheckUtils]: 102: Hoare triple {28007#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,124 INFO L290 TraceCheckUtils]: 103: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,124 INFO L290 TraceCheckUtils]: 104: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,125 INFO L290 TraceCheckUtils]: 105: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,125 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {27694#true} {28007#(and (= main_~c~0 11) (= main_~y~0 11))} #55#return; {28007#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 08:09:44,126 INFO L290 TraceCheckUtils]: 107: Hoare triple {28007#(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 * ~y~0 * ~y~0 + ~x~0; {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 08:09:44,126 INFO L290 TraceCheckUtils]: 108: Hoare triple {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 08:09:44,126 INFO L290 TraceCheckUtils]: 109: Hoare triple {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 08:09:44,126 INFO L272 TraceCheckUtils]: 110: Hoare triple {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,127 INFO L290 TraceCheckUtils]: 111: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,127 INFO L290 TraceCheckUtils]: 112: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,127 INFO L290 TraceCheckUtils]: 113: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,127 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {27694#true} {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #55#return; {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 08:09:44,128 INFO L290 TraceCheckUtils]: 115: Hoare triple {28032#(and (= main_~c~0 12) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 08:09:44,128 INFO L290 TraceCheckUtils]: 116: Hoare triple {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 08:09:44,129 INFO L290 TraceCheckUtils]: 117: Hoare triple {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(#t~post5 < 20);havoc #t~post5; {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 08:09:44,129 INFO L272 TraceCheckUtils]: 118: Hoare triple {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,129 INFO L290 TraceCheckUtils]: 119: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,129 INFO L290 TraceCheckUtils]: 120: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,129 INFO L290 TraceCheckUtils]: 121: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,129 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {27694#true} {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #55#return; {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 08:09:44,130 INFO L290 TraceCheckUtils]: 123: Hoare triple {28057#(and (= (+ (- 2) main_~y~0) 11) (= 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 * ~y~0 * ~y~0 + ~x~0; {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 08:09:44,130 INFO L290 TraceCheckUtils]: 124: Hoare triple {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 08:09:44,131 INFO L290 TraceCheckUtils]: 125: Hoare triple {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} assume !!(#t~post5 < 20);havoc #t~post5; {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 08:09:44,131 INFO L272 TraceCheckUtils]: 126: Hoare triple {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,131 INFO L290 TraceCheckUtils]: 127: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,131 INFO L290 TraceCheckUtils]: 128: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,131 INFO L290 TraceCheckUtils]: 129: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,132 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27694#true} {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} #55#return; {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-28 08:09:44,132 INFO L290 TraceCheckUtils]: 131: Hoare triple {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-28 08:09:44,132 INFO L272 TraceCheckUtils]: 132: Hoare triple {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-28 08:09:44,133 INFO L290 TraceCheckUtils]: 133: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-28 08:09:44,133 INFO L290 TraceCheckUtils]: 134: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-28 08:09:44,133 INFO L290 TraceCheckUtils]: 135: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-28 08:09:44,133 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {27694#true} {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} #57#return; {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-28 08:09:44,134 INFO L272 TraceCheckUtils]: 137: Hoare triple {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {28126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:09:44,134 INFO L290 TraceCheckUtils]: 138: Hoare triple {28126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:09:44,134 INFO L290 TraceCheckUtils]: 139: Hoare triple {28130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27695#false} is VALID [2022-04-28 08:09:44,135 INFO L290 TraceCheckUtils]: 140: Hoare triple {27695#false} assume !false; {27695#false} is VALID [2022-04-28 08:09:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 32 proven. 420 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 08:09:44,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:09:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:09:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394655904] [2022-04-28 08:09:44,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:09:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409808780] [2022-04-28 08:09:44,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409808780] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:09:44,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 08:09:44,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-28 08:09:44,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:09:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1217361978] [2022-04-28 08:09:44,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1217361978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:09:44,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:09:44,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 08:09:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891360927] [2022-04-28 08:09:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:09:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 141 [2022-04-28 08:09:44,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:09:44,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 08:09:44,552 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 08:09:44,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 08:09:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:44,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 08:09:44,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 08:09:44,553 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 08:09:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:46,989 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2022-04-28 08:09:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 08:09:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 141 [2022-04-28 08:09:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:09:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 08:09:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-28 08:09:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 08:09:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-28 08:09:46,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 109 transitions. [2022-04-28 08:09:47,096 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 08:09:47,099 INFO L225 Difference]: With dead ends: 148 [2022-04-28 08:09:47,099 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 08:09:47,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-28 08:09:47,100 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:09:47,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 947 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 08:09:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 08:09:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-28 08:09:47,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:09:47,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 08:09:47,326 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 08:09:47,326 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 08:09:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:47,328 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2022-04-28 08:09:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-28 08:09:47,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:47,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:47,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 142 states. [2022-04-28 08:09:47,329 INFO L87 Difference]: Start difference. First operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 142 states. [2022-04-28 08:09:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:47,331 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2022-04-28 08:09:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-28 08:09:47,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:47,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:47,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:09:47,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:09:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 08:09:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2022-04-28 08:09:47,334 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 141 [2022-04-28 08:09:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:09:47,334 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2022-04-28 08:09:47,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 08:09:47,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 145 transitions. [2022-04-28 08:09:47,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-28 08:09:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 08:09:47,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:09:47,571 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:09:47,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 08:09:47,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:47,787 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:09:47,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:09:47,788 INFO L85 PathProgramCache]: Analyzing trace with hash -654323313, now seen corresponding path program 27 times [2022-04-28 08:09:47,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:47,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1173036473] [2022-04-28 08:09:47,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:09:47,869 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 08:09:47,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:09:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash -654323313, now seen corresponding path program 28 times [2022-04-28 08:09:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:09:47,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905941156] [2022-04-28 08:09:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:09:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:09:47,885 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:09:47,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140262845] [2022-04-28 08:09:47,885 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 08:09:47,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:47,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:09:47,886 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:09:47,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 08:09:47,966 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 08:09:47,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:09:47,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 08:09:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:09:47,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:09:48,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {29064#true} call ULTIMATE.init(); {29064#true} is VALID [2022-04-28 08:09:48,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {29064#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {29072#(<= ~counter~0 0)} assume true; {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29072#(<= ~counter~0 0)} {29064#true} #61#return; {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {29072#(<= ~counter~0 0)} call #t~ret6 := main(); {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {29072#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {29072#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {29072#(<= ~counter~0 0)} ~cond := #in~cond; {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {29072#(<= ~counter~0 0)} assume !(0 == ~cond); {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {29072#(<= ~counter~0 0)} assume true; {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,682 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29072#(<= ~counter~0 0)} {29072#(<= ~counter~0 0)} #53#return; {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {29072#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {29072#(<= ~counter~0 0)} is VALID [2022-04-28 08:09:48,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {29072#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29106#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:48,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {29106#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {29106#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:48,684 INFO L272 TraceCheckUtils]: 14: Hoare triple {29106#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29106#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:48,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {29106#(<= ~counter~0 1)} ~cond := #in~cond; {29106#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:48,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {29106#(<= ~counter~0 1)} assume !(0 == ~cond); {29106#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:48,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {29106#(<= ~counter~0 1)} assume true; {29106#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:48,685 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29106#(<= ~counter~0 1)} {29106#(<= ~counter~0 1)} #55#return; {29106#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:48,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {29106#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29106#(<= ~counter~0 1)} is VALID [2022-04-28 08:09:48,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {29106#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29131#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:48,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {29131#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {29131#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:48,687 INFO L272 TraceCheckUtils]: 22: Hoare triple {29131#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29131#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:48,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {29131#(<= ~counter~0 2)} ~cond := #in~cond; {29131#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:48,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {29131#(<= ~counter~0 2)} assume !(0 == ~cond); {29131#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:48,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {29131#(<= ~counter~0 2)} assume true; {29131#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:48,688 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29131#(<= ~counter~0 2)} {29131#(<= ~counter~0 2)} #55#return; {29131#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:48,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {29131#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29131#(<= ~counter~0 2)} is VALID [2022-04-28 08:09:48,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {29131#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29156#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:48,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {29156#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {29156#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:48,689 INFO L272 TraceCheckUtils]: 30: Hoare triple {29156#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29156#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:48,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {29156#(<= ~counter~0 3)} ~cond := #in~cond; {29156#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:48,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {29156#(<= ~counter~0 3)} assume !(0 == ~cond); {29156#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:48,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {29156#(<= ~counter~0 3)} assume true; {29156#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:48,690 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29156#(<= ~counter~0 3)} {29156#(<= ~counter~0 3)} #55#return; {29156#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:48,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {29156#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29156#(<= ~counter~0 3)} is VALID [2022-04-28 08:09:48,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {29156#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:48,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {29181#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:48,692 INFO L272 TraceCheckUtils]: 38: Hoare triple {29181#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:48,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {29181#(<= ~counter~0 4)} ~cond := #in~cond; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:48,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {29181#(<= ~counter~0 4)} assume !(0 == ~cond); {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:48,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {29181#(<= ~counter~0 4)} assume true; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:48,693 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29181#(<= ~counter~0 4)} {29181#(<= ~counter~0 4)} #55#return; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:48,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {29181#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:48,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {29181#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:48,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {29206#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:48,695 INFO L272 TraceCheckUtils]: 46: Hoare triple {29206#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:48,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {29206#(<= ~counter~0 5)} ~cond := #in~cond; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:48,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {29206#(<= ~counter~0 5)} assume !(0 == ~cond); {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:48,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {29206#(<= ~counter~0 5)} assume true; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:48,696 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29206#(<= ~counter~0 5)} {29206#(<= ~counter~0 5)} #55#return; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:48,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {29206#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:48,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {29206#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:48,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {29231#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:48,697 INFO L272 TraceCheckUtils]: 54: Hoare triple {29231#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:48,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {29231#(<= ~counter~0 6)} ~cond := #in~cond; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:48,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {29231#(<= ~counter~0 6)} assume !(0 == ~cond); {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:48,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {29231#(<= ~counter~0 6)} assume true; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:48,699 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29231#(<= ~counter~0 6)} {29231#(<= ~counter~0 6)} #55#return; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:48,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {29231#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:48,699 INFO L290 TraceCheckUtils]: 60: Hoare triple {29231#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:48,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {29256#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:48,700 INFO L272 TraceCheckUtils]: 62: Hoare triple {29256#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:48,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {29256#(<= ~counter~0 7)} ~cond := #in~cond; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:48,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {29256#(<= ~counter~0 7)} assume !(0 == ~cond); {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:48,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {29256#(<= ~counter~0 7)} assume true; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:48,706 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29256#(<= ~counter~0 7)} {29256#(<= ~counter~0 7)} #55#return; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:48,706 INFO L290 TraceCheckUtils]: 67: Hoare triple {29256#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:48,707 INFO L290 TraceCheckUtils]: 68: Hoare triple {29256#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:48,707 INFO L290 TraceCheckUtils]: 69: Hoare triple {29281#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:48,707 INFO L272 TraceCheckUtils]: 70: Hoare triple {29281#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:48,708 INFO L290 TraceCheckUtils]: 71: Hoare triple {29281#(<= ~counter~0 8)} ~cond := #in~cond; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:48,708 INFO L290 TraceCheckUtils]: 72: Hoare triple {29281#(<= ~counter~0 8)} assume !(0 == ~cond); {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:48,708 INFO L290 TraceCheckUtils]: 73: Hoare triple {29281#(<= ~counter~0 8)} assume true; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:48,708 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29281#(<= ~counter~0 8)} {29281#(<= ~counter~0 8)} #55#return; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:48,709 INFO L290 TraceCheckUtils]: 75: Hoare triple {29281#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:48,709 INFO L290 TraceCheckUtils]: 76: Hoare triple {29281#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:48,710 INFO L290 TraceCheckUtils]: 77: Hoare triple {29306#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:48,710 INFO L272 TraceCheckUtils]: 78: Hoare triple {29306#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:48,710 INFO L290 TraceCheckUtils]: 79: Hoare triple {29306#(<= ~counter~0 9)} ~cond := #in~cond; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:48,711 INFO L290 TraceCheckUtils]: 80: Hoare triple {29306#(<= ~counter~0 9)} assume !(0 == ~cond); {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:48,711 INFO L290 TraceCheckUtils]: 81: Hoare triple {29306#(<= ~counter~0 9)} assume true; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:48,711 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29306#(<= ~counter~0 9)} {29306#(<= ~counter~0 9)} #55#return; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:48,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {29306#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:48,712 INFO L290 TraceCheckUtils]: 84: Hoare triple {29306#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:48,712 INFO L290 TraceCheckUtils]: 85: Hoare triple {29331#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:48,713 INFO L272 TraceCheckUtils]: 86: Hoare triple {29331#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:48,713 INFO L290 TraceCheckUtils]: 87: Hoare triple {29331#(<= ~counter~0 10)} ~cond := #in~cond; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:48,713 INFO L290 TraceCheckUtils]: 88: Hoare triple {29331#(<= ~counter~0 10)} assume !(0 == ~cond); {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:48,713 INFO L290 TraceCheckUtils]: 89: Hoare triple {29331#(<= ~counter~0 10)} assume true; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:48,714 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29331#(<= ~counter~0 10)} {29331#(<= ~counter~0 10)} #55#return; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:48,714 INFO L290 TraceCheckUtils]: 91: Hoare triple {29331#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:48,715 INFO L290 TraceCheckUtils]: 92: Hoare triple {29331#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:48,715 INFO L290 TraceCheckUtils]: 93: Hoare triple {29356#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:48,715 INFO L272 TraceCheckUtils]: 94: Hoare triple {29356#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:48,716 INFO L290 TraceCheckUtils]: 95: Hoare triple {29356#(<= ~counter~0 11)} ~cond := #in~cond; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:48,716 INFO L290 TraceCheckUtils]: 96: Hoare triple {29356#(<= ~counter~0 11)} assume !(0 == ~cond); {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:48,716 INFO L290 TraceCheckUtils]: 97: Hoare triple {29356#(<= ~counter~0 11)} assume true; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:48,717 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29356#(<= ~counter~0 11)} {29356#(<= ~counter~0 11)} #55#return; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:48,717 INFO L290 TraceCheckUtils]: 99: Hoare triple {29356#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:48,717 INFO L290 TraceCheckUtils]: 100: Hoare triple {29356#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:48,718 INFO L290 TraceCheckUtils]: 101: Hoare triple {29381#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:48,718 INFO L272 TraceCheckUtils]: 102: Hoare triple {29381#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:48,718 INFO L290 TraceCheckUtils]: 103: Hoare triple {29381#(<= ~counter~0 12)} ~cond := #in~cond; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:48,719 INFO L290 TraceCheckUtils]: 104: Hoare triple {29381#(<= ~counter~0 12)} assume !(0 == ~cond); {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:48,719 INFO L290 TraceCheckUtils]: 105: Hoare triple {29381#(<= ~counter~0 12)} assume true; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:48,719 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29381#(<= ~counter~0 12)} {29381#(<= ~counter~0 12)} #55#return; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:48,720 INFO L290 TraceCheckUtils]: 107: Hoare triple {29381#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:48,720 INFO L290 TraceCheckUtils]: 108: Hoare triple {29381#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:48,720 INFO L290 TraceCheckUtils]: 109: Hoare triple {29406#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:48,721 INFO L272 TraceCheckUtils]: 110: Hoare triple {29406#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:48,721 INFO L290 TraceCheckUtils]: 111: Hoare triple {29406#(<= ~counter~0 13)} ~cond := #in~cond; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:48,721 INFO L290 TraceCheckUtils]: 112: Hoare triple {29406#(<= ~counter~0 13)} assume !(0 == ~cond); {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:48,731 INFO L290 TraceCheckUtils]: 113: Hoare triple {29406#(<= ~counter~0 13)} assume true; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:48,732 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29406#(<= ~counter~0 13)} {29406#(<= ~counter~0 13)} #55#return; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:48,733 INFO L290 TraceCheckUtils]: 115: Hoare triple {29406#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:48,734 INFO L290 TraceCheckUtils]: 116: Hoare triple {29406#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:48,734 INFO L290 TraceCheckUtils]: 117: Hoare triple {29431#(<= ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:48,735 INFO L272 TraceCheckUtils]: 118: Hoare triple {29431#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:48,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {29431#(<= ~counter~0 14)} ~cond := #in~cond; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:48,736 INFO L290 TraceCheckUtils]: 120: Hoare triple {29431#(<= ~counter~0 14)} assume !(0 == ~cond); {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:48,737 INFO L290 TraceCheckUtils]: 121: Hoare triple {29431#(<= ~counter~0 14)} assume true; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:48,737 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29431#(<= ~counter~0 14)} {29431#(<= ~counter~0 14)} #55#return; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:48,738 INFO L290 TraceCheckUtils]: 123: Hoare triple {29431#(<= ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:48,739 INFO L290 TraceCheckUtils]: 124: Hoare triple {29431#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:48,739 INFO L290 TraceCheckUtils]: 125: Hoare triple {29456#(<= ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:48,740 INFO L272 TraceCheckUtils]: 126: Hoare triple {29456#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:48,741 INFO L290 TraceCheckUtils]: 127: Hoare triple {29456#(<= ~counter~0 15)} ~cond := #in~cond; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:48,741 INFO L290 TraceCheckUtils]: 128: Hoare triple {29456#(<= ~counter~0 15)} assume !(0 == ~cond); {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:48,742 INFO L290 TraceCheckUtils]: 129: Hoare triple {29456#(<= ~counter~0 15)} assume true; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:48,742 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29456#(<= ~counter~0 15)} {29456#(<= ~counter~0 15)} #55#return; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:48,743 INFO L290 TraceCheckUtils]: 131: Hoare triple {29456#(<= ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:48,743 INFO L290 TraceCheckUtils]: 132: Hoare triple {29456#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29481#(<= |main_#t~post5| 15)} is VALID [2022-04-28 08:09:48,744 INFO L290 TraceCheckUtils]: 133: Hoare triple {29481#(<= |main_#t~post5| 15)} assume !(#t~post5 < 20);havoc #t~post5; {29065#false} is VALID [2022-04-28 08:09:48,744 INFO L272 TraceCheckUtils]: 134: Hoare triple {29065#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29065#false} is VALID [2022-04-28 08:09:48,744 INFO L290 TraceCheckUtils]: 135: Hoare triple {29065#false} ~cond := #in~cond; {29065#false} is VALID [2022-04-28 08:09:48,744 INFO L290 TraceCheckUtils]: 136: Hoare triple {29065#false} assume !(0 == ~cond); {29065#false} is VALID [2022-04-28 08:09:48,744 INFO L290 TraceCheckUtils]: 137: Hoare triple {29065#false} assume true; {29065#false} is VALID [2022-04-28 08:09:48,744 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29065#false} {29065#false} #57#return; {29065#false} is VALID [2022-04-28 08:09:48,744 INFO L272 TraceCheckUtils]: 139: Hoare triple {29065#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {29065#false} is VALID [2022-04-28 08:09:48,745 INFO L290 TraceCheckUtils]: 140: Hoare triple {29065#false} ~cond := #in~cond; {29065#false} is VALID [2022-04-28 08:09:48,745 INFO L290 TraceCheckUtils]: 141: Hoare triple {29065#false} assume 0 == ~cond; {29065#false} is VALID [2022-04-28 08:09:48,745 INFO L290 TraceCheckUtils]: 142: Hoare triple {29065#false} assume !false; {29065#false} is VALID [2022-04-28 08:09:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 08:09:48,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:09:49,407 INFO L290 TraceCheckUtils]: 142: Hoare triple {29065#false} assume !false; {29065#false} is VALID [2022-04-28 08:09:49,407 INFO L290 TraceCheckUtils]: 141: Hoare triple {29065#false} assume 0 == ~cond; {29065#false} is VALID [2022-04-28 08:09:49,407 INFO L290 TraceCheckUtils]: 140: Hoare triple {29065#false} ~cond := #in~cond; {29065#false} is VALID [2022-04-28 08:09:49,407 INFO L272 TraceCheckUtils]: 139: Hoare triple {29065#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {29065#false} is VALID [2022-04-28 08:09:49,407 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29064#true} {29065#false} #57#return; {29065#false} is VALID [2022-04-28 08:09:49,407 INFO L290 TraceCheckUtils]: 137: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,407 INFO L290 TraceCheckUtils]: 136: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,408 INFO L290 TraceCheckUtils]: 135: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,408 INFO L272 TraceCheckUtils]: 134: Hoare triple {29065#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,408 INFO L290 TraceCheckUtils]: 133: Hoare triple {29539#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {29065#false} is VALID [2022-04-28 08:09:49,408 INFO L290 TraceCheckUtils]: 132: Hoare triple {29543#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29539#(< |main_#t~post5| 20)} is VALID [2022-04-28 08:09:49,408 INFO L290 TraceCheckUtils]: 131: Hoare triple {29543#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29543#(< ~counter~0 20)} is VALID [2022-04-28 08:09:49,409 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29064#true} {29543#(< ~counter~0 20)} #55#return; {29543#(< ~counter~0 20)} is VALID [2022-04-28 08:09:49,409 INFO L290 TraceCheckUtils]: 129: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,409 INFO L290 TraceCheckUtils]: 128: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,409 INFO L290 TraceCheckUtils]: 127: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,409 INFO L272 TraceCheckUtils]: 126: Hoare triple {29543#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,409 INFO L290 TraceCheckUtils]: 125: Hoare triple {29543#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {29543#(< ~counter~0 20)} is VALID [2022-04-28 08:09:49,411 INFO L290 TraceCheckUtils]: 124: Hoare triple {29568#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29543#(< ~counter~0 20)} is VALID [2022-04-28 08:09:49,411 INFO L290 TraceCheckUtils]: 123: Hoare triple {29568#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29568#(< ~counter~0 19)} is VALID [2022-04-28 08:09:49,411 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29064#true} {29568#(< ~counter~0 19)} #55#return; {29568#(< ~counter~0 19)} is VALID [2022-04-28 08:09:49,411 INFO L290 TraceCheckUtils]: 121: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,411 INFO L290 TraceCheckUtils]: 120: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,411 INFO L290 TraceCheckUtils]: 119: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,412 INFO L272 TraceCheckUtils]: 118: Hoare triple {29568#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,412 INFO L290 TraceCheckUtils]: 117: Hoare triple {29568#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {29568#(< ~counter~0 19)} is VALID [2022-04-28 08:09:49,412 INFO L290 TraceCheckUtils]: 116: Hoare triple {29593#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29568#(< ~counter~0 19)} is VALID [2022-04-28 08:09:49,413 INFO L290 TraceCheckUtils]: 115: Hoare triple {29593#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29593#(< ~counter~0 18)} is VALID [2022-04-28 08:09:49,413 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29064#true} {29593#(< ~counter~0 18)} #55#return; {29593#(< ~counter~0 18)} is VALID [2022-04-28 08:09:49,413 INFO L290 TraceCheckUtils]: 113: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,413 INFO L290 TraceCheckUtils]: 112: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,413 INFO L290 TraceCheckUtils]: 111: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,413 INFO L272 TraceCheckUtils]: 110: Hoare triple {29593#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,414 INFO L290 TraceCheckUtils]: 109: Hoare triple {29593#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {29593#(< ~counter~0 18)} is VALID [2022-04-28 08:09:49,414 INFO L290 TraceCheckUtils]: 108: Hoare triple {29618#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29593#(< ~counter~0 18)} is VALID [2022-04-28 08:09:49,414 INFO L290 TraceCheckUtils]: 107: Hoare triple {29618#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29618#(< ~counter~0 17)} is VALID [2022-04-28 08:09:49,415 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29064#true} {29618#(< ~counter~0 17)} #55#return; {29618#(< ~counter~0 17)} is VALID [2022-04-28 08:09:49,415 INFO L290 TraceCheckUtils]: 105: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,415 INFO L290 TraceCheckUtils]: 104: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,415 INFO L290 TraceCheckUtils]: 103: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,415 INFO L272 TraceCheckUtils]: 102: Hoare triple {29618#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,415 INFO L290 TraceCheckUtils]: 101: Hoare triple {29618#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {29618#(< ~counter~0 17)} is VALID [2022-04-28 08:09:49,416 INFO L290 TraceCheckUtils]: 100: Hoare triple {29456#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29618#(< ~counter~0 17)} is VALID [2022-04-28 08:09:49,416 INFO L290 TraceCheckUtils]: 99: Hoare triple {29456#(<= ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:49,417 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29064#true} {29456#(<= ~counter~0 15)} #55#return; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:49,417 INFO L290 TraceCheckUtils]: 97: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,417 INFO L290 TraceCheckUtils]: 96: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,417 INFO L272 TraceCheckUtils]: 94: Hoare triple {29456#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,417 INFO L290 TraceCheckUtils]: 93: Hoare triple {29456#(<= ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:49,418 INFO L290 TraceCheckUtils]: 92: Hoare triple {29431#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29456#(<= ~counter~0 15)} is VALID [2022-04-28 08:09:49,418 INFO L290 TraceCheckUtils]: 91: Hoare triple {29431#(<= ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:49,418 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29064#true} {29431#(<= ~counter~0 14)} #55#return; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:49,418 INFO L290 TraceCheckUtils]: 89: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,418 INFO L290 TraceCheckUtils]: 88: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,418 INFO L290 TraceCheckUtils]: 87: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,419 INFO L272 TraceCheckUtils]: 86: Hoare triple {29431#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,419 INFO L290 TraceCheckUtils]: 85: Hoare triple {29431#(<= ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:49,419 INFO L290 TraceCheckUtils]: 84: Hoare triple {29406#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29431#(<= ~counter~0 14)} is VALID [2022-04-28 08:09:49,420 INFO L290 TraceCheckUtils]: 83: Hoare triple {29406#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:49,420 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29064#true} {29406#(<= ~counter~0 13)} #55#return; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:49,420 INFO L290 TraceCheckUtils]: 81: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,420 INFO L290 TraceCheckUtils]: 80: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,420 INFO L290 TraceCheckUtils]: 79: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,420 INFO L272 TraceCheckUtils]: 78: Hoare triple {29406#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,421 INFO L290 TraceCheckUtils]: 77: Hoare triple {29406#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:49,421 INFO L290 TraceCheckUtils]: 76: Hoare triple {29381#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29406#(<= ~counter~0 13)} is VALID [2022-04-28 08:09:49,421 INFO L290 TraceCheckUtils]: 75: Hoare triple {29381#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:49,422 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29064#true} {29381#(<= ~counter~0 12)} #55#return; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:49,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,422 INFO L290 TraceCheckUtils]: 72: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,422 INFO L272 TraceCheckUtils]: 70: Hoare triple {29381#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {29381#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:49,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {29356#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29381#(<= ~counter~0 12)} is VALID [2022-04-28 08:09:49,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {29356#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:49,424 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29064#true} {29356#(<= ~counter~0 11)} #55#return; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:49,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,424 INFO L272 TraceCheckUtils]: 62: Hoare triple {29356#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {29356#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:49,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {29331#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29356#(<= ~counter~0 11)} is VALID [2022-04-28 08:09:49,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {29331#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:49,425 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29064#true} {29331#(<= ~counter~0 10)} #55#return; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:49,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,426 INFO L272 TraceCheckUtils]: 54: Hoare triple {29331#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {29331#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:49,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {29306#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29331#(<= ~counter~0 10)} is VALID [2022-04-28 08:09:49,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {29306#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:49,427 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29064#true} {29306#(<= ~counter~0 9)} #55#return; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:49,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,427 INFO L272 TraceCheckUtils]: 46: Hoare triple {29306#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {29306#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:49,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {29281#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29306#(<= ~counter~0 9)} is VALID [2022-04-28 08:09:49,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {29281#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:49,429 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29064#true} {29281#(<= ~counter~0 8)} #55#return; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:49,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,429 INFO L272 TraceCheckUtils]: 38: Hoare triple {29281#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {29281#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:49,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {29256#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29281#(<= ~counter~0 8)} is VALID [2022-04-28 08:09:49,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {29256#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:49,431 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29064#true} {29256#(<= ~counter~0 7)} #55#return; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:49,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,431 INFO L272 TraceCheckUtils]: 30: Hoare triple {29256#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {29256#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:49,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {29231#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29256#(<= ~counter~0 7)} is VALID [2022-04-28 08:09:49,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {29231#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:49,432 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29064#true} {29231#(<= ~counter~0 6)} #55#return; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:49,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,433 INFO L272 TraceCheckUtils]: 22: Hoare triple {29231#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {29231#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:49,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {29206#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29231#(<= ~counter~0 6)} is VALID [2022-04-28 08:09:49,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {29206#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:49,434 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29064#true} {29206#(<= ~counter~0 5)} #55#return; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:49,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,434 INFO L272 TraceCheckUtils]: 14: Hoare triple {29206#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {29206#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:49,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {29181#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29206#(<= ~counter~0 5)} is VALID [2022-04-28 08:09:49,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {29181#(<= ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:49,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29064#true} {29181#(<= ~counter~0 4)} #53#return; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:49,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-28 08:09:49,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-28 08:09:49,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-28 08:09:49,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {29181#(<= ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {29064#true} is VALID [2022-04-28 08:09:49,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {29181#(<= ~counter~0 4)} 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; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:49,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {29181#(<= ~counter~0 4)} call #t~ret6 := main(); {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:49,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29181#(<= ~counter~0 4)} {29064#true} #61#return; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:49,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {29181#(<= ~counter~0 4)} assume true; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:49,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {29064#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29181#(<= ~counter~0 4)} is VALID [2022-04-28 08:09:49,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {29064#true} call ULTIMATE.init(); {29064#true} is VALID [2022-04-28 08:09:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 32 proven. 450 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 08:09:49,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:09:49,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905941156] [2022-04-28 08:09:49,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:09:49,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140262845] [2022-04-28 08:09:49,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140262845] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 08:09:49,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:09:49,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-28 08:09:49,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:09:49,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1173036473] [2022-04-28 08:09:49,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1173036473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:09:49,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:09:49,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 08:09:49,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027466468] [2022-04-28 08:09:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:09:49,440 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 143 [2022-04-28 08:09:49,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:09:49,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:49,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:49,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 08:09:49,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:49,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 08:09:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 08:09:49,556 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:50,248 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2022-04-28 08:09:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 08:09:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 143 [2022-04-28 08:09:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:09:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 158 transitions. [2022-04-28 08:09:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 158 transitions. [2022-04-28 08:09:50,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 158 transitions. [2022-04-28 08:09:50,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:50,388 INFO L225 Difference]: With dead ends: 158 [2022-04-28 08:09:50,388 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 08:09:50,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=581, Invalid=901, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 08:09:50,390 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:09:50,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 153 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:09:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 08:09:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-04-28 08:09:50,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:09:50,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 08:09:50,625 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 08:09:50,626 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 08:09:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:50,628 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2022-04-28 08:09:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-28 08:09:50,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:50,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:50,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 148 states. [2022-04-28 08:09:50,629 INFO L87 Difference]: Start difference. First operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 148 states. [2022-04-28 08:09:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:09:50,631 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2022-04-28 08:09:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-28 08:09:50,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:09:50,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:09:50,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:09:50,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:09:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 08:09:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2022-04-28 08:09:50,634 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 143 [2022-04-28 08:09:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:09:50,634 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2022-04-28 08:09:50,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 08:09:50,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 150 transitions. [2022-04-28 08:09:50,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:09:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-28 08:09:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 08:09:50,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:09:50,913 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:09:50,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 08:09:51,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:51,113 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:09:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:09:51,113 INFO L85 PathProgramCache]: Analyzing trace with hash 780571829, now seen corresponding path program 29 times [2022-04-28 08:09:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:09:51,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036805270] [2022-04-28 08:09:51,203 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:09:51,203 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 08:09:51,203 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:09:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 780571829, now seen corresponding path program 30 times [2022-04-28 08:09:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:09:51,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238267430] [2022-04-28 08:09:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:09:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:09:51,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:09:51,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178310381] [2022-04-28 08:09:51,222 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 08:09:51,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:09:51,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:09:51,223 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:09:51,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process