/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:33:58,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:33:58,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:33:58,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:33:58,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:33:58,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:33:58,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:33:58,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:33:58,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:33:58,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:33:58,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:33:58,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:33:58,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:33:58,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:33:58,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:33:58,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:33:58,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:33:58,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:33:58,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:33:58,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:33:58,145 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:33:58,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:33:58,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:33:58,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:33:58,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:33:58,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:33:58,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:33:58,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:33:58,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:33:58,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:33:58,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:33:58,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:33:58,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:33:58,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:33:58,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:33:58,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:33:58,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:33:58,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:33:58,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:33:58,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:33:58,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:33:58,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:33:58,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:33:58,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:33:58,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:33:58,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:33:58,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:33:58,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:33:58,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:33:58,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:33:58,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:33:58,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:33:58,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:33:58,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:33:58,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:33:58,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:33:58,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:33:58,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:33:58,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:33:58,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:33:58,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:33:58,181 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:33:58,181 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:33:58,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:33:58,181 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:33:58,181 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:33:58,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:33:58,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:33:58,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:33:58,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:33:58,423 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:33:58,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-28 14:33:58,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b788a83e3/a6a470e45b2c4e9185cac69b0f64872c/FLAGa2cd29250 [2022-04-28 14:33:58,828 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:33:58,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-28 14:33:58,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b788a83e3/a6a470e45b2c4e9185cac69b0f64872c/FLAGa2cd29250 [2022-04-28 14:33:59,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b788a83e3/a6a470e45b2c4e9185cac69b0f64872c [2022-04-28 14:33:59,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:33:59,267 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:33:59,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:33:59,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:33:59,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:33:59,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49102fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59, skipping insertion in model container [2022-04-28 14:33:59,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:33:59,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:33:59,427 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_unwindbound10.c[458,471] [2022-04-28 14:33:59,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:33:59,464 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:33:59,481 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_unwindbound10.c[458,471] [2022-04-28 14:33:59,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:33:59,501 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:33:59,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59 WrapperNode [2022-04-28 14:33:59,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:33:59,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:33:59,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:33:59,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:33:59,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:33:59,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:33:59,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:33:59,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:33:59,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (1/1) ... [2022-04-28 14:33:59,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:33:59,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:59,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:33:59,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:33:59,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:33:59,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:33:59,616 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:33:59,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:33:59,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:33:59,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:33:59,618 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:33:59,618 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:33:59,618 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:33:59,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:33:59,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:33:59,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:33:59,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:33:59,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:33:59,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:33:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:33:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:33:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:33:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:33:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:33:59,689 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:33:59,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:33:59,873 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:33:59,898 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:33:59,898 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:33:59,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:33:59 BoogieIcfgContainer [2022-04-28 14:33:59,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:33:59,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:33:59,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:33:59,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:33:59,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:33:59" (1/3) ... [2022-04-28 14:33:59,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294a3ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:33:59, skipping insertion in model container [2022-04-28 14:33:59,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:59" (2/3) ... [2022-04-28 14:33:59,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294a3ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:33:59, skipping insertion in model container [2022-04-28 14:33:59,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:33:59" (3/3) ... [2022-04-28 14:33:59,912 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound10.c [2022-04-28 14:33:59,924 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:33:59,924 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:33:59,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:33:59,968 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@2f0e5c52, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4fd3d327 [2022-04-28 14:33:59,969 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:33:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:33:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:33:59,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:59,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:33:59,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 14:33:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:59,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564047333] [2022-04-28 14:34:00,005 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:34:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 14:34:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:34:00,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825797173] [2022-04-28 14:34:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:34:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:34:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:34:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:34:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:34:00,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 14:34:00,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:34:00,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 14:34:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:34:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:34:00,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:34:00,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:34:00,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:34:00,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:34:00,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:34:00,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 14:34:00,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:34:00,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 14:34:00,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 14:34:00,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 14:34:00,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 14:34:00,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:34:00,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:34:00,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:34:00,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:34:00,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 14:34:00,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 14:34:00,227 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 14:34:00,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 14:34:00,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 14:34:00,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 14:34:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:34:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:34:00,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825797173] [2022-04-28 14:34:00,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825797173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:34:00,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:34:00,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:34:00,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:34:00,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1564047333] [2022-04-28 14:34:00,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1564047333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:34:00,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:34:00,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:34:00,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920469789] [2022-04-28 14:34:00,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:34:00,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:34:00,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:34:00,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:34:00,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:34:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:34:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:34:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:34:00,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:34:00,299 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:16,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26m for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 14:35:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:16,336 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 14:35:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:35:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:35:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 14:35:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 14:35:16,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 14:35:16,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:16,430 INFO L225 Difference]: With dead ends: 50 [2022-04-28 14:35:16,430 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 14:35:16,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:35:16,435 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.8s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:16,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 75.8s Time] [2022-04-28 14:35:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 14:35:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 14:35:16,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:16,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:35:16,464 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:35:16,465 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:35:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:16,468 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 14:35:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 14:35:16,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:16,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:16,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 14:35:16,470 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 14:35:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:16,473 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 14:35:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 14:35:16,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:16,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:16,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:16,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:35:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 14:35:16,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 14:35:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:16,482 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 14:35:16,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:16,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 14:35:16,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 14:35:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:35:16,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:16,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:35:16,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:35:16,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 14:35:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:16,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413362234] [2022-04-28 14:35:16,516 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:35:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 14:35:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:16,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402139166] [2022-04-28 14:35:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:16,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:16,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801178548] [2022-04-28 14:35:16,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:16,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:16,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:16,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:35:16,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:35:16,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:35:16,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:16,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:35:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:16,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:16,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 14:35:16,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,795 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,797 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:16,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-28 14:35:16,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {243#false} is VALID [2022-04-28 14:35:16,799 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 14:35:16,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 14:35:16,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 14:35:16,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 14:35:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:35:16,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:35:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402139166] [2022-04-28 14:35:16,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801178548] [2022-04-28 14:35:16,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801178548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:16,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:16,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:35:16,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:16,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413362234] [2022-04-28 14:35:16,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413362234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:16,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:16,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:35:16,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011254596] [2022-04-28 14:35:16,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:16,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 14:35:16,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:16,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:35:16,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:16,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:35:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:16,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:35:16,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:35:16,822 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:35:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:16,901 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 14:35:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:35:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 14:35:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:35:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 14:35:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:35:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 14:35:16,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 14:35:16,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:16,940 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:35:16,941 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:35:16,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:35:16,942 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:16,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:35:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:35:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:35:16,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:16,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:35:16,958 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:35:16,959 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:35:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:16,961 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:35:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:35:16,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:16,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:16,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 14:35:16,963 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 14:35:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:16,965 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:35:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:35:16,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:16,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:16,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:16,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:35:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 14:35:16,968 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 14:35:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:16,969 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 14:35:16,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:35:16,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 14:35:16,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:35:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:35:16,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:16,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:35:17,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 14:35:17,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:17,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 14:35:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:17,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486951644] [2022-04-28 14:35:17,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:35:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 14:35:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:17,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867684104] [2022-04-28 14:35:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:17,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:17,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073653540] [2022-04-28 14:35:17,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:17,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:17,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:35:17,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:35:17,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:35:17,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:17,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:35:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:17,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:17,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 14:35:17,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID [2022-04-28 14:35:17,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 14:35:17,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 14:35:17,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 14:35:17,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {471#true} is VALID [2022-04-28 14:35:17,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-28 14:35:17,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 14:35:17,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 14:35:17,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 14:35:17,449 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 14:35:17,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:17,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:17,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:17,454 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 14:35:17,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:35:17,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 14:35:17,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 14:35:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:35:17,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:35:17,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:17,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867684104] [2022-04-28 14:35:17,456 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:17,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073653540] [2022-04-28 14:35:17,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073653540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:17,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:17,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:35:17,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:17,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486951644] [2022-04-28 14:35:17,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486951644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:17,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:17,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:35:17,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954409627] [2022-04-28 14:35:17,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:17,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 14:35:17,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:17,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:17,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:17,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:35:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:35:17,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:35:17,475 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:17,704 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 14:35:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:35:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 14:35:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:17,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 14:35:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:35:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:35:17,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:35:17,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:17,756 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:35:17,756 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 14:35:17,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:35:17,758 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:17,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:35:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 14:35:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 14:35:17,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:17,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:17,774 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:17,774 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:17,776 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 14:35:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:35:17,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:17,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:17,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 14:35:17,777 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 14:35:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:17,779 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 14:35:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:35:17,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:17,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:17,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:17,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 14:35:17,782 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 14:35:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:17,783 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 14:35:17,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:17,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 14:35:17,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:35:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:35:17,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:17,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:35:17,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:35:18,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 14:35:18,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 14:35:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:18,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709978847] [2022-04-28 14:35:18,287 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:18,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 14:35:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:18,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405494481] [2022-04-28 14:35:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:18,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:18,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894337911] [2022-04-28 14:35:18,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:18,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:35:18,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:35:18,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:18,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:18,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:35:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:18,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:18,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 14:35:18,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:18,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:18,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:18,723 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 14:35:18,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:18,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:18,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:18,725 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:18,725 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 14:35:18,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-28 14:35:18,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-28 14:35:18,726 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 14:35:18,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 14:35:18,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 14:35:18,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 14:35:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:35:18,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:18,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 14:35:18,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 14:35:18,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 14:35:18,920 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 14:35:18,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-28 14:35:18,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 10)} is VALID [2022-04-28 14:35:18,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~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; {830#(< ~counter~0 10)} is VALID [2022-04-28 14:35:18,923 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 10)} #55#return; {830#(< ~counter~0 10)} is VALID [2022-04-28 14:35:18,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 14:35:18,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 14:35:18,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 14:35:18,923 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~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)); {731#true} is VALID [2022-04-28 14:35:18,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-28 14:35:18,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-28 14:35:18,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 9)} is VALID [2022-04-28 14:35:18,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 9)} #53#return; {855#(< ~counter~0 9)} is VALID [2022-04-28 14:35:18,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 14:35:18,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 14:35:18,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 14:35:18,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 14:35:18,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~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; {855#(< ~counter~0 9)} is VALID [2022-04-28 14:35:18,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 9)} call #t~ret6 := main(); {855#(< ~counter~0 9)} is VALID [2022-04-28 14:35:18,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 9)} {731#true} #61#return; {855#(< ~counter~0 9)} is VALID [2022-04-28 14:35:18,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 9)} assume true; {855#(< ~counter~0 9)} is VALID [2022-04-28 14:35:18,931 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 9)} is VALID [2022-04-28 14:35:18,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 14:35:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:35:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405494481] [2022-04-28 14:35:18,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894337911] [2022-04-28 14:35:18,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894337911] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:18,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:18,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 14:35:18,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:18,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709978847] [2022-04-28 14:35:18,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709978847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:18,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:18,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:35:18,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853970677] [2022-04-28 14:35:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 14:35:18,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:18,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:35:18,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:18,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:35:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:35:18,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:35:18,969 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:35:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:19,073 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 14:35:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:35:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 14:35:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:35:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 14:35:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:35:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 14:35:19,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 14:35:19,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:19,123 INFO L225 Difference]: With dead ends: 42 [2022-04-28 14:35:19,123 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:35:19,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:35:19,124 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:19,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:35:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:35:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 14:35:19,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:19,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:19,146 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:19,146 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:19,148 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 14:35:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:35:19,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:19,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:19,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 14:35:19,150 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 14:35:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:19,151 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 14:35:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:35:19,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:19,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:19,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:19,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 14:35:19,154 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 14:35:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:19,154 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 14:35:19,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:35:19,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 14:35:19,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:35:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:35:19,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:19,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:35:19,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:35:19,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:19,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 14:35:19,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:19,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515406944] [2022-04-28 14:35:19,549 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:19,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 14:35:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:19,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983594242] [2022-04-28 14:35:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:19,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:19,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956027366] [2022-04-28 14:35:19,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:19,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:19,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:19,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:35:19,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:35:19,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:19,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:19,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:35:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:19,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:19,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:35:19,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-28 14:35:19,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:19,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 14:35:19,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:35:19,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 14:35:19,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:35:19,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:35:19,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:35:19,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:19,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 14:35:19,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:19,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:19,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:19,767 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 14:35:19,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:35:19,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:35:19,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:19,768 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:19,768 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 14:35:19,769 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 14:35:19,769 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 < 10);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 14:35:19,770 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 14:35:19,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:35:19,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:35:19,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:35:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:35:19,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:19,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:35:19,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:35:19,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:35:19,934 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 14:35:19,934 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 < 10);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 14:35:19,935 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 14:35:24,290 WARN 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 UNKNOWN [2022-04-28 14:35:24,291 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 14:35:24,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:35:24,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:35:24,292 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 14:35:24,292 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 < 10);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 14:35:24,293 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 14:35:24,294 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 14:35:24,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 14:35:24,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:35:24,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:35:24,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 14:35:24,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 14:35:24,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:35:24,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 14:35:24,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-28 14:35:24,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:35:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 14:35:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:24,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983594242] [2022-04-28 14:35:24,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:24,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956027366] [2022-04-28 14:35:24,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956027366] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:24,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:24,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:35:24,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:24,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515406944] [2022-04-28 14:35:24,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515406944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:24,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:24,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:35:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351813233] [2022-04-28 14:35:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:24,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 14:35:24,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:24,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:35:28,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:28,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:35:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:28,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:35:28,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:35:28,573 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:35:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:28,716 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 14:35:28,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:35:28,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 14:35:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:35:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:35:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:35:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:35:28,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 14:35:33,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:33,107 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:35:33,107 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 14:35:33,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:35:33,108 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:33,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:35:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 14:35:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 14:35:33,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:33,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:33,136 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:33,136 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:33,138 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:35:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:35:33,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:33,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:33,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 14:35:33,139 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 14:35:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:33,140 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:35:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:35:33,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:33,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:33,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:33,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 14:35:33,142 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 14:35:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:33,143 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 14:35:33,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:35:33,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 14:35:37,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:35:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:35:37,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:37,444 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:35:37,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:35:37,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:37,648 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 14:35:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:37,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097204034] [2022-04-28 14:35:37,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:37,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 14:35:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:37,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070978683] [2022-04-28 14:35:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:37,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:37,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358595171] [2022-04-28 14:35:37,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:37,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:37,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:37,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:35:37,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:35:37,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:37,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:37,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:35:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:37,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:38,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-28 14:35:38,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1504#true} is VALID [2022-04-28 14:35:38,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:38,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-28 14:35:38,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-28 14:35:38,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1504#true} is VALID [2022-04-28 14:35:38,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-28 14:35:38,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:35:38,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:35:38,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:38,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-28 14:35:38,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:38,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:38,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:38,195 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 14:35:38,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:35:38,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:35:38,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:38,197 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:38,198 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 14:35:38,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:35:38,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:35:38,201 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 14:35:38,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:35:38,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:35:38,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:38,202 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:35:38,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:35:38,203 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 14:35:38,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:35:38,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:35:38,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:38,204 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:35:38,205 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:35:38,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:35:38,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-28 14:35:38,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 14:35:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:35:38,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:38,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:38,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070978683] [2022-04-28 14:35:38,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:38,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358595171] [2022-04-28 14:35:38,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358595171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:38,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:38,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:35:38,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:38,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097204034] [2022-04-28 14:35:38,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097204034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:38,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:38,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:35:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635302166] [2022-04-28 14:35:38,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:38,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 14:35:38,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:38,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:35:38,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:38,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:35:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:38,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:35:38,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:35:38,531 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:35:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:38,786 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 14:35:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:35:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 14:35:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:35:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 14:35:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:35:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 14:35:38,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 14:35:38,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:38,832 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:35:38,832 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:35:38,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:35:38,833 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:38,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:35:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:35:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 14:35:38,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:38,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:38,867 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:38,867 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:38,869 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 14:35:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:35:38,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:38,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:38,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-28 14:35:38,869 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-28 14:35:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:38,871 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 14:35:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:35:38,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:38,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:38,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:38,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 14:35:38,873 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 14:35:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:38,874 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 14:35:38,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:35:38,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 14:35:43,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:35:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:35:43,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:43,165 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:35:43,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:35:43,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:43,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 14:35:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:43,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [112007202] [2022-04-28 14:35:43,526 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:43,526 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 14:35:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:43,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42038091] [2022-04-28 14:35:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:43,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:43,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738024965] [2022-04-28 14:35:43,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:43,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:43,547 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:35:43,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:35:43,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:43,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:43,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:35:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:43,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:43,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 14:35:43,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:43,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:43,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:43,812 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 14:35:43,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:43,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:43,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:43,814 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:43,814 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 14:35:43,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:43,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:43,816 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 14:35:43,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:43,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:43,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:43,817 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:43,818 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 14:35:43,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-28 14:35:43,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-28 14:35:43,819 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 14:35:43,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:35:43,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-28 14:35:43,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-28 14:35:43,819 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 14:35:43,820 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 14:35:43,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:35:43,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 14:35:43,820 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 14:35:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:35:43,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:44,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 14:35:44,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 14:35:44,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:35:44,059 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 14:35:44,059 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 14:35:44,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:35:44,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:35:44,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:35:44,059 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 14:35:44,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-28 14:35:44,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 10)} is VALID [2022-04-28 14:35:44,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~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; {2079#(< ~counter~0 10)} is VALID [2022-04-28 14:35:44,062 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 10)} #55#return; {2079#(< ~counter~0 10)} is VALID [2022-04-28 14:35:44,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:35:44,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:35:44,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:35:44,062 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~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)); {1925#true} is VALID [2022-04-28 14:35:44,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-28 14:35:44,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-28 14:35:44,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~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; {2104#(< ~counter~0 9)} is VALID [2022-04-28 14:35:44,064 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 9)} #55#return; {2104#(< ~counter~0 9)} is VALID [2022-04-28 14:35:44,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:35:44,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:35:44,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:35:44,065 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~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)); {1925#true} is VALID [2022-04-28 14:35:44,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-28 14:35:44,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-28 14:35:44,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 8)} is VALID [2022-04-28 14:35:44,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 8)} #53#return; {2129#(< ~counter~0 8)} is VALID [2022-04-28 14:35:44,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:35:44,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:35:44,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:35:44,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-28 14:35:44,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~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; {2129#(< ~counter~0 8)} is VALID [2022-04-28 14:35:44,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 8)} call #t~ret6 := main(); {2129#(< ~counter~0 8)} is VALID [2022-04-28 14:35:44,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 8)} {1925#true} #61#return; {2129#(< ~counter~0 8)} is VALID [2022-04-28 14:35:44,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 8)} assume true; {2129#(< ~counter~0 8)} is VALID [2022-04-28 14:35:44,069 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 8)} is VALID [2022-04-28 14:35:44,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 14:35:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:35:44,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:44,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42038091] [2022-04-28 14:35:44,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:44,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738024965] [2022-04-28 14:35:44,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738024965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:44,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:44,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 14:35:44,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:44,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [112007202] [2022-04-28 14:35:44,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [112007202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:44,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:44,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:35:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532739251] [2022-04-28 14:35:44,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 14:35:44,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:44,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:44,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:44,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:35:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:44,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:35:44,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:35:44,106 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:44,265 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-28 14:35:44,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:35:44,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 14:35:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 14:35:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 14:35:44,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 14:35:44,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:44,318 INFO L225 Difference]: With dead ends: 54 [2022-04-28 14:35:44,318 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 14:35:44,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:35:44,319 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:44,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:35:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 14:35:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 14:35:44,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:44,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:44,359 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:44,359 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:44,360 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:35:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:35:44,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:44,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:44,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 14:35:44,361 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 14:35:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:44,363 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:35:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:35:44,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:44,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:44,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:44,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 14:35:44,365 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-28 14:35:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:44,365 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 14:35:44,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:35:44,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 14:35:48,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:35:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 14:35:48,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:48,648 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:35:48,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:35:48,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:48,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:48,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-28 14:35:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:48,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345501577] [2022-04-28 14:35:48,975 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:48,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-28 14:35:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:48,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284968250] [2022-04-28 14:35:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:48,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:48,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305082137] [2022-04-28 14:35:48,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:35:48,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:48,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:49,004 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:35:49,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 14:35:49,053 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:35:49,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:49,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 14:35:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:49,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:49,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-28 14:35:49,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2456#true} is VALID [2022-04-28 14:35:49,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:49,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-28 14:35:49,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-28 14:35:49,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2456#true} is VALID [2022-04-28 14:35:49,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-28 14:35:49,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:49,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:49,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:49,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-28 14:35:49,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:49,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:49,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:49,439 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 14:35:49,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:49,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:49,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:49,440 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:49,441 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 14:35:49,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:35:49,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:35:49,442 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 14:35:49,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:49,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:49,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:49,443 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:35:49,444 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 14:35:49,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:35:49,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:35:49,445 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 14:35:49,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:49,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:49,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:49,445 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:35:49,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 14:35:49,446 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 14:35:49,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:49,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:49,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:49,447 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 14:35:49,448 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:35:49,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:35:49,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-28 14:35:49,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-28 14:35:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:35:49,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:49,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:49,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284968250] [2022-04-28 14:35:49,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:49,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305082137] [2022-04-28 14:35:49,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305082137] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:49,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:49,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 14:35:49,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:49,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345501577] [2022-04-28 14:35:49,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345501577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:49,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:49,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:35:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574870381] [2022-04-28 14:35:49,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:49,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 14:35:49,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:49,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:35:49,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:49,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:35:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:35:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:35:49,774 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:35:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:50,082 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 14:35:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:35:50,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 14:35:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:35:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 14:35:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:35:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 14:35:50,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 14:35:50,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:50,127 INFO L225 Difference]: With dead ends: 52 [2022-04-28 14:35:50,128 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 14:35:50,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:35:50,128 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:50,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:35:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 14:35:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 14:35:50,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:50,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:35:50,173 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:35:50,174 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:35:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:50,175 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 14:35:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:35:50,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:50,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:50,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 14:35:50,177 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 14:35:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:50,178 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 14:35:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:35:50,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:50,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:50,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:50,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:35:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-28 14:35:50,189 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-28 14:35:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:50,189 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-28 14:35:50,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:35:50,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-28 14:35:54,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:35:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 14:35:54,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:54,480 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:35:54,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 14:35:54,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:54,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-28 14:35:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:54,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [229508585] [2022-04-28 14:35:54,795 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:54,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-28 14:35:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:54,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162883584] [2022-04-28 14:35:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:54,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:54,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162217878] [2022-04-28 14:35:54,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:35:54,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:54,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:54,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:35:54,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 14:35:54,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:35:54,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:54,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:35:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:54,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:55,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 14:35:55,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,117 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:55,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:55,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:55,119 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 14:35:55,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:55,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:55,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:55,120 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:55,121 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 14:35:55,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:55,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:55,122 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 14:35:55,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:55,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:55,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:55,123 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:55,124 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 14:35:55,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:55,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:55,125 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 14:35:55,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:55,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:55,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:55,127 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:55,127 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 14:35:55,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-28 14:35:55,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-28 14:35:55,128 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 14:35:55,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:35:55,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-28 14:35:55,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-28 14:35:55,129 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 14:35:55,129 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 14:35:55,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:35:55,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 14:35:55,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 14:35:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:35:55,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:55,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 14:35:55,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 14:35:55,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:35:55,393 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 14:35:55,393 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 14:35:55,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:55,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:55,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:55,394 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 14:35:55,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-28 14:35:55,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 10)} is VALID [2022-04-28 14:35:55,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~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; {3129#(< ~counter~0 10)} is VALID [2022-04-28 14:35:55,399 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 10)} #55#return; {3129#(< ~counter~0 10)} is VALID [2022-04-28 14:35:55,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:55,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:55,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:55,399 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~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)); {2950#true} is VALID [2022-04-28 14:35:55,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-28 14:35:55,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-28 14:35:55,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~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; {3154#(< ~counter~0 9)} is VALID [2022-04-28 14:35:55,403 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 9)} #55#return; {3154#(< ~counter~0 9)} is VALID [2022-04-28 14:35:55,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:55,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:55,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:55,403 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~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)); {2950#true} is VALID [2022-04-28 14:35:55,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-28 14:35:55,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-28 14:35:55,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~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; {3179#(< ~counter~0 8)} is VALID [2022-04-28 14:35:55,405 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 8)} #55#return; {3179#(< ~counter~0 8)} is VALID [2022-04-28 14:35:55,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:55,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:55,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:55,405 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~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)); {2950#true} is VALID [2022-04-28 14:35:55,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-28 14:35:55,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-28 14:35:55,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 7)} is VALID [2022-04-28 14:35:55,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 7)} #53#return; {3204#(< ~counter~0 7)} is VALID [2022-04-28 14:35:55,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:55,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:55,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:55,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:35:55,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~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; {3204#(< ~counter~0 7)} is VALID [2022-04-28 14:35:55,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 7)} call #t~ret6 := main(); {3204#(< ~counter~0 7)} is VALID [2022-04-28 14:35:55,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 7)} {2950#true} #61#return; {3204#(< ~counter~0 7)} is VALID [2022-04-28 14:35:55,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 7)} assume true; {3204#(< ~counter~0 7)} is VALID [2022-04-28 14:35:55,409 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 7)} is VALID [2022-04-28 14:35:55,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 14:35:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:35:55,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:55,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162883584] [2022-04-28 14:35:55,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:55,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162217878] [2022-04-28 14:35:55,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162217878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:55,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:55,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 14:35:55,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:55,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [229508585] [2022-04-28 14:35:55,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [229508585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:55,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:55,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:35:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250225687] [2022-04-28 14:35:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:55,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 14:35:55,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:55,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:55,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:55,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:35:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:35:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:35:55,453 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:55,641 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-28 14:35:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:35:55,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 14:35:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 14:35:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 14:35:55,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 14:35:55,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:35:55,696 INFO L225 Difference]: With dead ends: 62 [2022-04-28 14:35:55,696 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 14:35:55,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:35:55,697 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:55,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:35:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 14:35:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 14:35:55,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:55,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:35:55,748 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:35:55,749 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:35:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:55,750 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 14:35:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:35:55,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:55,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:55,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 14:35:55,751 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 14:35:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:55,753 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 14:35:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:35:55,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:55,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:55,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:55,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:35:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 14:35:55,755 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-28 14:35:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:55,755 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 14:35:55,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:35:55,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 14:36:00,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:36:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 14:36:00,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:00,056 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:36:00,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 14:36:00,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 14:36:00,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-28 14:36:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:00,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1180879526] [2022-04-28 14:36:00,374 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:00,375 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:00,375 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-28 14:36:00,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:00,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316086786] [2022-04-28 14:36:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:00,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:00,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860088506] [2022-04-28 14:36:00,399 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:36:00,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:00,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:00,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:36:00,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 14:36:07,023 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:36:07,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:07,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:36:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:07,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:07,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:36:07,430 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-28 14:36:07,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:07,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:07,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:07,432 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 14:36:07,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:36:07,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:36:07,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:36:07,433 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:07,434 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 14:36:07,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:36:07,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:36:07,435 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 14:36:07,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:36:07,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:36:07,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:36:07,436 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:36:07,436 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 14:36:07,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:07,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:07,437 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 14:36:07,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:36:07,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:36:07,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:36:07,438 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:07,439 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 14:36:07,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:36:07,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:36:07,440 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 14:36:07,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:36:07,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:36:07,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:36:07,441 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:36:07,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:36:07,441 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 14:36:07,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:36:07,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:36:07,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:36:07,442 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:36:07,443 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:36:07,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:36:07,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-28 14:36:07,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-28 14:36:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:36:07,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:07,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:07,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316086786] [2022-04-28 14:36:07,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:07,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860088506] [2022-04-28 14:36:07,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860088506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:36:07,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:36:07,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 14:36:07,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:07,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1180879526] [2022-04-28 14:36:07,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1180879526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:07,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:07,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:36:07,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234123607] [2022-04-28 14:36:07,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:07,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 14:36:07,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:07,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:36:07,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:07,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:36:07,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:07,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:36:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:36:07,811 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:36:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:08,239 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 14:36:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:36:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 14:36:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:36:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 14:36:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:36:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 14:36:08,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 14:36:08,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:08,288 INFO L225 Difference]: With dead ends: 60 [2022-04-28 14:36:08,288 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 14:36:08,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:36:08,289 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:36:08,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:36:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 14:36:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 14:36:08,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:08,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:08,349 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:08,349 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:08,352 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 14:36:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:36:08,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:08,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:08,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 14:36:08,352 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 14:36:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:08,355 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 14:36:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:36:08,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:08,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:08,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:08,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-28 14:36:08,358 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-28 14:36:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:08,358 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-28 14:36:08,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:36:08,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-28 14:36:12,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:36:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 14:36:12,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:12,702 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:36:12,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 14:36:12,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 14:36:12,907 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:12,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-28 14:36:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:12,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703284909] [2022-04-28 14:36:13,012 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:13,012 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-28 14:36:13,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:13,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249712887] [2022-04-28 14:36:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:13,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:13,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:13,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571504898] [2022-04-28 14:36:13,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:36:13,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:13,026 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:36:13,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 14:36:13,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 14:36:13,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:13,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 14:36:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:13,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:13,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 14:36:13,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {4156#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {4156#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,710 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:13,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:13,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:13,712 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 14:36:13,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:13,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:13,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:13,714 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:13,714 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 14:36:13,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:13,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:13,716 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 14:36:13,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:13,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:13,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:13,718 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:13,718 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 14:36:13,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {4215#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:13,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:13,720 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 14:36:13,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:13,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:13,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:13,722 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:13,722 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 14:36:13,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {4240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:13,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:13,724 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 14:36:13,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:13,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:13,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:13,726 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:13,726 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 14:36:13,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {4265#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4290#(<= |main_#t~post5| 4)} is VALID [2022-04-28 14:36:13,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-28 14:36:13,728 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 14:36:13,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:36:13,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-28 14:36:13,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-28 14:36:13,728 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 14:36:13,728 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 14:36:13,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:36:13,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 14:36:13,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 14:36:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:36:13,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:14,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 14:36:14,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 14:36:14,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:36:14,069 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 14:36:14,069 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 14:36:14,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:36:14,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:36:14,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:36:14,069 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 14:36:14,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-28 14:36:14,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 10)} is VALID [2022-04-28 14:36:14,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~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; {4352#(< ~counter~0 10)} is VALID [2022-04-28 14:36:14,071 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 10)} #55#return; {4352#(< ~counter~0 10)} is VALID [2022-04-28 14:36:14,071 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:36:14,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:36:14,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:36:14,071 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~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)); {4148#true} is VALID [2022-04-28 14:36:14,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-28 14:36:14,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-28 14:36:14,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~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; {4377#(< ~counter~0 9)} is VALID [2022-04-28 14:36:14,073 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 9)} #55#return; {4377#(< ~counter~0 9)} is VALID [2022-04-28 14:36:14,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:36:14,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:36:14,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:36:14,074 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~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)); {4148#true} is VALID [2022-04-28 14:36:14,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-28 14:36:14,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-28 14:36:14,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~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; {4402#(< ~counter~0 8)} is VALID [2022-04-28 14:36:14,075 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 8)} #55#return; {4402#(< ~counter~0 8)} is VALID [2022-04-28 14:36:14,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:36:14,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:36:14,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:36:14,076 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~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)); {4148#true} is VALID [2022-04-28 14:36:14,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-28 14:36:14,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-28 14:36:14,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~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; {4427#(< ~counter~0 7)} is VALID [2022-04-28 14:36:14,077 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 7)} #55#return; {4427#(< ~counter~0 7)} is VALID [2022-04-28 14:36:14,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:36:14,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:36:14,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:36:14,078 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~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)); {4148#true} is VALID [2022-04-28 14:36:14,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-28 14:36:14,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-28 14:36:14,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 6)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 6)} is VALID [2022-04-28 14:36:14,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 6)} #53#return; {4452#(< ~counter~0 6)} is VALID [2022-04-28 14:36:14,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:36:14,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:36:14,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:36:14,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 6)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:36:14,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~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; {4452#(< ~counter~0 6)} is VALID [2022-04-28 14:36:14,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 6)} call #t~ret6 := main(); {4452#(< ~counter~0 6)} is VALID [2022-04-28 14:36:14,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 6)} {4148#true} #61#return; {4452#(< ~counter~0 6)} is VALID [2022-04-28 14:36:14,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 6)} assume true; {4452#(< ~counter~0 6)} is VALID [2022-04-28 14:36:14,082 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 6)} is VALID [2022-04-28 14:36:14,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 14:36:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:36:14,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:14,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249712887] [2022-04-28 14:36:14,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:14,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571504898] [2022-04-28 14:36:14,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571504898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:36:14,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:36:14,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 14:36:14,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:14,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703284909] [2022-04-28 14:36:14,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703284909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:14,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:14,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:36:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161103722] [2022-04-28 14:36:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:14,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 14:36:14,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:14,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:36:14,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:14,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:36:14,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:14,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:36:14,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:36:14,131 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:36:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:14,324 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-28 14:36:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:36:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 14:36:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:36:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 14:36:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:36:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 14:36:14,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 14:36:14,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:14,385 INFO L225 Difference]: With dead ends: 70 [2022-04-28 14:36:14,385 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 14:36:14,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:36:14,398 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:36:14,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:36:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 14:36:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 14:36:14,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:14,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:14,463 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:14,463 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:14,464 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 14:36:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:36:14,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:14,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:14,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 14:36:14,465 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 14:36:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:14,467 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 14:36:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:36:14,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:14,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:14,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:14,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 14:36:14,469 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 14:36:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:14,469 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 14:36:14,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:36:14,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 14:36:18,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:36:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 14:36:18,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:18,741 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:36:18,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 14:36:18,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 14:36:18,942 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-28 14:36:18,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:18,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [871313976] [2022-04-28 14:36:19,033 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:19,033 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-28 14:36:19,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:19,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683875289] [2022-04-28 14:36:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:19,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:19,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901390394] [2022-04-28 14:36:19,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:36:19,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:19,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:19,047 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:36:19,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 14:36:19,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:36:19,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:19,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 14:36:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:19,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:19,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 14:36:19,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4879#true} is VALID [2022-04-28 14:36:19,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:36:19,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 14:36:19,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 14:36:19,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4879#true} is VALID [2022-04-28 14:36:19,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-28 14:36:19,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:36:19,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:36:19,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:36:19,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 14:36:19,992 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 14:36:19,993 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 14:36:19,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:19,993 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 14:36:19,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:36:19,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:36:19,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:36:19,994 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 14:36:19,995 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 14:36:19,995 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 14:36:19,996 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 < 10);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 14:36:19,996 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 14:36:19,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:36:19,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:36:19,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:36:19,997 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 14:36:19,998 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 14:36:19,998 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 14:36:19,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 14:36:19,999 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 14:36:19,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:36:19,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:36:19,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:36:20,000 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 14:36:20,000 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 14:36:20,001 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 14:36:20,001 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 < 10);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 14:36:20,002 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 14:36:20,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:36:20,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:36:20,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:36:20,003 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 14:36:20,003 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 14:36:20,004 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 14:36:20,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:36:20,004 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 14:36:20,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:36:20,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:36:20,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:36:20,006 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 14:36:20,006 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 14:36:20,006 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 14:36:20,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:36:20,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:36:20,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:36:20,007 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 14:36:20,008 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 14:36:20,009 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 14:36:20,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 14:36:20,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 14:36:20,010 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 14:36:20,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:20,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683875289] [2022-04-28 14:36:20,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:20,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901390394] [2022-04-28 14:36:20,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901390394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:36:20,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:36:20,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 14:36:20,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:20,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [871313976] [2022-04-28 14:36:20,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [871313976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:20,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:20,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:36:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680565613] [2022-04-28 14:36:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:20,568 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 14:36:20,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:20,569 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 14:36:20,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:20,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:36:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:36:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:36:20,605 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 14:36:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:21,186 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 14:36:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:36:21,186 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 14:36:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:21,187 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 14:36:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 14:36:21,188 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 14:36:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 14:36:21,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-28 14:36:21,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:21,261 INFO L225 Difference]: With dead ends: 68 [2022-04-28 14:36:21,261 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 14:36:21,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:36:21,262 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 14:36:21,263 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 14:36:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 14:36:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 14:36:21,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:21,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:21,330 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:21,330 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:21,332 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 14:36:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:36:21,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:21,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:21,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 14:36:21,332 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 14:36:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:21,334 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 14:36:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:36:21,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:21,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:21,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:21,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 14:36:21,336 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-28 14:36:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:21,336 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 14:36:21,336 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 14:36:21,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 14:36:25,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:36:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 14:36:25,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:25,643 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:36:25,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 14:36:25,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 14:36:25,843 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-28 14:36:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:25,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225958672] [2022-04-28 14:36:25,956 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:25,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-28 14:36:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:25,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080647555] [2022-04-28 14:36:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:25,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:25,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008629707] [2022-04-28 14:36:25,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:36:25,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:25,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:25,970 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:36:25,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 14:36:26,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:36:26,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:26,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:36:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:26,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:26,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 14:36:26,339 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 14:36:26,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:26,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:26,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:26,341 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 14:36:26,348 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 14:36:26,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:26,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:26,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:26,349 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 14:36:26,350 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 14:36:26,350 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 14:36:26,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:26,351 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 14:36:26,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:26,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:26,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:26,352 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 14:36:26,352 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 14:36:26,353 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 14:36:26,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:26,354 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 14:36:26,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:26,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:26,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:26,356 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 14:36:26,356 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 14:36:26,357 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 14:36:26,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:26,358 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 14:36:26,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:26,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:26,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:26,360 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 14:36:26,360 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 14:36:26,360 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 14:36:26,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,361 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 14:36:26,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,364 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 14:36:26,364 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 14:36:26,365 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 14:36:26,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:26,366 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 14:36:26,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:26,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:26,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:26,367 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 14:36:26,367 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 14:36:26,371 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 14:36:26,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-28 14:36:26,372 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 14:36:26,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 14:36:26,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-28 14:36:26,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-28 14:36:26,372 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 14:36:26,373 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 14:36:26,373 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 14:36:26,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 14:36:26,373 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 14:36:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:36:26,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:26,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 14:36:26,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 14:36:26,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 14:36:26,680 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 14:36:26,680 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 14:36:26,680 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:36:26,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:36:26,680 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:36:26,680 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 14:36:26,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-28 14:36:26,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 10)} is VALID [2022-04-28 14:36:26,681 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~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; {5823#(< ~counter~0 10)} is VALID [2022-04-28 14:36:26,682 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 10)} #55#return; {5823#(< ~counter~0 10)} is VALID [2022-04-28 14:36:26,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:36:26,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:36:26,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:36:26,682 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~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)); {5594#true} is VALID [2022-04-28 14:36:26,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-28 14:36:26,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-28 14:36:26,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~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; {5848#(< ~counter~0 9)} is VALID [2022-04-28 14:36:26,684 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 9)} #55#return; {5848#(< ~counter~0 9)} is VALID [2022-04-28 14:36:26,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:36:26,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:36:26,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:36:26,684 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~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)); {5594#true} is VALID [2022-04-28 14:36:26,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-28 14:36:26,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-28 14:36:26,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~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; {5873#(< ~counter~0 8)} is VALID [2022-04-28 14:36:26,686 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 8)} #55#return; {5873#(< ~counter~0 8)} is VALID [2022-04-28 14:36:26,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:36:26,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:36:26,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:36:26,686 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~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)); {5594#true} is VALID [2022-04-28 14:36:26,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-28 14:36:26,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-28 14:36:26,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~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; {5898#(< ~counter~0 7)} is VALID [2022-04-28 14:36:26,687 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 7)} #55#return; {5898#(< ~counter~0 7)} is VALID [2022-04-28 14:36:26,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:36:26,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:36:26,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:36:26,687 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~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)); {5594#true} is VALID [2022-04-28 14:36:26,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-28 14:36:26,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-28 14:36:26,688 INFO L290 TraceCheckUtils]: 19: 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 14:36:26,689 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:26,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:36:26,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:36:26,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:36:26,689 INFO L272 TraceCheckUtils]: 14: 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)); {5594#true} is VALID [2022-04-28 14:36:26,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:26,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:26,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {5711#(<= ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,690 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5711#(<= ~counter~0 4)} #53#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:36:26,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:36:26,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:36:26,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {5711#(<= ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-28 14:36:26,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {5711#(<= ~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; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {5711#(<= ~counter~0 4)} call #t~ret6 := main(); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5711#(<= ~counter~0 4)} {5594#true} #61#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,706 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; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:26,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 14:36:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 14:36:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:26,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080647555] [2022-04-28 14:36:26,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:26,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008629707] [2022-04-28 14:36:26,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008629707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:36:26,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:36:26,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 14:36:26,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:26,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225958672] [2022-04-28 14:36:26,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225958672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:26,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:26,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:36:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183154637] [2022-04-28 14:36:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-28 14:36:26,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:26,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:26,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:26,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:36:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:36:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:36:26,764 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:26,987 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-28 14:36:26,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:36:26,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-28 14:36:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 14:36:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 14:36:26,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-28 14:36:27,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:27,063 INFO L225 Difference]: With dead ends: 78 [2022-04-28 14:36:27,063 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 14:36:27,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:36:27,064 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:36:27,064 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.0s Time] [2022-04-28 14:36:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 14:36:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 14:36:27,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:27,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:27,137 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:27,138 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:27,139 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 14:36:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:36:27,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:27,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:27,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-28 14:36:27,140 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-28 14:36:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:27,142 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 14:36:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:36:27,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:27,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:27,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:27,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-28 14:36:27,144 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-28 14:36:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:27,144 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-28 14:36:27,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:36:27,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-28 14:36:31,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:36:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 14:36:31,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:31,472 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:36:31,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 14:36:31,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 14:36:31,672 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:31,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:31,673 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-28 14:36:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:31,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047072866] [2022-04-28 14:36:31,777 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:31,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-28 14:36:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:31,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008765300] [2022-04-28 14:36:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:31,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394223219] [2022-04-28 14:36:31,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:36:31,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:31,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:31,789 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:36:31,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 14:36:31,837 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:36:31,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:31,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:36:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:31,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:32,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-28 14:36:32,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#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; {6423#true} is VALID [2022-04-28 14:36:32,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #61#return; {6423#true} is VALID [2022-04-28 14:36:32,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret6 := main(); {6423#true} is VALID [2022-04-28 14:36:32,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#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; {6423#true} is VALID [2022-04-28 14:36:32,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {6423#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6423#true} is VALID [2022-04-28 14:36:32,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 14:36:32,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 14:36:32,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6423#true} {6423#true} #53#return; {6423#true} is VALID [2022-04-28 14:36:32,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {6423#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:32,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:32,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:32,236 INFO L272 TraceCheckUtils]: 14: Hoare triple {6461#(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)); {6423#true} is VALID [2022-04-28 14:36:32,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 14:36:32,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 14:36:32,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,237 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6423#true} {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:32,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {6461#(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; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:36:32,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:36:32,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:36:32,239 INFO L272 TraceCheckUtils]: 22: Hoare triple {6486#(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)); {6423#true} is VALID [2022-04-28 14:36:32,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 14:36:32,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 14:36:32,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,240 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6423#true} {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:36:32,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(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; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:32,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:32,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:32,241 INFO L272 TraceCheckUtils]: 30: Hoare triple {6511#(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)); {6423#true} is VALID [2022-04-28 14:36:32,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 14:36:32,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 14:36:32,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,242 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6423#true} {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:32,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {6511#(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; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:36:32,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:36:32,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:36:32,244 INFO L272 TraceCheckUtils]: 38: Hoare triple {6536#(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)); {6423#true} is VALID [2022-04-28 14:36:32,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 14:36:32,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 14:36:32,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,244 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6423#true} {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:36:32,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {6536#(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; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:36:32,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:36:32,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:36:32,246 INFO L272 TraceCheckUtils]: 46: Hoare triple {6561#(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)); {6423#true} is VALID [2022-04-28 14:36:32,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 14:36:32,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 14:36:32,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,247 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6423#true} {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:36:32,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {6561#(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; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 14:36:32,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 14:36:32,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 14:36:32,248 INFO L272 TraceCheckUtils]: 54: Hoare triple {6586#(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)); {6423#true} is VALID [2022-04-28 14:36:32,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 14:36:32,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 14:36:32,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,249 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6423#true} {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 14:36:32,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 14:36:32,249 INFO L272 TraceCheckUtils]: 60: Hoare triple {6611#(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)); {6423#true} is VALID [2022-04-28 14:36:32,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 14:36:32,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 14:36:32,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 14:36:32,250 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6423#true} {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 14:36:32,250 INFO L272 TraceCheckUtils]: 65: Hoare triple {6611#(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)); {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:36:32,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:36:32,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {6634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6424#false} is VALID [2022-04-28 14:36:32,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-28 14:36:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:36:32,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:32,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008765300] [2022-04-28 14:36:32,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394223219] [2022-04-28 14:36:32,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394223219] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:36:32,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:36:32,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:36:32,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047072866] [2022-04-28 14:36:32,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047072866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:32,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:32,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:36:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506668421] [2022-04-28 14:36:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:32,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-28 14:36:32,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:32,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:36:32,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:32,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:36:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:36:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:36:32,613 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:36:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:33,270 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:36:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:36:33,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-28 14:36:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:36:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 14:36:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:36:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 14:36:33,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 14:36:33,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:33,328 INFO L225 Difference]: With dead ends: 76 [2022-04-28 14:36:33,328 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 14:36:33,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:36:33,329 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:36:33,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:36:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 14:36:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 14:36:33,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:33,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:33,414 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:33,414 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:33,415 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 14:36:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:36:33,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:33,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:33,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-28 14:36:33,416 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-28 14:36:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:33,418 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 14:36:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:36:33,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:33,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:33,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:33,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 14:36:33,420 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-28 14:36:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:33,420 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 14:36:33,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:36:33,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 14:36:37,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:36:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 14:36:37,837 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:37,837 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:36:37,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 14:36:38,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 14:36:38,038 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-28 14:36:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:38,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181014785] [2022-04-28 14:36:38,133 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:38,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-28 14:36:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:38,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417393978] [2022-04-28 14:36:38,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:38,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:38,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:38,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462407462] [2022-04-28 14:36:38,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:36:38,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:38,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:38,160 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:36:38,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 14:36:38,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:36:38,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:38,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:36:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:38,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:38,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-28 14:36:38,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#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; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7144#(<= ~counter~0 0)} {7136#true} #61#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {7144#(<= ~counter~0 0)} call #t~ret6 := main(); {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {7144#(<= ~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; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {7144#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {7144#(<= ~counter~0 0)} ~cond := #in~cond; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {7144#(<= ~counter~0 0)} assume !(0 == ~cond); {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7144#(<= ~counter~0 0)} {7144#(<= ~counter~0 0)} #53#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {7144#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:38,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:38,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:38,557 INFO L272 TraceCheckUtils]: 14: Hoare triple {7178#(<= ~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)); {7178#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:38,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {7178#(<= ~counter~0 1)} ~cond := #in~cond; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:38,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {7178#(<= ~counter~0 1)} assume !(0 == ~cond); {7178#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:38,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {7178#(<= ~counter~0 1)} assume true; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:38,558 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7178#(<= ~counter~0 1)} {7178#(<= ~counter~0 1)} #55#return; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:38,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {7178#(<= ~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; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:38,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {7178#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:38,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {7203#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:38,560 INFO L272 TraceCheckUtils]: 22: Hoare triple {7203#(<= ~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)); {7203#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:38,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {7203#(<= ~counter~0 2)} ~cond := #in~cond; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:38,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {7203#(<= ~counter~0 2)} assume !(0 == ~cond); {7203#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:38,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {7203#(<= ~counter~0 2)} assume true; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:38,562 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7203#(<= ~counter~0 2)} {7203#(<= ~counter~0 2)} #55#return; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:38,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {7203#(<= ~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; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:38,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {7203#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {7228#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,564 INFO L272 TraceCheckUtils]: 30: Hoare triple {7228#(<= ~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)); {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {7228#(<= ~counter~0 3)} ~cond := #in~cond; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {7228#(<= ~counter~0 3)} assume !(0 == ~cond); {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,565 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7228#(<= ~counter~0 3)} {7228#(<= ~counter~0 3)} #55#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {7228#(<= ~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; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,567 INFO L272 TraceCheckUtils]: 38: Hoare triple {7253#(<= ~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)); {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {7253#(<= ~counter~0 4)} ~cond := #in~cond; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {7253#(<= ~counter~0 4)} assume !(0 == ~cond); {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {7253#(<= ~counter~0 4)} assume true; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,569 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7253#(<= ~counter~0 4)} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {7253#(<= ~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; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,571 INFO L272 TraceCheckUtils]: 46: Hoare triple {7278#(<= ~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)); {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {7278#(<= ~counter~0 5)} ~cond := #in~cond; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {7278#(<= ~counter~0 5)} assume !(0 == ~cond); {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {7278#(<= ~counter~0 5)} assume true; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,573 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7278#(<= ~counter~0 5)} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {7278#(<= ~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; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,574 INFO L272 TraceCheckUtils]: 54: Hoare triple {7303#(<= ~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)); {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,575 INFO L290 TraceCheckUtils]: 55: Hoare triple {7303#(<= ~counter~0 6)} ~cond := #in~cond; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {7303#(<= ~counter~0 6)} assume !(0 == ~cond); {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,575 INFO L290 TraceCheckUtils]: 57: Hoare triple {7303#(<= ~counter~0 6)} assume true; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,576 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7303#(<= ~counter~0 6)} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {7303#(<= ~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; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7328#(<= |main_#t~post5| 6)} is VALID [2022-04-28 14:36:38,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {7328#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-28 14:36:38,577 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#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)); {7137#false} is VALID [2022-04-28 14:36:38,577 INFO L290 TraceCheckUtils]: 63: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-28 14:36:38,577 INFO L290 TraceCheckUtils]: 64: Hoare triple {7137#false} assume !(0 == ~cond); {7137#false} is VALID [2022-04-28 14:36:38,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {7137#false} assume true; {7137#false} is VALID [2022-04-28 14:36:38,577 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7137#false} {7137#false} #57#return; {7137#false} is VALID [2022-04-28 14:36:38,578 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-28 14:36:38,578 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-28 14:36:38,578 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-28 14:36:38,578 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-28 14:36:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:36:38,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:38,931 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-28 14:36:38,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-28 14:36:38,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-28 14:36:38,931 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-28 14:36:38,931 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7136#true} {7137#false} #57#return; {7137#false} is VALID [2022-04-28 14:36:38,931 INFO L290 TraceCheckUtils]: 65: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 14:36:38,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 14:36:38,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 14:36:38,932 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#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)); {7136#true} is VALID [2022-04-28 14:36:38,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {7386#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-28 14:36:38,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {7390#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7386#(< |main_#t~post5| 10)} is VALID [2022-04-28 14:36:38,933 INFO L290 TraceCheckUtils]: 59: Hoare triple {7390#(< ~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; {7390#(< ~counter~0 10)} is VALID [2022-04-28 14:36:38,933 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7136#true} {7390#(< ~counter~0 10)} #55#return; {7390#(< ~counter~0 10)} is VALID [2022-04-28 14:36:38,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 14:36:38,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 14:36:38,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 14:36:38,933 INFO L272 TraceCheckUtils]: 54: Hoare triple {7390#(< ~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)); {7136#true} is VALID [2022-04-28 14:36:38,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {7390#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-28 14:36:38,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {7415#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-28 14:36:38,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {7415#(< ~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; {7415#(< ~counter~0 9)} is VALID [2022-04-28 14:36:38,935 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7136#true} {7415#(< ~counter~0 9)} #55#return; {7415#(< ~counter~0 9)} is VALID [2022-04-28 14:36:38,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 14:36:38,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 14:36:38,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 14:36:38,935 INFO L272 TraceCheckUtils]: 46: Hoare triple {7415#(< ~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)); {7136#true} is VALID [2022-04-28 14:36:38,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {7415#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-28 14:36:38,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {7440#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-28 14:36:38,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {7440#(< ~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; {7440#(< ~counter~0 8)} is VALID [2022-04-28 14:36:38,936 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7136#true} {7440#(< ~counter~0 8)} #55#return; {7440#(< ~counter~0 8)} is VALID [2022-04-28 14:36:38,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 14:36:38,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 14:36:38,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 14:36:38,937 INFO L272 TraceCheckUtils]: 38: Hoare triple {7440#(< ~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)); {7136#true} is VALID [2022-04-28 14:36:38,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {7440#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-28 14:36:38,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-28 14:36:38,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {7303#(<= ~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; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,938 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7136#true} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 14:36:38,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 14:36:38,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 14:36:38,938 INFO L272 TraceCheckUtils]: 30: Hoare triple {7303#(<= ~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)); {7136#true} is VALID [2022-04-28 14:36:38,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:38,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {7278#(<= ~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; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,940 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7136#true} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 14:36:38,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 14:36:38,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 14:36:38,940 INFO L272 TraceCheckUtils]: 22: Hoare triple {7278#(<= ~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)); {7136#true} is VALID [2022-04-28 14:36:38,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:38,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {7253#(<= ~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; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,941 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7136#true} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 14:36:38,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 14:36:38,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 14:36:38,942 INFO L272 TraceCheckUtils]: 14: Hoare triple {7253#(<= ~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)); {7136#true} is VALID [2022-04-28 14:36:38,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:38,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {7228#(<= ~counter~0 3)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7136#true} {7228#(<= ~counter~0 3)} #53#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 14:36:38,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 14:36:38,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 14:36:38,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {7228#(<= ~counter~0 3)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7136#true} is VALID [2022-04-28 14:36:38,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {7228#(<= ~counter~0 3)} 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; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {7228#(<= ~counter~0 3)} call #t~ret6 := main(); {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#(<= ~counter~0 3)} {7136#true} #61#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#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; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:38,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-28 14:36:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:36:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:38,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417393978] [2022-04-28 14:36:38,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:38,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462407462] [2022-04-28 14:36:38,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462407462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:36:38,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:36:38,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 14:36:38,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:38,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181014785] [2022-04-28 14:36:38,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181014785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:38,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:38,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:36:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201510339] [2022-04-28 14:36:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:38,947 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-28 14:36:38,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:38,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:38,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:38,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:36:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:36:38,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:36:38,997 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:39,260 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-28 14:36:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:36:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-28 14:36:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 14:36:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 14:36:39,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-28 14:36:39,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:39,352 INFO L225 Difference]: With dead ends: 86 [2022-04-28 14:36:39,353 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:36:39,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:36:39,353 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:36:39,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:36:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:36:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:36:39,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:39,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:39,437 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:39,437 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:39,438 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 14:36:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:36:39,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:39,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:39,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-28 14:36:39,439 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-28 14:36:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:39,440 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 14:36:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:36:39,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:39,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:39,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:39,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-28 14:36:39,442 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-28 14:36:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:39,442 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-28 14:36:39,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:36:39,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-28 14:36:43,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:36:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 14:36:43,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:43,815 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:36:43,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 14:36:44,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:44,019 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-28 14:36:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:44,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888863537] [2022-04-28 14:36:44,108 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:44,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:44,108 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-28 14:36:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:44,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843954601] [2022-04-28 14:36:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:44,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:44,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083228495] [2022-04-28 14:36:44,119 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:36:44,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:44,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:44,121 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:36:44,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 14:36:49,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:36:49,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:49,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 14:36:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:49,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:50,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {8063#true} call ULTIMATE.init(); {8063#true} is VALID [2022-04-28 14:36:50,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {8063#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; {8063#true} is VALID [2022-04-28 14:36:50,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8063#true} {8063#true} #61#return; {8063#true} is VALID [2022-04-28 14:36:50,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {8063#true} call #t~ret6 := main(); {8063#true} is VALID [2022-04-28 14:36:50,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {8063#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; {8063#true} is VALID [2022-04-28 14:36:50,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {8063#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8063#true} is VALID [2022-04-28 14:36:50,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8063#true} {8063#true} #53#return; {8063#true} is VALID [2022-04-28 14:36:50,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {8063#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:50,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:50,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:50,098 INFO L272 TraceCheckUtils]: 14: Hoare triple {8101#(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)); {8063#true} is VALID [2022-04-28 14:36:50,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,099 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8063#true} {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:50,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {8101#(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; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:36:50,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:36:50,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:36:50,101 INFO L272 TraceCheckUtils]: 22: Hoare triple {8126#(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)); {8063#true} is VALID [2022-04-28 14:36:50,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,102 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8063#true} {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:36:50,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {8126#(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; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:50,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:50,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:50,104 INFO L272 TraceCheckUtils]: 30: Hoare triple {8151#(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)); {8063#true} is VALID [2022-04-28 14:36:50,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,105 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8063#true} {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 14:36:50,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {8151#(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; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:36:50,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:36:50,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:36:50,111 INFO L272 TraceCheckUtils]: 38: Hoare triple {8176#(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)); {8063#true} is VALID [2022-04-28 14:36:50,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,113 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8063#true} {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:36:50,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {8176#(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; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:36:50,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:36:50,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:36:50,146 INFO L272 TraceCheckUtils]: 46: Hoare triple {8201#(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)); {8063#true} is VALID [2022-04-28 14:36:50,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,148 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8063#true} {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:36:50,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {8201#(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; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 14:36:50,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 14:36:50,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 10);havoc #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 14:36:50,150 INFO L272 TraceCheckUtils]: 54: Hoare triple {8226#(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)); {8063#true} is VALID [2022-04-28 14:36:50,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,150 INFO L290 TraceCheckUtils]: 56: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,150 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8063#true} {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 14:36:50,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {8226#(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; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:36:50,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:36:50,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:36:50,152 INFO L272 TraceCheckUtils]: 62: Hoare triple {8251#(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)); {8063#true} is VALID [2022-04-28 14:36:50,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,153 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8063#true} {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:36:50,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 14:36:50,153 INFO L272 TraceCheckUtils]: 68: Hoare triple {8276#(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)); {8063#true} is VALID [2022-04-28 14:36:50,153 INFO L290 TraceCheckUtils]: 69: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 14:36:50,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 14:36:50,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 14:36:50,154 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8063#true} {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 14:36:50,155 INFO L272 TraceCheckUtils]: 73: Hoare triple {8276#(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)); {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:36:50,155 INFO L290 TraceCheckUtils]: 74: Hoare triple {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:36:50,155 INFO L290 TraceCheckUtils]: 75: Hoare triple {8299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8064#false} is VALID [2022-04-28 14:36:50,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {8064#false} assume !false; {8064#false} is VALID [2022-04-28 14:36:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 14:36:50,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:50,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:50,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843954601] [2022-04-28 14:36:50,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:50,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083228495] [2022-04-28 14:36:50,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083228495] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:36:50,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:36:50,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 14:36:50,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:50,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888863537] [2022-04-28 14:36:50,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888863537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:50,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:50,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:36:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005009062] [2022-04-28 14:36:50,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:50,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-28 14:36:50,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:50,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:36:50,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:50,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:36:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:50,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:36:50,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:36:50,929 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:36:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:51,726 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 14:36:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:36:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-28 14:36:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:36:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 14:36:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:36:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 14:36:51,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-28 14:36:51,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:51,782 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:36:51,782 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 14:36:51,783 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 14:36:51,783 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 14:36:51,783 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 14:36:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 14:36:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 14:36:51,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:51,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:36:51,882 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:36:51,882 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:36:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:51,883 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 14:36:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:36:51,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:51,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:51,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-28 14:36:51,884 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-28 14:36:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:51,885 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 14:36:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:36:51,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:51,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:51,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:51,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:36:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 14:36:51,887 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-28 14:36:51,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:51,887 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 14:36:51,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 14:36:51,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 14:36:56,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:36:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 14:36:56,245 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:56,245 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:36:56,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 14:36:56,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 14:36:56,448 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-28 14:36:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:56,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823693617] [2022-04-28 14:36:56,536 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:56,536 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-28 14:36:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:56,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891900323] [2022-04-28 14:36:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:56,549 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:56,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757526685] [2022-04-28 14:36:56,550 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:36:56,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:56,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:56,551 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:36:56,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 14:36:56,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 14:36:56,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:56,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 14:36:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:56,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:57,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-28 14:36:57,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#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; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8957#(<= ~counter~0 0)} {8949#true} #61#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {8957#(<= ~counter~0 0)} call #t~ret6 := main(); {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {8957#(<= ~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; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {8957#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {8957#(<= ~counter~0 0)} ~cond := #in~cond; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {8957#(<= ~counter~0 0)} assume !(0 == ~cond); {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8957#(<= ~counter~0 0)} {8957#(<= ~counter~0 0)} #53#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {8957#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:57,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:57,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {8991#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:57,102 INFO L272 TraceCheckUtils]: 14: Hoare triple {8991#(<= ~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)); {8991#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:57,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {8991#(<= ~counter~0 1)} ~cond := #in~cond; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:57,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {8991#(<= ~counter~0 1)} assume !(0 == ~cond); {8991#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:57,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {8991#(<= ~counter~0 1)} assume true; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:57,103 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8991#(<= ~counter~0 1)} {8991#(<= ~counter~0 1)} #55#return; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:57,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {8991#(<= ~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; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:57,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {8991#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {9016#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,104 INFO L272 TraceCheckUtils]: 22: Hoare triple {9016#(<= ~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)); {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {9016#(<= ~counter~0 2)} ~cond := #in~cond; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {9016#(<= ~counter~0 2)} assume !(0 == ~cond); {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,106 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9016#(<= ~counter~0 2)} {9016#(<= ~counter~0 2)} #55#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {9016#(<= ~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; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,107 INFO L272 TraceCheckUtils]: 30: Hoare triple {9041#(<= ~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)); {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {9041#(<= ~counter~0 3)} ~cond := #in~cond; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {9041#(<= ~counter~0 3)} assume !(0 == ~cond); {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {9041#(<= ~counter~0 3)} assume true; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,108 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9041#(<= ~counter~0 3)} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {9041#(<= ~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; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,109 INFO L272 TraceCheckUtils]: 38: Hoare triple {9066#(<= ~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)); {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {9066#(<= ~counter~0 4)} ~cond := #in~cond; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {9066#(<= ~counter~0 4)} assume !(0 == ~cond); {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {9066#(<= ~counter~0 4)} assume true; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,111 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9066#(<= ~counter~0 4)} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {9066#(<= ~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; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,112 INFO L272 TraceCheckUtils]: 46: Hoare triple {9091#(<= ~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)); {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {9091#(<= ~counter~0 5)} ~cond := #in~cond; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,113 INFO L290 TraceCheckUtils]: 48: Hoare triple {9091#(<= ~counter~0 5)} assume !(0 == ~cond); {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {9091#(<= ~counter~0 5)} assume true; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,113 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9091#(<= ~counter~0 5)} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {9091#(<= ~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; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,114 INFO L290 TraceCheckUtils]: 53: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,115 INFO L272 TraceCheckUtils]: 54: Hoare triple {9116#(<= ~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)); {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {9116#(<= ~counter~0 6)} ~cond := #in~cond; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {9116#(<= ~counter~0 6)} assume !(0 == ~cond); {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {9116#(<= ~counter~0 6)} assume true; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,116 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9116#(<= ~counter~0 6)} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {9116#(<= ~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; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,117 INFO L272 TraceCheckUtils]: 62: Hoare triple {9141#(<= ~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)); {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {9141#(<= ~counter~0 7)} ~cond := #in~cond; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {9141#(<= ~counter~0 7)} assume !(0 == ~cond); {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {9141#(<= ~counter~0 7)} assume true; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,118 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9141#(<= ~counter~0 7)} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {9141#(<= ~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; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9166#(<= |main_#t~post5| 7)} is VALID [2022-04-28 14:36:57,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {9166#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-28 14:36:57,119 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#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)); {8950#false} is VALID [2022-04-28 14:36:57,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-28 14:36:57,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {8950#false} assume !(0 == ~cond); {8950#false} is VALID [2022-04-28 14:36:57,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {8950#false} assume true; {8950#false} is VALID [2022-04-28 14:36:57,120 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8950#false} {8950#false} #57#return; {8950#false} is VALID [2022-04-28 14:36:57,120 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-28 14:36:57,120 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-28 14:36:57,120 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-28 14:36:57,120 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-28 14:36:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:36:57,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:57,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-28 14:36:57,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-28 14:36:57,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-28 14:36:57,466 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-28 14:36:57,466 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8949#true} {8950#false} #57#return; {8950#false} is VALID [2022-04-28 14:36:57,466 INFO L290 TraceCheckUtils]: 73: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,466 INFO L290 TraceCheckUtils]: 72: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,466 INFO L290 TraceCheckUtils]: 71: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,466 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#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)); {8949#true} is VALID [2022-04-28 14:36:57,466 INFO L290 TraceCheckUtils]: 69: Hoare triple {9224#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-28 14:36:57,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {9228#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9224#(< |main_#t~post5| 10)} is VALID [2022-04-28 14:36:57,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {9228#(< ~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; {9228#(< ~counter~0 10)} is VALID [2022-04-28 14:36:57,467 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8949#true} {9228#(< ~counter~0 10)} #55#return; {9228#(< ~counter~0 10)} is VALID [2022-04-28 14:36:57,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,468 INFO L272 TraceCheckUtils]: 62: Hoare triple {9228#(< ~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)); {8949#true} is VALID [2022-04-28 14:36:57,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {9228#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-28 14:36:57,469 INFO L290 TraceCheckUtils]: 60: Hoare triple {9253#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-28 14:36:57,469 INFO L290 TraceCheckUtils]: 59: Hoare triple {9253#(< ~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; {9253#(< ~counter~0 9)} is VALID [2022-04-28 14:36:57,469 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8949#true} {9253#(< ~counter~0 9)} #55#return; {9253#(< ~counter~0 9)} is VALID [2022-04-28 14:36:57,469 INFO L290 TraceCheckUtils]: 57: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,469 INFO L290 TraceCheckUtils]: 56: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,469 INFO L290 TraceCheckUtils]: 55: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,470 INFO L272 TraceCheckUtils]: 54: Hoare triple {9253#(< ~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)); {8949#true} is VALID [2022-04-28 14:36:57,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {9253#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-28 14:36:57,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-28 14:36:57,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {9141#(<= ~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; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,471 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8949#true} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,471 INFO L272 TraceCheckUtils]: 46: Hoare triple {9141#(<= ~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)); {8949#true} is VALID [2022-04-28 14:36:57,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:57,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {9116#(<= ~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; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,472 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8949#true} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,473 INFO L272 TraceCheckUtils]: 38: Hoare triple {9116#(<= ~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)); {8949#true} is VALID [2022-04-28 14:36:57,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:57,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {9091#(<= ~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; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,474 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8949#true} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,474 INFO L272 TraceCheckUtils]: 30: Hoare triple {9091#(<= ~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)); {8949#true} is VALID [2022-04-28 14:36:57,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:57,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {9066#(<= ~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; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,476 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8949#true} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,476 INFO L272 TraceCheckUtils]: 22: Hoare triple {9066#(<= ~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)); {8949#true} is VALID [2022-04-28 14:36:57,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:57,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {9041#(<= ~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; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,477 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8949#true} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,477 INFO L272 TraceCheckUtils]: 14: Hoare triple {9041#(<= ~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)); {8949#true} is VALID [2022-04-28 14:36:57,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:57,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {9016#(<= ~counter~0 2)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8949#true} {9016#(<= ~counter~0 2)} #53#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 14:36:57,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 14:36:57,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 14:36:57,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {9016#(<= ~counter~0 2)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8949#true} is VALID [2022-04-28 14:36:57,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {9016#(<= ~counter~0 2)} 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; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {9016#(<= ~counter~0 2)} call #t~ret6 := main(); {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9016#(<= ~counter~0 2)} {8949#true} #61#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#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; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:57,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-28 14:36:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 14:36:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:57,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891900323] [2022-04-28 14:36:57,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:57,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757526685] [2022-04-28 14:36:57,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757526685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:36:57,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:36:57,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 14:36:57,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:57,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823693617] [2022-04-28 14:36:57,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823693617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:57,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:57,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:36:57,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478454828] [2022-04-28 14:36:57,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-28 14:36:57,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:57,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:57,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:57,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:36:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:57,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:36:57,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:36:57,540 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:57,832 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-28 14:36:57,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:36:57,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-28 14:36:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 14:36:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 14:36:57,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-28 14:36:57,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:36:57,925 INFO L225 Difference]: With dead ends: 94 [2022-04-28 14:36:57,925 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 14:36:57,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:36:57,925 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:36:57,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:36:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 14:36:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 14:36:58,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:58,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:36:58,026 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:36:58,027 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:36:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:58,028 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 14:36:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:36:58,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:58,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:58,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 14:36:58,031 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 14:36:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:58,032 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 14:36:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:36:58,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:58,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:58,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:58,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:36:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-28 14:36:58,034 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-28 14:36:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:58,035 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-28 14:36:58,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:36:58,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-28 14:37:02,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 85 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:37:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 14:37:02,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:02,390 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:37:02,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 14:37:02,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 14:37:02,596 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-28 14:37:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:02,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318444525] [2022-04-28 14:37:02,691 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:02,691 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-28 14:37:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:02,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339463977] [2022-04-28 14:37:02,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:02,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:02,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:02,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112035271] [2022-04-28 14:37:02,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:37:02,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:02,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:02,706 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:37:02,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 14:37:03,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:37:03,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:03,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 14:37:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:03,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:04,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {9974#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; {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #61#return; {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret6 := main(); {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {9974#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; {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {9974#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,324 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9974#true} {9974#true} #53#return; {9974#true} is VALID [2022-04-28 14:37:04,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {9974#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:04,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:04,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:04,325 INFO L272 TraceCheckUtils]: 14: Hoare triple {10012#(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)); {9974#true} is VALID [2022-04-28 14:37:04,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,326 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9974#true} {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:04,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {10012#(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; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:37:04,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:37:04,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:37:04,327 INFO L272 TraceCheckUtils]: 22: Hoare triple {10037#(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)); {9974#true} is VALID [2022-04-28 14:37:04,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,329 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9974#true} {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:37:04,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {10037#(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; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:37:04,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:37:04,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:37:04,331 INFO L272 TraceCheckUtils]: 30: Hoare triple {10062#(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)); {9974#true} is VALID [2022-04-28 14:37:04,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,331 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9974#true} {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:37:04,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {10062#(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; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:37:04,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:37:04,332 INFO L290 TraceCheckUtils]: 37: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:37:04,332 INFO L272 TraceCheckUtils]: 38: Hoare triple {10087#(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)); {9974#true} is VALID [2022-04-28 14:37:04,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,333 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9974#true} {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:37:04,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {10087#(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; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 14:37:04,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 14:37:04,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 14:37:04,334 INFO L272 TraceCheckUtils]: 46: Hoare triple {10112#(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)); {9974#true} is VALID [2022-04-28 14:37:04,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,335 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9974#true} {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 14:37:04,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {10112#(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; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 14:37:04,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 14:37:04,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 14:37:04,336 INFO L272 TraceCheckUtils]: 54: Hoare triple {10137#(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)); {9974#true} is VALID [2022-04-28 14:37:04,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,336 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9974#true} {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 14:37:04,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {10137#(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; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 14:37:04,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 14:37:04,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 14:37:04,338 INFO L272 TraceCheckUtils]: 62: Hoare triple {10162#(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)); {9974#true} is VALID [2022-04-28 14:37:04,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,338 INFO L290 TraceCheckUtils]: 64: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,338 INFO L290 TraceCheckUtils]: 65: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,338 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9974#true} {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 14:37:04,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {10162#(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; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 14:37:04,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 14:37:04,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 14:37:04,340 INFO L272 TraceCheckUtils]: 70: Hoare triple {10187#(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)); {9974#true} is VALID [2022-04-28 14:37:04,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,340 INFO L290 TraceCheckUtils]: 73: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,340 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9974#true} {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 14:37:04,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 14:37:04,341 INFO L272 TraceCheckUtils]: 76: Hoare triple {10212#(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)); {9974#true} is VALID [2022-04-28 14:37:04,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 14:37:04,341 INFO L290 TraceCheckUtils]: 78: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 14:37:04,341 INFO L290 TraceCheckUtils]: 79: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 14:37:04,341 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9974#true} {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 14:37:04,342 INFO L272 TraceCheckUtils]: 81: Hoare triple {10212#(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)); {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:37:04,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:37:04,343 INFO L290 TraceCheckUtils]: 83: Hoare triple {10235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9975#false} is VALID [2022-04-28 14:37:04,343 INFO L290 TraceCheckUtils]: 84: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2022-04-28 14:37:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 14:37:04,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:04,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339463977] [2022-04-28 14:37:04,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:04,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112035271] [2022-04-28 14:37:04,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112035271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:37:04,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:37:04,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 14:37:04,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:04,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318444525] [2022-04-28 14:37:04,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318444525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:04,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:04,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:37:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442676241] [2022-04-28 14:37:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:04,622 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-28 14:37:04,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:04,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:37:04,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:04,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:37:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:37:04,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:37:04,667 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:37:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:05,602 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 14:37:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 14:37:05,602 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-28 14:37:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:37:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 14:37:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:37:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 14:37:05,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-28 14:37:05,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:05,685 INFO L225 Difference]: With dead ends: 92 [2022-04-28 14:37:05,685 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 14:37:05,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:37:05,686 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:05,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:37:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 14:37:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 14:37:05,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:05,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:05,789 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:05,790 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:05,792 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 14:37:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:37:05,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:05,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:05,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-28 14:37:05,793 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-28 14:37:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:05,794 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 14:37:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:37:05,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:05,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:05,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:05,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-28 14:37:05,796 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-28 14:37:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:05,797 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-28 14:37:05,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 14:37:05,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-28 14:37:10,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:37:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 14:37:10,310 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:10,310 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:37:10,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 14:37:10,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 14:37:10,517 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-28 14:37:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:10,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234000728] [2022-04-28 14:37:10,618 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:10,618 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-28 14:37:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:10,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153214576] [2022-04-28 14:37:10,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:10,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:10,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800287570] [2022-04-28 14:37:10,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:37:10,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:10,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:10,631 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:37:10,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 14:37:10,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:37:10,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:10,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:37:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:10,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:11,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-28 14:37:11,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#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; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10841#(<= ~counter~0 0)} {10833#true} #61#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {10841#(<= ~counter~0 0)} call #t~ret6 := main(); {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {10841#(<= ~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; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {10841#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {10841#(<= ~counter~0 0)} ~cond := #in~cond; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {10841#(<= ~counter~0 0)} assume !(0 == ~cond); {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10841#(<= ~counter~0 0)} {10841#(<= ~counter~0 0)} #53#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {10841#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:11,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {10841#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {10875#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,181 INFO L272 TraceCheckUtils]: 14: Hoare triple {10875#(<= ~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)); {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {10875#(<= ~counter~0 1)} ~cond := #in~cond; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {10875#(<= ~counter~0 1)} assume !(0 == ~cond); {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,183 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10875#(<= ~counter~0 1)} {10875#(<= ~counter~0 1)} #55#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {10875#(<= ~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; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,185 INFO L272 TraceCheckUtils]: 22: Hoare triple {10900#(<= ~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)); {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {10900#(<= ~counter~0 2)} ~cond := #in~cond; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {10900#(<= ~counter~0 2)} assume !(0 == ~cond); {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {10900#(<= ~counter~0 2)} assume true; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,186 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10900#(<= ~counter~0 2)} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {10900#(<= ~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; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,188 INFO L272 TraceCheckUtils]: 30: Hoare triple {10925#(<= ~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)); {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {10925#(<= ~counter~0 3)} ~cond := #in~cond; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {10925#(<= ~counter~0 3)} assume !(0 == ~cond); {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {10925#(<= ~counter~0 3)} assume true; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,189 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10925#(<= ~counter~0 3)} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {10925#(<= ~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; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,191 INFO L272 TraceCheckUtils]: 38: Hoare triple {10950#(<= ~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)); {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {10950#(<= ~counter~0 4)} ~cond := #in~cond; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {10950#(<= ~counter~0 4)} assume !(0 == ~cond); {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {10950#(<= ~counter~0 4)} assume true; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,192 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10950#(<= ~counter~0 4)} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,192 INFO L290 TraceCheckUtils]: 43: Hoare triple {10950#(<= ~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; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,193 INFO L290 TraceCheckUtils]: 45: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,193 INFO L272 TraceCheckUtils]: 46: Hoare triple {10975#(<= ~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)); {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {10975#(<= ~counter~0 5)} ~cond := #in~cond; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {10975#(<= ~counter~0 5)} assume !(0 == ~cond); {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {10975#(<= ~counter~0 5)} assume true; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,194 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10975#(<= ~counter~0 5)} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {10975#(<= ~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; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,196 INFO L272 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~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)); {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,196 INFO L290 TraceCheckUtils]: 55: Hoare triple {11000#(<= ~counter~0 6)} ~cond := #in~cond; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {11000#(<= ~counter~0 6)} assume !(0 == ~cond); {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 6)} assume true; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,197 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11000#(<= ~counter~0 6)} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~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; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,199 INFO L272 TraceCheckUtils]: 62: Hoare triple {11025#(<= ~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)); {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {11025#(<= ~counter~0 7)} ~cond := #in~cond; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,199 INFO L290 TraceCheckUtils]: 64: Hoare triple {11025#(<= ~counter~0 7)} assume !(0 == ~cond); {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {11025#(<= ~counter~0 7)} assume true; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,200 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11025#(<= ~counter~0 7)} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {11025#(<= ~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; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,201 INFO L272 TraceCheckUtils]: 70: Hoare triple {11050#(<= ~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)); {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,202 INFO L290 TraceCheckUtils]: 71: Hoare triple {11050#(<= ~counter~0 8)} ~cond := #in~cond; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {11050#(<= ~counter~0 8)} assume !(0 == ~cond); {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {11050#(<= ~counter~0 8)} assume true; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,203 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11050#(<= ~counter~0 8)} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {11050#(<= ~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; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,203 INFO L290 TraceCheckUtils]: 76: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11075#(<= |main_#t~post5| 8)} is VALID [2022-04-28 14:37:11,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {11075#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#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)); {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L290 TraceCheckUtils]: 79: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {10834#false} assume !(0 == ~cond); {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L290 TraceCheckUtils]: 81: Hoare triple {10834#false} assume true; {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10834#false} {10834#false} #57#return; {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-28 14:37:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:37:11,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:11,579 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-28 14:37:11,579 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-28 14:37:11,579 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-28 14:37:11,580 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-28 14:37:11,580 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10833#true} {10834#false} #57#return; {10834#false} is VALID [2022-04-28 14:37:11,580 INFO L290 TraceCheckUtils]: 81: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,580 INFO L290 TraceCheckUtils]: 80: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,580 INFO L290 TraceCheckUtils]: 79: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,580 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#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)); {10833#true} is VALID [2022-04-28 14:37:11,580 INFO L290 TraceCheckUtils]: 77: Hoare triple {11133#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-28 14:37:11,580 INFO L290 TraceCheckUtils]: 76: Hoare triple {11137#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11133#(< |main_#t~post5| 10)} is VALID [2022-04-28 14:37:11,581 INFO L290 TraceCheckUtils]: 75: Hoare triple {11137#(< ~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; {11137#(< ~counter~0 10)} is VALID [2022-04-28 14:37:11,581 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10833#true} {11137#(< ~counter~0 10)} #55#return; {11137#(< ~counter~0 10)} is VALID [2022-04-28 14:37:11,581 INFO L290 TraceCheckUtils]: 73: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,581 INFO L290 TraceCheckUtils]: 71: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,581 INFO L272 TraceCheckUtils]: 70: Hoare triple {11137#(< ~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)); {10833#true} is VALID [2022-04-28 14:37:11,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {11137#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-28 14:37:11,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-28 14:37:11,583 INFO L290 TraceCheckUtils]: 67: Hoare triple {11050#(<= ~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; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,583 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10833#true} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,583 INFO L272 TraceCheckUtils]: 62: Hoare triple {11050#(<= ~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)); {10833#true} is VALID [2022-04-28 14:37:11,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:11,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {11025#(<= ~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; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,593 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10833#true} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,594 INFO L272 TraceCheckUtils]: 54: Hoare triple {11025#(<= ~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)); {10833#true} is VALID [2022-04-28 14:37:11,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:11,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {11000#(<= ~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; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,596 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10833#true} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,596 INFO L272 TraceCheckUtils]: 46: Hoare triple {11000#(<= ~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)); {10833#true} is VALID [2022-04-28 14:37:11,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:11,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(<= ~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; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,598 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10833#true} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,598 INFO L272 TraceCheckUtils]: 38: Hoare triple {10975#(<= ~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)); {10833#true} is VALID [2022-04-28 14:37:11,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:11,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {10950#(<= ~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; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,600 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10833#true} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,601 INFO L272 TraceCheckUtils]: 30: Hoare triple {10950#(<= ~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)); {10833#true} is VALID [2022-04-28 14:37:11,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:11,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {10925#(<= ~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; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,602 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10833#true} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,603 INFO L272 TraceCheckUtils]: 22: Hoare triple {10925#(<= ~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)); {10833#true} is VALID [2022-04-28 14:37:11,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:11,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {10900#(<= ~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; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,605 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10833#true} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,605 INFO L272 TraceCheckUtils]: 14: Hoare triple {10900#(<= ~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)); {10833#true} is VALID [2022-04-28 14:37:11,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:11,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {10875#(<= ~counter~0 1)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10833#true} {10875#(<= ~counter~0 1)} #53#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 14:37:11,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 14:37:11,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 14:37:11,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {10875#(<= ~counter~0 1)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10833#true} is VALID [2022-04-28 14:37:11,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {10875#(<= ~counter~0 1)} 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; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {10875#(<= ~counter~0 1)} call #t~ret6 := main(); {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10875#(<= ~counter~0 1)} {10833#true} #61#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#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; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:11,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-28 14:37:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 14:37:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153214576] [2022-04-28 14:37:11,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800287570] [2022-04-28 14:37:11,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800287570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:37:11,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:37:11,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 14:37:11,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:11,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234000728] [2022-04-28 14:37:11,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234000728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:11,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:11,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:37:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562013477] [2022-04-28 14:37:11,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:11,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-28 14:37:11,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:11,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:37:11,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:11,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:37:11,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:11,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:37:11,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:37:11,675 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:37:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:12,051 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-28 14:37:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 14:37:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-28 14:37:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:37:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 14:37:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:37:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 14:37:12,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-28 14:37:12,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:12,151 INFO L225 Difference]: With dead ends: 102 [2022-04-28 14:37:12,151 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 14:37:12,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-28 14:37:12,152 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:12,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:37:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 14:37:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 14:37:12,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:12,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:12,292 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:12,292 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:12,294 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 14:37:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:37:12,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:12,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:12,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-28 14:37:12,294 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-28 14:37:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:12,296 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 14:37:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:37:12,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:12,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:12,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:12,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-28 14:37:12,298 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-28 14:37:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:12,298 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-28 14:37:12,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:37:12,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-28 14:37:16,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:37:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 14:37:16,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:16,775 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:37:16,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 14:37:16,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:16,975 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-28 14:37:16,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:16,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1430814815] [2022-04-28 14:37:17,080 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:17,080 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-28 14:37:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:17,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354502199] [2022-04-28 14:37:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:17,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:17,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317873396] [2022-04-28 14:37:17,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:37:17,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:17,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:17,094 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:37:17,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 14:37:17,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:37:17,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:17,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 14:37:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:17,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:17,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {11956#true} call ULTIMATE.init(); {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {11956#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; {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11956#true} {11956#true} #61#return; {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {11956#true} call #t~ret6 := main(); {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {11956#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; {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {11956#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11956#true} {11956#true} #53#return; {11956#true} is VALID [2022-04-28 14:37:17,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {11956#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:17,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:17,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:17,657 INFO L272 TraceCheckUtils]: 14: Hoare triple {11994#(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)); {11956#true} is VALID [2022-04-28 14:37:17,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,658 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11956#true} {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:17,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {11994#(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; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:37:17,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:37:17,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:37:17,659 INFO L272 TraceCheckUtils]: 22: Hoare triple {12019#(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)); {11956#true} is VALID [2022-04-28 14:37:17,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,659 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11956#true} {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:37:17,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {12019#(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; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:37:17,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:37:17,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:37:17,661 INFO L272 TraceCheckUtils]: 30: Hoare triple {12044#(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)); {11956#true} is VALID [2022-04-28 14:37:17,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,661 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11956#true} {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:37:17,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {12044#(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; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:37:17,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:37:17,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:37:17,662 INFO L272 TraceCheckUtils]: 38: Hoare triple {12069#(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)); {11956#true} is VALID [2022-04-28 14:37:17,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,663 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11956#true} {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:37:17,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {12069#(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; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:37:17,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:37:17,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:37:17,664 INFO L272 TraceCheckUtils]: 46: Hoare triple {12094#(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)); {11956#true} is VALID [2022-04-28 14:37:17,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,665 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11956#true} {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:37:17,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {12094#(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; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:17,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:17,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:17,666 INFO L272 TraceCheckUtils]: 54: Hoare triple {12119#(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)); {11956#true} is VALID [2022-04-28 14:37:17,666 INFO L290 TraceCheckUtils]: 55: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,666 INFO L290 TraceCheckUtils]: 56: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,667 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11956#true} {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:17,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {12119#(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; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:37:17,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:37:17,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:37:17,668 INFO L272 TraceCheckUtils]: 62: Hoare triple {12144#(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)); {11956#true} is VALID [2022-04-28 14:37:17,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,668 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11956#true} {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:37:17,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {12144#(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; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:17,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:17,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:17,669 INFO L272 TraceCheckUtils]: 70: Hoare triple {12169#(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)); {11956#true} is VALID [2022-04-28 14:37:17,669 INFO L290 TraceCheckUtils]: 71: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,670 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11956#true} {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:17,670 INFO L290 TraceCheckUtils]: 75: Hoare triple {12169#(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; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 14:37:17,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 14:37:17,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 14:37:17,671 INFO L272 TraceCheckUtils]: 78: Hoare triple {12194#(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)); {11956#true} is VALID [2022-04-28 14:37:17,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,671 INFO L290 TraceCheckUtils]: 80: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,671 INFO L290 TraceCheckUtils]: 81: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,672 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11956#true} {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 14:37:17,675 INFO L290 TraceCheckUtils]: 83: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 14:37:17,675 INFO L272 TraceCheckUtils]: 84: Hoare triple {12219#(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)); {11956#true} is VALID [2022-04-28 14:37:17,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 14:37:17,675 INFO L290 TraceCheckUtils]: 86: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 14:37:17,675 INFO L290 TraceCheckUtils]: 87: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 14:37:17,678 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11956#true} {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 14:37:17,679 INFO L272 TraceCheckUtils]: 89: Hoare triple {12219#(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)); {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:37:17,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:37:17,680 INFO L290 TraceCheckUtils]: 91: Hoare triple {12242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11957#false} is VALID [2022-04-28 14:37:17,680 INFO L290 TraceCheckUtils]: 92: Hoare triple {11957#false} assume !false; {11957#false} is VALID [2022-04-28 14:37:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:37:17,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:17,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:17,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354502199] [2022-04-28 14:37:17,955 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:17,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317873396] [2022-04-28 14:37:17,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317873396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:37:17,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:37:17,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 14:37:17,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:17,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1430814815] [2022-04-28 14:37:17,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1430814815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:17,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:17,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:37:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173666502] [2022-04-28 14:37:17,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:17,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-28 14:37:17,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:17,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:37:18,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:18,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:37:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:18,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:37:18,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:37:18,006 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:37:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:19,043 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-28 14:37:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:37:19,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-28 14:37:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:37:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 14:37:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:37:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 14:37:19,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-28 14:37:19,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:19,118 INFO L225 Difference]: With dead ends: 100 [2022-04-28 14:37:19,118 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 14:37:19,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:37:19,119 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:19,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 493 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:37:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 14:37:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 14:37:19,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:19,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:37:19,236 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:37:19,236 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:37:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:19,238 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 14:37:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:37:19,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:19,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:19,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-28 14:37:19,239 INFO L87 Difference]: Start difference. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-28 14:37:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:19,240 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 14:37:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:37:19,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:19,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:19,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:19,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:37:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-28 14:37:19,243 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-28 14:37:19,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:19,243 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-28 14:37:19,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 14:37:19,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-28 14:37:23,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:37:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 14:37:23,703 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:23,703 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:37:23,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 14:37:23,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:23,904 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-28 14:37:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:23,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76092463] [2022-04-28 14:37:24,004 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:24,005 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-28 14:37:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:24,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162538277] [2022-04-28 14:37:24,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:24,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:24,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:24,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189968869] [2022-04-28 14:37:24,032 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:37:24,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:24,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:24,034 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:37:24,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 14:37:24,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:37:24,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:24,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 14:37:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:24,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:24,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-28 14:37:24,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#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; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~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; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {12896#(<= ~counter~0 0)} ~cond := #in~cond; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {12896#(<= ~counter~0 0)} assume !(0 == ~cond); {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12896#(<= ~counter~0 0)} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:24,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:24,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:24,589 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~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)); {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:24,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {12930#(<= ~counter~0 1)} ~cond := #in~cond; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:24,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {12930#(<= ~counter~0 1)} assume !(0 == ~cond); {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:24,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {12930#(<= ~counter~0 1)} assume true; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:24,590 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12930#(<= ~counter~0 1)} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:24,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~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; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:24,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:24,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:24,591 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~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)); {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:24,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {12955#(<= ~counter~0 2)} ~cond := #in~cond; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:24,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {12955#(<= ~counter~0 2)} assume !(0 == ~cond); {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:24,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {12955#(<= ~counter~0 2)} assume true; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:24,592 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12955#(<= ~counter~0 2)} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:24,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~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; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:24,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:24,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:24,594 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~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)); {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:24,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {12980#(<= ~counter~0 3)} ~cond := #in~cond; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:24,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {12980#(<= ~counter~0 3)} assume !(0 == ~cond); {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:24,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {12980#(<= ~counter~0 3)} assume true; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:24,595 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12980#(<= ~counter~0 3)} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:24,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~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; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:24,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:24,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:24,597 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~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)); {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:24,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {13005#(<= ~counter~0 4)} ~cond := #in~cond; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:24,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {13005#(<= ~counter~0 4)} assume !(0 == ~cond); {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:24,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {13005#(<= ~counter~0 4)} assume true; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:24,598 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13005#(<= ~counter~0 4)} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:24,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~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; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:24,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:24,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:24,599 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~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)); {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:24,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {13030#(<= ~counter~0 5)} ~cond := #in~cond; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:24,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {13030#(<= ~counter~0 5)} assume !(0 == ~cond); {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:24,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {13030#(<= ~counter~0 5)} assume true; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:24,600 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13030#(<= ~counter~0 5)} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:24,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~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; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:24,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:24,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:24,602 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~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)); {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:24,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {13055#(<= ~counter~0 6)} ~cond := #in~cond; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:24,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {13055#(<= ~counter~0 6)} assume !(0 == ~cond); {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:24,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {13055#(<= ~counter~0 6)} assume true; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:24,603 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13055#(<= ~counter~0 6)} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:24,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~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; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:24,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:24,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:24,605 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~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)); {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:24,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {13080#(<= ~counter~0 7)} ~cond := #in~cond; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:24,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {13080#(<= ~counter~0 7)} assume !(0 == ~cond); {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:24,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {13080#(<= ~counter~0 7)} assume true; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:24,606 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13080#(<= ~counter~0 7)} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:24,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~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; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:24,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:24,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:24,607 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~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)); {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:24,607 INFO L290 TraceCheckUtils]: 71: Hoare triple {13105#(<= ~counter~0 8)} ~cond := #in~cond; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:24,608 INFO L290 TraceCheckUtils]: 72: Hoare triple {13105#(<= ~counter~0 8)} assume !(0 == ~cond); {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:24,608 INFO L290 TraceCheckUtils]: 73: Hoare triple {13105#(<= ~counter~0 8)} assume true; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:24,608 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13105#(<= ~counter~0 8)} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:24,609 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~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; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:24,609 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,610 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,610 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~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)); {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,610 INFO L290 TraceCheckUtils]: 79: Hoare triple {13130#(<= ~counter~0 9)} ~cond := #in~cond; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,610 INFO L290 TraceCheckUtils]: 80: Hoare triple {13130#(<= ~counter~0 9)} assume !(0 == ~cond); {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,611 INFO L290 TraceCheckUtils]: 81: Hoare triple {13130#(<= ~counter~0 9)} assume true; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,611 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13130#(<= ~counter~0 9)} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,611 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~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; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,612 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-28 14:37:24,612 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-28 14:37:24,612 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#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)); {12889#false} is VALID [2022-04-28 14:37:24,612 INFO L290 TraceCheckUtils]: 87: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-28 14:37:24,612 INFO L290 TraceCheckUtils]: 88: Hoare triple {12889#false} assume !(0 == ~cond); {12889#false} is VALID [2022-04-28 14:37:24,612 INFO L290 TraceCheckUtils]: 89: Hoare triple {12889#false} assume true; {12889#false} is VALID [2022-04-28 14:37:24,612 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12889#false} {12889#false} #57#return; {12889#false} is VALID [2022-04-28 14:37:24,612 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-28 14:37:24,612 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-28 14:37:24,612 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-28 14:37:24,613 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-28 14:37:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:37:24,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:25,028 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-28 14:37:25,028 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-28 14:37:25,028 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-28 14:37:25,028 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-28 14:37:25,028 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12888#true} {12889#false} #57#return; {12889#false} is VALID [2022-04-28 14:37:25,028 INFO L290 TraceCheckUtils]: 89: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,028 INFO L290 TraceCheckUtils]: 88: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,028 INFO L290 TraceCheckUtils]: 87: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,028 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#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)); {12888#true} is VALID [2022-04-28 14:37:25,029 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-28 14:37:25,029 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-28 14:37:25,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~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; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:25,030 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12888#true} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:25,030 INFO L290 TraceCheckUtils]: 81: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,030 INFO L290 TraceCheckUtils]: 80: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,030 INFO L290 TraceCheckUtils]: 79: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,030 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,030 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:25,031 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:25,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~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; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:25,032 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12888#true} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:25,032 INFO L290 TraceCheckUtils]: 73: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,032 INFO L290 TraceCheckUtils]: 72: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,032 INFO L290 TraceCheckUtils]: 71: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,032 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,032 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:25,033 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:25,033 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~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; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:25,033 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12888#true} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:25,033 INFO L290 TraceCheckUtils]: 65: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,033 INFO L290 TraceCheckUtils]: 64: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,034 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,034 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:25,034 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:25,035 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~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; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:25,035 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12888#true} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:25,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,035 INFO L290 TraceCheckUtils]: 56: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,035 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:25,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:25,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~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; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:25,037 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12888#true} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:25,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,037 INFO L290 TraceCheckUtils]: 48: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,037 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:25,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:25,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~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; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:25,038 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12888#true} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:25,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,038 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:25,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:25,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~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; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:25,040 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12888#true} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:25,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,040 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:25,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:25,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~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; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:25,042 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12888#true} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:25,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,042 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:25,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:25,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~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; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:25,043 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12888#true} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:25,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,044 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~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)); {12888#true} is VALID [2022-04-28 14:37:25,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:25,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:25,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:25,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12888#true} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:25,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 14:37:25,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 14:37:25,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 14:37:25,045 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12888#true} is VALID [2022-04-28 14:37:25,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~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; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:25,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:25,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:25,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:25,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#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; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:25,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-28 14:37:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 20 proven. 162 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:37:25,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:25,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162538277] [2022-04-28 14:37:25,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:25,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189968869] [2022-04-28 14:37:25,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189968869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:37:25,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:37:25,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 14:37:25,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:25,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76092463] [2022-04-28 14:37:25,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76092463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:25,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:25,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:37:25,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116112732] [2022-04-28 14:37:25,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:25,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-28 14:37:25,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:25,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:25,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:25,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:37:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:25,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:37:25,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:37:25,138 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:25,573 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-28 14:37:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 14:37:25,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-28 14:37:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 14:37:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 14:37:25,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-28 14:37:25,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:25,682 INFO L225 Difference]: With dead ends: 110 [2022-04-28 14:37:25,682 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 14:37:25,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2022-04-28 14:37:25,683 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:25,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 126 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:37:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 14:37:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 14:37:25,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:25,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:37:25,838 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:37:25,838 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:37:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:25,840 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 14:37:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:37:25,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:25,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:25,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-28 14:37:25,841 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-28 14:37:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:25,842 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 14:37:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:37:25,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:25,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:25,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:25,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:37:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-28 14:37:25,844 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-28 14:37:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:25,845 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-28 14:37:25,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:37:25,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-28 14:37:30,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 101 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:37:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:37:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 14:37:30,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:30,333 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:37:30,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 14:37:30,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 14:37:30,535 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-28 14:37:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:30,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619915455] [2022-04-28 14:37:30,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:30,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-28 14:37:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:30,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246838320] [2022-04-28 14:37:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:30,638 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:30,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298266838] [2022-04-28 14:37:30,639 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:37:30,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:30,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:30,640 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:37:30,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 14:39:50,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 14:39:50,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:50,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 14:39:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:50,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:51,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {14108#true} call ULTIMATE.init(); {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {14108#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; {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14108#true} {14108#true} #61#return; {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {14108#true} call #t~ret6 := main(); {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {14108#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; {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {14108#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14108#true} {14108#true} #53#return; {14108#true} is VALID [2022-04-28 14:39:51,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {14108#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:39:51,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:39:51,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:39:51,495 INFO L272 TraceCheckUtils]: 14: Hoare triple {14146#(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)); {14108#true} is VALID [2022-04-28 14:39:51,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,496 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14108#true} {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:39:51,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {14146#(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; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:39:51,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:39:51,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:39:51,497 INFO L272 TraceCheckUtils]: 22: Hoare triple {14171#(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)); {14108#true} is VALID [2022-04-28 14:39:51,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,498 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14108#true} {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:39:51,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {14171#(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; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 14:39:51,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 14:39:51,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 14:39:51,499 INFO L272 TraceCheckUtils]: 30: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~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)); {14108#true} is VALID [2022-04-28 14:39:51,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,508 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14108#true} {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 14:39:51,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~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; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 14:39:51,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 14:39:51,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 14:39:51,510 INFO L272 TraceCheckUtils]: 38: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~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)); {14108#true} is VALID [2022-04-28 14:39:51,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,511 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14108#true} {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #55#return; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 14:39:51,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~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; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:39:51,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:39:51,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:39:51,513 INFO L272 TraceCheckUtils]: 46: Hoare triple {14246#(and (< 1 main_~k~0) (= 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)); {14108#true} is VALID [2022-04-28 14:39:51,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,514 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14108#true} {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:39:51,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {14246#(and (< 1 main_~k~0) (= 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; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:39:51,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:39:51,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:39:51,516 INFO L272 TraceCheckUtils]: 54: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 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)); {14108#true} is VALID [2022-04-28 14:39:51,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,516 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14108#true} {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:39:51,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 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; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:39:51,517 INFO L290 TraceCheckUtils]: 60: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:39:51,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:39:51,517 INFO L272 TraceCheckUtils]: 62: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 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)); {14108#true} is VALID [2022-04-28 14:39:51,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,518 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14108#true} {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:39:51,519 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 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; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:39:51,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:39:51,519 INFO L290 TraceCheckUtils]: 69: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:39:51,519 INFO L272 TraceCheckUtils]: 70: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ 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)); {14108#true} is VALID [2022-04-28 14:39:51,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,520 INFO L290 TraceCheckUtils]: 72: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,520 INFO L290 TraceCheckUtils]: 73: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,520 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14108#true} {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:39:51,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ 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; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:39:51,521 INFO L290 TraceCheckUtils]: 76: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:39:51,521 INFO L290 TraceCheckUtils]: 77: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:39:51,521 INFO L272 TraceCheckUtils]: 78: Hoare triple {14346#(and (< 1 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)); {14108#true} is VALID [2022-04-28 14:39:51,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,522 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14108#true} {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:39:51,522 INFO L290 TraceCheckUtils]: 83: Hoare triple {14346#(and (< 1 main_~k~0) (= 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; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:39:51,523 INFO L290 TraceCheckUtils]: 84: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:39:51,523 INFO L290 TraceCheckUtils]: 85: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 10);havoc #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:39:51,523 INFO L272 TraceCheckUtils]: 86: Hoare triple {14371#(and (= main_~y~0 9) (< 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)); {14108#true} is VALID [2022-04-28 14:39:51,523 INFO L290 TraceCheckUtils]: 87: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,523 INFO L290 TraceCheckUtils]: 89: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,524 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14108#true} {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:39:51,524 INFO L290 TraceCheckUtils]: 91: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 14:39:51,525 INFO L272 TraceCheckUtils]: 92: Hoare triple {14396#(and (= main_~y~0 9) (<= 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)); {14108#true} is VALID [2022-04-28 14:39:51,525 INFO L290 TraceCheckUtils]: 93: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 14:39:51,525 INFO L290 TraceCheckUtils]: 94: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 14:39:51,525 INFO L290 TraceCheckUtils]: 95: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 14:39:51,525 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14108#true} {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 14:39:51,526 INFO L272 TraceCheckUtils]: 97: Hoare triple {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:51,526 INFO L290 TraceCheckUtils]: 98: Hoare triple {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:51,526 INFO L290 TraceCheckUtils]: 99: Hoare triple {14419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14109#false} is VALID [2022-04-28 14:39:51,526 INFO L290 TraceCheckUtils]: 100: Hoare triple {14109#false} assume !false; {14109#false} is VALID [2022-04-28 14:39:51,527 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 14:39:51,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:39:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:52,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246838320] [2022-04-28 14:39:52,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:52,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298266838] [2022-04-28 14:39:52,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298266838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:39:52,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:39:52,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 14:39:52,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:52,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1619915455] [2022-04-28 14:39:52,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1619915455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:52,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:52,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:39:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635371428] [2022-04-28 14:39:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:52,461 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 14:39:52,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:52,461 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 14:39:52,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:52,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:39:52,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:39:52,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-04-28 14:39:52,535 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 14:39:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:53,992 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-28 14:39:53,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 14:39:53,992 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 14:39:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:53,992 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 14:39:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 14:39:53,993 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 14:39:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 14:39:53,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-28 14:39:54,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:54,087 INFO L225 Difference]: With dead ends: 108 [2022-04-28 14:39:54,087 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 14:39:54,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:39:54,088 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:54,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 552 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:39:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 14:39:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-28 14:39:54,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:54,264 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 14:39:54,264 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 14:39:54,264 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 14:39:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:54,267 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 14:39:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 14:39:54,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:54,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:54,267 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 14:39:54,268 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 14:39:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:54,269 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 14:39:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 14:39:54,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:54,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:54,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:54,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:54,270 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 14:39:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-28 14:39:54,274 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-28 14:39:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:54,274 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-28 14:39:54,274 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 14:39:54,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-28 14:39:58,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 104 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 14:39:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 14:39:58,888 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:58,888 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 14:39:58,931 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 14:39:59,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 14:39:59,089 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-28 14:39:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:59,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406175985] [2022-04-28 14:39:59,186 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:39:59,186 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:39:59,186 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-28 14:39:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:59,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793297502] [2022-04-28 14:39:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:59,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:59,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872627385] [2022-04-28 14:39:59,199 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:39:59,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:59,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:59,200 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:59,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 14:39:59,873 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-28 14:39:59,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 14:39:59,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.