/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:31:29,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:31:29,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:31:29,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:31:29,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:31:29,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:31:29,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:31:29,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:31:29,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:31:29,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:31:29,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:31:29,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:31:29,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:31:29,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:31:29,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:31:29,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:31:29,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:31:29,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:31:29,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:31:29,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:31:29,722 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:31:29,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:31:29,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:31:29,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:31:29,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:31:29,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:31:29,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:31:29,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:31:29,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:31:29,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:31:29,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:31:29,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:31:29,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:31:29,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:31:29,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:31:29,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:31:29,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:31:29,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:31:29,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:31:29,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:31:29,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:31:29,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:31:29,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:31:29,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:31:29,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:31:29,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:31:29,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:31:29,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:31:29,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:31:29,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:31:29,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:31:29,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:31:29,755 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:31:29,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:31:29,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:31:29,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:31:29,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:31:29,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:31:29,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:31:29,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:31:29,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:31:29,757 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:31:29,757 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:31:29,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:31:29,757 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:31:29,757 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:31:29,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:31:30,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:31:30,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:31:30,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:31:30,009 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:31:30,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound100.c [2022-04-08 14:31:30,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04f90378c/61a26eecabb74f2f8dcdc1519c746908/FLAG24ae03061 [2022-04-08 14:31:30,462 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:31:30,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound100.c [2022-04-08 14:31:30,470 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04f90378c/61a26eecabb74f2f8dcdc1519c746908/FLAG24ae03061 [2022-04-08 14:31:30,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04f90378c/61a26eecabb74f2f8dcdc1519c746908 [2022-04-08 14:31:30,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:31:30,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:31:30,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:31:30,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:31:30,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:31:30,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdb6006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30, skipping insertion in model container [2022-04-08 14:31:30,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:31:30,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:31:30,689 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_unwindbound100.c[458,471] [2022-04-08 14:31:30,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:31:30,728 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:31:30,742 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_unwindbound100.c[458,471] [2022-04-08 14:31:30,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:31:30,779 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:31:30,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30 WrapperNode [2022-04-08 14:31:30,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:31:30,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:31:30,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:31:30,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:31:30,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:31:30,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:31:30,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:31:30,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:31:30,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (1/1) ... [2022-04-08 14:31:30,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:31:30,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:30,859 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-08 14:31:30,881 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-08 14:31:30,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:31:30,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:31:30,901 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:31:30,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:31:30,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:31:30,902 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:31:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:31:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:31:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:31:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:31:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:31:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:31:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:31:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:31:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:31:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:31:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:31:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:31:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:31:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:31:30,969 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:31:30,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:31:31,127 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:31:31,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:31:31,133 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:31:31,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:31:31 BoogieIcfgContainer [2022-04-08 14:31:31,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:31:31,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:31:31,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:31:31,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:31:31,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:31:30" (1/3) ... [2022-04-08 14:31:31,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a1e22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:31:31, skipping insertion in model container [2022-04-08 14:31:31,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:30" (2/3) ... [2022-04-08 14:31:31,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a1e22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:31:31, skipping insertion in model container [2022-04-08 14:31:31,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:31:31" (3/3) ... [2022-04-08 14:31:31,168 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound100.c [2022-04-08 14:31:31,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:31:31,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:31:31,230 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:31:31,252 INFO L340 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 [2022-04-08 14:31:31,252 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:31:31,271 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-08 14:31:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:31:31,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:31,278 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:31,278 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:31,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-08 14:31:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1243907000] [2022-04-08 14:31:31,306 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-08 14:31:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:31,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958263414] [2022-04-08 14:31:31,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:31,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:31,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:31:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:31,523 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-08 14:31:31,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:31:31,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 14:31:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:31:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:31,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:31:31,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:31:31,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:31:31,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:31:31,538 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-08 14:31:31,538 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-08 14:31:31,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:31:31,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 14:31:31,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 14:31:31,540 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-08 14:31:31,540 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-08 14:31:31,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:31:31,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:31:31,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:31:31,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:31:31,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 14:31:31,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 14:31:31,544 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-08 14:31:31,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 14:31:31,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 14:31:31,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:31:31,545 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-08 14:31:31,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:31,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958263414] [2022-04-08 14:31:31,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958263414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:31,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:31,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:31:31,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:31,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1243907000] [2022-04-08 14:31:31,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1243907000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:31,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:31,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:31:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336016715] [2022-04-08 14:31:31,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:31,559 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-08 14:31:31,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:31,563 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-08 14:31:31,593 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-08 14:31:31,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:31:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:31:31,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:31:31,616 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-08 14:31:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:31,997 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-08 14:31:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:31:31,997 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-08 14:31:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:31,999 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-08 14:31:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 14:31:32,006 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-08 14:31:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 14:31:32,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-08 14:31:32,087 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-08 14:31:32,095 INFO L225 Difference]: With dead ends: 50 [2022-04-08 14:31:32,095 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 14:31:32,097 INFO L912 BasicCegarLoop]: 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-08 14:31:32,100 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:32,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:31:32,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 14:31:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 14:31:32,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:32,126 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-08 14:31:32,127 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-08 14:31:32,127 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-08 14:31:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:32,131 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 14:31:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:31:32,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:32,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:32,133 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-08 14:31:32,133 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-08 14:31:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:32,136 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 14:31:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:31:32,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:32,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:32,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:32,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:32,138 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-08 14:31:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 14:31:32,141 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-08 14:31:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:32,141 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 14:31:32,142 INFO L479 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-08 14:31:32,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 14:31:32,169 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-08 14:31:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:31:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:31:32,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:32,170 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:32,170 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:31:32,170 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-08 14:31:32,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:32,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158690629] [2022-04-08 14:31:32,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-08 14:31:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:32,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050227792] [2022-04-08 14:31:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:32,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:32,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322491851] [2022-04-08 14:31:32,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:32,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:32,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:32,192 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-08 14:31:32,235 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-08 14:31:32,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:31:32,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:32,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 14:31:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:32,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:32,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-08 14:31:32,415 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-08 14:31:32,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:32,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:32,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:32,417 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-08 14:31:32,418 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-08 14:31:32,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:32,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:32,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:32,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:32,420 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-08 14:31:32,421 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-08 14:31:32,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {243#false} is VALID [2022-04-08 14:31:32,422 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-08 14:31:32,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-08 14:31:32,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-08 14:31:32,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-08 14:31:32,423 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-08 14:31:32,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:31:32,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:32,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050227792] [2022-04-08 14:31:32,424 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:32,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322491851] [2022-04-08 14:31:32,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322491851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:32,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:32,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:31:32,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:32,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158690629] [2022-04-08 14:31:32,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158690629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:32,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:32,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:31:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245478492] [2022-04-08 14:31:32,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:32,427 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-08 14:31:32,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:32,427 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-08 14:31:32,442 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-08 14:31:32,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:31:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:31:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:31:32,444 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-08 14:31:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:32,511 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 14:31:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:31:32,512 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-08 14:31:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:32,512 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-08 14:31:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 14:31:32,515 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-08 14:31:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 14:31:32,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 14:31:32,548 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-08 14:31:32,550 INFO L225 Difference]: With dead ends: 34 [2022-04-08 14:31:32,550 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:31:32,550 INFO L912 BasicCegarLoop]: 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-08 14:31:32,552 INFO L913 BasicCegarLoop]: 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-08 14:31:32,552 INFO L914 BasicCegarLoop]: 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-08 14:31:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:31:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 14:31:32,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:32,565 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-08 14:31:32,565 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-08 14:31:32,565 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-08 14:31:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:32,567 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:31:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:31:32,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:32,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:32,568 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-08 14:31:32,568 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-08 14:31:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:32,570 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:31:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:31:32,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:32,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:32,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:32,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:32,571 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-08 14:31:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 14:31:32,573 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-08 14:31:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:32,573 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 14:31:32,573 INFO L479 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-08 14:31:32,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 14:31:32,602 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-08 14:31:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:31:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:31:32,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:32,603 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:32,627 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-08 14:31:32,816 WARN L460 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-08 14:31:32,817 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-08 14:31:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:32,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381465916] [2022-04-08 14:31:32,818 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-08 14:31:32,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:32,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581127111] [2022-04-08 14:31:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:32,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:32,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188443014] [2022-04-08 14:31:32,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:32,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:32,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:32,845 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-08 14:31:32,875 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-08 14:31:32,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:31:32,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:32,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:31:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:32,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:33,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-08 14:31:33,007 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-08 14:31:33,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 14:31:33,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-08 14:31:33,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-08 14:31:33,008 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-08 14:31:33,008 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-08 14:31:33,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-08 14:31:33,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-08 14:31:33,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 14:31:33,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-08 14:31:33,010 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-08 14:31:33,010 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-08 14:31:33,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:33,012 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-08 14:31:33,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:33,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-08 14:31:33,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-08 14:31:33,014 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-08 14:31:33,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:31:33,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:33,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581127111] [2022-04-08 14:31:33,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:33,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188443014] [2022-04-08 14:31:33,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188443014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:33,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:33,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:31:33,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:33,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381465916] [2022-04-08 14:31:33,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381465916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:33,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:33,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:31:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215412947] [2022-04-08 14:31:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:33,017 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-08 14:31:33,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:33,017 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-08 14:31:33,032 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-08 14:31:33,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:31:33,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:33,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:31:33,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:31:33,034 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-08 14:31:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:33,211 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 14:31:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:31:33,211 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-08 14:31:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:33,212 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-08 14:31:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:31:33,214 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-08 14:31:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:31:33,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 14:31:33,255 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-08 14:31:33,256 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:31:33,256 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 14:31:33,257 INFO L912 BasicCegarLoop]: 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-08 14:31:33,258 INFO L913 BasicCegarLoop]: 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-08 14:31:33,258 INFO L914 BasicCegarLoop]: 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-08 14:31:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 14:31:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 14:31:33,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:33,277 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-08 14:31:33,277 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-08 14:31:33,277 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-08 14:31:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:33,279 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 14:31:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:31:33,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:33,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:33,280 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-08 14:31:33,281 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-08 14:31:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:33,283 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 14:31:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:31:33,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:33,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:33,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:33,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:33,284 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-08 14:31:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 14:31:33,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 14:31:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:33,286 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 14:31:33,286 INFO L479 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-08 14:31:33,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 14:31:33,320 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-08 14:31:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:31:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:31:33,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:33,322 INFO L499 BasicCegarLoop]: 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-08 14:31:33,348 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-08 14:31:33,544 WARN L460 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-08 14:31:33,545 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-08 14:31:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:33,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1968955411] [2022-04-08 14:31:33,746 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:33,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:33,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-08 14:31:33,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:33,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226072898] [2022-04-08 14:31:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:33,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:33,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815253306] [2022-04-08 14:31:33,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:33,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:33,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:33,768 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-08 14:31:33,810 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-08 14:31:33,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:33,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:33,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:31:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:34,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:34,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 14:31:34,172 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-08 14:31:34,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:34,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:34,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:34,174 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-08 14:31:34,174 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-08 14:31:34,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:34,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:34,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:34,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:34,177 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-08 14:31:34,178 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-08 14:31:34,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:34,179 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-08 14:31:34,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:34,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:34,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:34,181 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:34,181 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-08 14:31:34,182 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-08 14:31:34,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {732#false} is VALID [2022-04-08 14:31:34,182 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-08 14:31:34,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 14:31:34,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 14:31:34,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 14:31:34,183 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-08 14:31:34,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:34,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 14:31:34,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 14:31:34,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 14:31:34,362 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-08 14:31:34,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {732#false} is VALID [2022-04-08 14:31:34,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:31:34,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-08 14:31:34,364 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 100)} #55#return; {830#(< ~counter~0 100)} is VALID [2022-04-08 14:31:34,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 14:31:34,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 14:31:34,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 14:31:34,365 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:34,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {830#(< ~counter~0 100)} is VALID [2022-04-08 14:31:34,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 100)} is VALID [2022-04-08 14:31:34,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 99)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 99)} is VALID [2022-04-08 14:31:34,367 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 99)} #53#return; {855#(< ~counter~0 99)} is VALID [2022-04-08 14:31:34,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 14:31:34,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 14:31:34,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 14:31:34,368 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 99)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-08 14:31:34,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 99)} 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 99)} is VALID [2022-04-08 14:31:34,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 99)} call #t~ret6 := main(); {855#(< ~counter~0 99)} is VALID [2022-04-08 14:31:34,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 99)} {731#true} #61#return; {855#(< ~counter~0 99)} is VALID [2022-04-08 14:31:34,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 99)} assume true; {855#(< ~counter~0 99)} is VALID [2022-04-08 14:31:34,372 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 99)} is VALID [2022-04-08 14:31:34,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 14:31:34,372 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-08 14:31:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:34,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226072898] [2022-04-08 14:31:34,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:34,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815253306] [2022-04-08 14:31:34,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815253306] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:31:34,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:31:34,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:31:34,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:34,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1968955411] [2022-04-08 14:31:34,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1968955411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:34,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:34,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:31:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046975610] [2022-04-08 14:31:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:34,375 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-08 14:31:34,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:34,375 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-08 14:31:34,395 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-08 14:31:34,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:31:34,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:34,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:31:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:31:34,396 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-08 14:31:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:34,508 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:31:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:31:34,508 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-08 14:31:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:34,509 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-08 14:31:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 14:31:34,511 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-08 14:31:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 14:31:34,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-08 14:31:34,552 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-08 14:31:34,554 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:31:34,554 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 14:31:34,555 INFO L912 BasicCegarLoop]: 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-08 14:31:34,555 INFO L913 BasicCegarLoop]: 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-08 14:31:34,556 INFO L914 BasicCegarLoop]: 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-08 14:31:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 14:31:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 14:31:34,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:34,574 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-08 14:31:34,574 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-08 14:31:34,575 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-08 14:31:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:34,576 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:31:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:31:34,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:34,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:34,577 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-08 14:31:34,578 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-08 14:31:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:34,579 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:31:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:31:34,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:34,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:34,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:34,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:34,580 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-08 14:31:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 14:31:34,582 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-08 14:31:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:34,582 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 14:31:34,582 INFO L479 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-08 14:31:34,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 14:31:34,614 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-08 14:31:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:31:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:31:34,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:34,615 INFO L499 BasicCegarLoop]: 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-08 14:31:34,625 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-08 14:31:34,821 WARN L460 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-08 14:31:34,822 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:34,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-08 14:31:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:34,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1283591042] [2022-04-08 14:31:34,980 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:34,980 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-08 14:31:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:34,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556843949] [2022-04-08 14:31:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:35,000 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:35,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801194491] [2022-04-08 14:31:35,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:35,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:35,001 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-08 14:31:35,003 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-08 14:31:35,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:35,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:35,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:31:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:35,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:35,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 14:31:35,199 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-08 14:31:35,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:31:35,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 14:31:35,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 14:31:35,214 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-08 14:31:35,214 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-08 14:31:35,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:31:35,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:31:35,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:31:35,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 14:31:35,216 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-08 14:31:35,216 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-08 14:31:35,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:35,217 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-08 14:31:35,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:31:35,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:31:35,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:31:35,218 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-08 14:31:35,219 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-08 14:31:35,219 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-08 14:31:35,220 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 < 100);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-08 14:31:35,220 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-08 14:31:35,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:35,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 14:31:35,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 14:31:35,222 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-08 14:31:35,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:35,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 14:31:35,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 14:31:35,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:35,395 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-08 14:31:35,396 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 < 100);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-08 14:31:35,396 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-08 14:31:35,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:31:35,546 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-08 14:31:35,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:31:35,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:31:35,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:31:35,547 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-08 14:31:35,548 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 < 100);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-08 14:31:35,548 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-08 14:31:35,549 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-08 14:31:35,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 14:31:35,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:31:35,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:31:35,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:31:35,549 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-08 14:31:35,550 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-08 14:31:35,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 14:31:35,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 14:31:35,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:31:35,550 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-08 14:31:35,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 14:31:35,551 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-08 14:31:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:35,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556843949] [2022-04-08 14:31:35,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:35,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801194491] [2022-04-08 14:31:35,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801194491] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:35,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:35,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:31:35,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:35,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1283591042] [2022-04-08 14:31:35,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1283591042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:35,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:35,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:31:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017101650] [2022-04-08 14:31:35,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:35,553 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-08 14:31:35,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:35,554 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-08 14:31:35,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:35,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:31:35,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:35,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:31:35,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:31:35,619 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-08 14:31:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:35,754 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-08 14:31:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:31:35,755 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-08 14:31:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:35,755 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-08 14:31:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:31:35,756 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-08 14:31:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:31:35,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:31:35,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:35,893 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:31:35,894 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:31:35,894 INFO L912 BasicCegarLoop]: 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-08 14:31:35,895 INFO L913 BasicCegarLoop]: 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-08 14:31:35,895 INFO L914 BasicCegarLoop]: 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-08 14:31:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:31:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 14:31:35,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:35,922 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-08 14:31:35,922 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-08 14:31:35,922 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-08 14:31:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:35,924 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:31:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:31:35,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:35,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:35,925 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-08 14:31:35,925 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-08 14:31:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:35,927 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:31:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:31:35,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:35,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:35,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:35,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:35,927 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-08 14:31:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-08 14:31:35,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-08 14:31:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:35,929 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-08 14:31:35,929 INFO L479 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-08 14:31:35,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-08 14:31:36,047 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-08 14:31:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:31:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 14:31:36,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:36,048 INFO L499 BasicCegarLoop]: 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-08 14:31:36,065 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-08 14:31:36,251 WARN L460 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-08 14:31:36,251 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-08 14:31:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:36,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042138748] [2022-04-08 14:31:36,397 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:36,397 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:36,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-08 14:31:36,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:36,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213824325] [2022-04-08 14:31:36,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:36,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:36,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304720061] [2022-04-08 14:31:36,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:36,412 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-08 14:31:36,445 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-08 14:31:36,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:36,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:36,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:31:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:36,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:36,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-08 14:31:36,825 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-08 14:31:36,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:31:36,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-08 14:31:36,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-08 14:31:36,826 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-08 14:31:36,826 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-08 14:31:36,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:31:36,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:31:36,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:31:36,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-08 14:31:36,827 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-08 14:31:36,828 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-08 14:31:36,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:36,829 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-08 14:31:36,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:31:36,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:31:36,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:31:36,830 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-08 14:31:36,831 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-08 14:31:36,831 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-08 14:31:36,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:31:36,832 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-08 14:31:36,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:31:36,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:31:36,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:31:36,833 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-08 14:31:36,833 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-08 14:31:36,834 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-08 14:31:36,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:31:36,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:31:36,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:31:36,834 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-08 14:31:36,835 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-08 14:31:36,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:36,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-08 14:31:36,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-08 14:31:36,839 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-08 14:31:36,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:37,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213824325] [2022-04-08 14:31:37,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:37,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304720061] [2022-04-08 14:31:37,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304720061] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:37,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:37,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:31:37,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:37,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2042138748] [2022-04-08 14:31:37,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2042138748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:37,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:37,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:31:37,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694644846] [2022-04-08 14:31:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:37,136 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-08 14:31:37,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:37,136 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-08 14:31:37,162 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-08 14:31:37,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:31:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:31:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:31:37,163 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-08 14:31:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:37,447 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 14:31:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:31:37,448 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-08 14:31:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:37,448 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-08 14:31:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 14:31:37,450 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-08 14:31:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 14:31:37,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 14:31:37,491 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-08 14:31:37,492 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:31:37,492 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:31:37,493 INFO L912 BasicCegarLoop]: 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-08 14:31:37,493 INFO L913 BasicCegarLoop]: 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-08 14:31:37,494 INFO L914 BasicCegarLoop]: 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-08 14:31:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:31:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 14:31:37,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:37,525 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-08 14:31:37,525 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-08 14:31:37,525 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-08 14:31:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:37,527 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 14:31:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:31:37,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:37,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:37,528 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-08 14:31:37,528 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-08 14:31:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:37,529 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 14:31:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:31:37,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:37,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:37,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:37,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:37,530 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-08 14:31:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 14:31:37,532 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-08 14:31:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:37,532 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 14:31:37,532 INFO L479 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-08 14:31:37,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 14:31:37,819 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-08 14:31:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:31:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 14:31:37,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:37,820 INFO L499 BasicCegarLoop]: 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-08 14:31:37,843 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-08 14:31:38,035 WARN L460 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-08 14:31:38,035 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-08 14:31:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:38,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609053530] [2022-04-08 14:31:38,154 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:38,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-08 14:31:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:38,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880878538] [2022-04-08 14:31:38,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:38,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:38,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553850069] [2022-04-08 14:31:38,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:38,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:38,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:38,166 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-08 14:31:38,170 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-08 14:31:38,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:38,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:38,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:31:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:38,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:38,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 14:31:38,418 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-08 14:31:38,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:38,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:38,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:38,419 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-08 14:31:38,420 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-08 14:31:38,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:38,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:38,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:38,421 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:38,422 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-08 14:31:38,422 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-08 14:31:38,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:38,423 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-08 14:31:38,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:38,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:38,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:38,424 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:38,425 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-08 14:31:38,425 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-08 14:31:38,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:38,426 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-08 14:31:38,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:38,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:38,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:38,428 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:38,428 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-08 14:31:38,428 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-08 14:31:38,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 100);havoc #t~post5; {1926#false} is VALID [2022-04-08 14:31:38,429 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-08 14:31:38,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:31:38,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-08 14:31:38,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-08 14:31:38,430 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 14:31:38,430 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-08 14:31:38,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:31:38,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 14:31:38,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 14:31:38,430 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-08 14:31:38,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:38,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 14:31:38,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 14:31:38,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:31:38,639 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-08 14:31:38,641 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 14:31:38,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:31:38,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:31:38,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:31:38,641 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-08 14:31:38,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1926#false} is VALID [2022-04-08 14:31:38,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:31:38,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-08 14:31:38,644 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 100)} #55#return; {2079#(< ~counter~0 100)} is VALID [2022-04-08 14:31:38,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:31:38,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:31:38,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:31:38,648 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:38,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {2079#(< ~counter~0 100)} is VALID [2022-04-08 14:31:38,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 100)} is VALID [2022-04-08 14:31:38,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-08 14:31:38,650 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 99)} #55#return; {2104#(< ~counter~0 99)} is VALID [2022-04-08 14:31:38,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:31:38,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:31:38,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:31:38,650 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:38,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {2104#(< ~counter~0 99)} is VALID [2022-04-08 14:31:38,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 99)} is VALID [2022-04-08 14:31:38,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 98)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 98)} is VALID [2022-04-08 14:31:38,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 98)} #53#return; {2129#(< ~counter~0 98)} is VALID [2022-04-08 14:31:38,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:31:38,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:31:38,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:31:38,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 98)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:31:38,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 98)} 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 98)} is VALID [2022-04-08 14:31:38,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 98)} call #t~ret6 := main(); {2129#(< ~counter~0 98)} is VALID [2022-04-08 14:31:38,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 98)} {1925#true} #61#return; {2129#(< ~counter~0 98)} is VALID [2022-04-08 14:31:38,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 98)} assume true; {2129#(< ~counter~0 98)} is VALID [2022-04-08 14:31:38,654 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 98)} is VALID [2022-04-08 14:31:38,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 14:31:38,657 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-08 14:31:38,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:38,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880878538] [2022-04-08 14:31:38,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:38,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553850069] [2022-04-08 14:31:38,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553850069] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:31:38,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:31:38,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 14:31:38,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:38,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609053530] [2022-04-08 14:31:38,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609053530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:38,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:38,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:31:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853636582] [2022-04-08 14:31:38,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:38,659 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-08 14:31:38,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:38,660 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-08 14:31:38,687 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-08 14:31:38,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:31:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:38,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:31:38,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:31:38,688 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-08 14:31:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:38,819 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-08 14:31:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:31:38,819 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-08 14:31:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:38,819 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-08 14:31:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 14:31:38,821 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-08 14:31:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 14:31:38,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-08 14:31:38,866 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-08 14:31:38,868 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:31:38,868 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 14:31:38,869 INFO L912 BasicCegarLoop]: 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-08 14:31:38,870 INFO L913 BasicCegarLoop]: 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-08 14:31:38,870 INFO L914 BasicCegarLoop]: 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-08 14:31:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 14:31:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 14:31:38,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:38,913 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-08 14:31:38,913 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-08 14:31:38,913 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-08 14:31:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:38,915 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:31:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:31:38,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:38,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:38,916 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-08 14:31:38,916 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-08 14:31:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:38,918 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:31:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:31:38,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:38,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:38,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:38,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:38,919 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-08 14:31:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-08 14:31:38,920 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-08 14:31:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:38,920 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-08 14:31:38,921 INFO L479 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-08 14:31:38,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-08 14:31:39,085 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-08 14:31:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:31:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 14:31:39,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:39,086 INFO L499 BasicCegarLoop]: 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-08 14:31:39,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 14:31:39,299 WARN L460 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-08 14:31:39,300 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-08 14:31:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:39,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178839030] [2022-04-08 14:31:39,417 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:39,418 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-08 14:31:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:39,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396777238] [2022-04-08 14:31:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:39,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164018486] [2022-04-08 14:31:39,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:31:39,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:39,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:39,464 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-08 14:31:39,490 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-08 14:31:39,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:31:39,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:39,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 14:31:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:39,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:39,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-08 14:31:39,841 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-08 14:31:39,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:31:39,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-08 14:31:39,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-08 14:31:39,842 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-08 14:31:39,842 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-08 14:31:39,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:31:39,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:31:39,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:31:39,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-08 14:31:39,843 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-08 14:31:39,843 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-08 14:31:39,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:39,844 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-08 14:31:39,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:31:39,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:31:39,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:31:39,845 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-08 14:31:39,846 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-08 14:31:39,846 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-08 14:31:39,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:31:39,847 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-08 14:31:39,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:31:39,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:31:39,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:31:39,848 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-08 14:31:39,848 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-08 14:31:39,849 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-08 14:31:39,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:31:39,850 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-08 14:31:39,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:31:39,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:31:39,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:31:39,855 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-08 14:31:39,856 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-08 14:31:39,856 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-08 14:31:39,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:31:39,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:31:39,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:31:39,857 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-08 14:31:39,858 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-08 14:31:39,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:39,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-08 14:31:39,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-08 14:31:39,859 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-08 14:31:39,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:40,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396777238] [2022-04-08 14:31:40,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:40,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164018486] [2022-04-08 14:31:40,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164018486] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:40,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:40,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:31:40,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:40,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178839030] [2022-04-08 14:31:40,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178839030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:40,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:40,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:31:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670417977] [2022-04-08 14:31:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:40,136 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-08 14:31:40,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:40,137 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-08 14:31:40,165 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-08 14:31:40,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:31:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:31:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 14:31:40,166 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-08 14:31:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:40,508 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 14:31:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:31:40,508 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-08 14:31:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:40,509 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-08 14:31:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 14:31:40,510 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-08 14:31:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 14:31:40,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 14:31:40,552 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-08 14:31:40,553 INFO L225 Difference]: With dead ends: 52 [2022-04-08 14:31:40,554 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 14:31:40,554 INFO L912 BasicCegarLoop]: 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-08 14:31:40,554 INFO L913 BasicCegarLoop]: 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-08 14:31:40,555 INFO L914 BasicCegarLoop]: 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-08 14:31:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 14:31:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 14:31:40,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:40,596 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-08 14:31:40,597 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-08 14:31:40,597 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-08 14:31:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:40,598 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 14:31:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:31:40,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:40,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:40,599 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-08 14:31:40,599 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-08 14:31:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:40,601 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 14:31:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:31:40,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:40,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:40,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:40,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:40,602 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-08 14:31:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-08 14:31:40,603 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-08 14:31:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:40,603 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-08 14:31:40,603 INFO L479 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-08 14:31:40,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-08 14:31:40,765 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-08 14:31:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:31:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 14:31:40,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:40,766 INFO L499 BasicCegarLoop]: 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-08 14:31:40,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 14:31:40,971 WARN L460 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-08 14:31:40,971 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-08 14:31:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:40,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1251687069] [2022-04-08 14:31:41,087 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:41,087 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-08 14:31:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:41,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729934670] [2022-04-08 14:31:41,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:41,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:41,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081519972] [2022-04-08 14:31:41,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:31:41,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:41,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:41,102 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-08 14:31:41,103 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-08 14:31:41,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:31:41,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:41,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:31:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:41,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:41,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 14:31:41,375 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-08 14:31:41,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:41,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:41,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:41,377 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-08 14:31:41,377 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-08 14:31:41,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:41,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:41,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:41,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:41,379 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-08 14:31:41,380 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-08 14:31:41,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:41,380 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-08 14:31:41,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:41,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:41,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:41,382 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:41,382 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-08 14:31:41,383 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-08 14:31:41,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:41,384 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-08 14:31:41,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:41,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:41,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:41,385 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:41,385 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-08 14:31:41,386 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-08 14:31:41,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:41,387 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-08 14:31:41,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:41,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:41,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:41,388 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:41,388 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-08 14:31:41,389 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-08 14:31:41,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 100);havoc #t~post5; {2951#false} is VALID [2022-04-08 14:31:41,389 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-08 14:31:41,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:31:41,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-08 14:31:41,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-08 14:31:41,390 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 14:31:41,391 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-08 14:31:41,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:31:41,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 14:31:41,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 14:31:41,396 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-08 14:31:41,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:41,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 14:31:41,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 14:31:41,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:31:41,662 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-08 14:31:41,662 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 14:31:41,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:31:41,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:31:41,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:31:41,662 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-08 14:31:41,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {2951#false} is VALID [2022-04-08 14:31:41,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:31:41,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-08 14:31:41,664 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 100)} #55#return; {3129#(< ~counter~0 100)} is VALID [2022-04-08 14:31:41,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:31:41,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:31:41,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:31:41,665 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:41,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {3129#(< ~counter~0 100)} is VALID [2022-04-08 14:31:41,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 100)} is VALID [2022-04-08 14:31:41,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-08 14:31:41,667 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 99)} #55#return; {3154#(< ~counter~0 99)} is VALID [2022-04-08 14:31:41,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:31:41,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:31:41,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:31:41,667 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:41,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {3154#(< ~counter~0 99)} is VALID [2022-04-08 14:31:41,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 99)} is VALID [2022-04-08 14:31:41,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-08 14:31:41,669 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 98)} #55#return; {3179#(< ~counter~0 98)} is VALID [2022-04-08 14:31:41,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:31:41,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:31:41,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:31:41,669 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:41,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {3179#(< ~counter~0 98)} is VALID [2022-04-08 14:31:41,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 98)} is VALID [2022-04-08 14:31:41,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 97)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 97)} is VALID [2022-04-08 14:31:41,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 97)} #53#return; {3204#(< ~counter~0 97)} is VALID [2022-04-08 14:31:41,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:31:41,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:31:41,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:31:41,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 97)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:31:41,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 97)} 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 97)} is VALID [2022-04-08 14:31:41,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 97)} call #t~ret6 := main(); {3204#(< ~counter~0 97)} is VALID [2022-04-08 14:31:41,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 97)} {2950#true} #61#return; {3204#(< ~counter~0 97)} is VALID [2022-04-08 14:31:41,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 97)} assume true; {3204#(< ~counter~0 97)} is VALID [2022-04-08 14:31:41,676 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 97)} is VALID [2022-04-08 14:31:41,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 14:31:41,677 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-08 14:31:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:41,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729934670] [2022-04-08 14:31:41,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:41,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081519972] [2022-04-08 14:31:41,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081519972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:31:41,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:31:41,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 14:31:41,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:41,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1251687069] [2022-04-08 14:31:41,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1251687069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:41,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:41,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:31:41,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040070692] [2022-04-08 14:31:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:41,680 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-08 14:31:41,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:41,680 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-08 14:31:41,718 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-08 14:31:41,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:31:41,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:41,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:31:41,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:31:41,719 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-08 14:31:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:41,887 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-08 14:31:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:31:41,887 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-08 14:31:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:41,888 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-08 14:31:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 14:31:41,889 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-08 14:31:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 14:31:41,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-08 14:31:41,949 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-08 14:31:41,950 INFO L225 Difference]: With dead ends: 62 [2022-04-08 14:31:41,950 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 14:31:41,950 INFO L912 BasicCegarLoop]: 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-08 14:31:41,951 INFO L913 BasicCegarLoop]: 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-08 14:31:41,951 INFO L914 BasicCegarLoop]: 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-08 14:31:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 14:31:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 14:31:41,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:41,999 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-08 14:31:41,999 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-08 14:31:42,000 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-08 14:31:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:42,002 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:31:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:31:42,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:42,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:42,003 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-08 14:31:42,003 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-08 14:31:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:42,004 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:31:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:31:42,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:42,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:42,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:42,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:42,005 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-08 14:31:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-08 14:31:42,006 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-08 14:31:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:42,006 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-08 14:31:42,007 INFO L479 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-08 14:31:42,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-08 14:31:42,109 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-08 14:31:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:31:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 14:31:42,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:42,110 INFO L499 BasicCegarLoop]: 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-08 14:31:42,128 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-08 14:31:42,319 WARN L460 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-08 14:31:42,320 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:42,320 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-08 14:31:42,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:42,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474300241] [2022-04-08 14:31:42,439 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:42,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-08 14:31:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:42,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758292068] [2022-04-08 14:31:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:42,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:42,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967238320] [2022-04-08 14:31:42,450 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:31:42,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:42,452 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-08 14:31:42,463 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-08 14:31:49,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:31:49,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:49,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:31:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:49,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:49,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-08 14:31:49,703 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-08 14:31:49,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:31:49,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-08 14:31:49,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-08 14:31:49,703 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-08 14:31:49,703 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-08 14:31:49,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:31:49,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:31:49,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:31:49,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-08 14:31:49,705 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-08 14:31:49,705 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-08 14:31:49,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:49,706 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-08 14:31:49,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:31:49,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:31:49,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:31:49,706 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-08 14:31:49,707 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-08 14:31:49,707 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-08 14:31:49,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:31:49,708 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-08 14:31:49,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:31:49,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:31:49,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:31:49,709 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-08 14:31:49,709 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-08 14:31:49,710 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-08 14:31:49,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:31:49,710 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-08 14:31:49,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:31:49,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:31:49,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:31:49,711 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-08 14:31:49,711 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-08 14:31:49,712 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-08 14:31:49,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:31:49,712 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-08 14:31:49,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:31:49,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:31:49,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:31:49,713 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-08 14:31:49,714 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-08 14:31:49,714 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-08 14:31:49,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:31:49,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:31:49,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:31:49,715 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-08 14:31:49,715 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-08 14:31:49,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:49,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-08 14:31:49,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-08 14:31:49,717 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-08 14:31:49,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:49,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758292068] [2022-04-08 14:31:49,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:49,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967238320] [2022-04-08 14:31:49,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967238320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:49,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:49,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:31:49,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:49,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474300241] [2022-04-08 14:31:49,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474300241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:49,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:49,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:31:49,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243034181] [2022-04-08 14:31:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:49,989 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-08 14:31:49,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:49,989 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-08 14:31:50,035 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-08 14:31:50,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:31:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:31:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:31:50,036 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-08 14:31:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:50,447 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-08 14:31:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:31:50,447 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-08 14:31:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:50,448 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-08 14:31:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 14:31:50,449 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-08 14:31:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 14:31:50,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-08 14:31:50,510 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-08 14:31:50,511 INFO L225 Difference]: With dead ends: 60 [2022-04-08 14:31:50,511 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 14:31:50,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:31:50,512 INFO L913 BasicCegarLoop]: 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-08 14:31:50,513 INFO L914 BasicCegarLoop]: 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-08 14:31:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 14:31:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 14:31:50,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:50,582 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-08 14:31:50,582 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-08 14:31:50,582 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-08 14:31:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:50,583 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 14:31:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:31:50,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:50,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:50,584 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-08 14:31:50,584 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-08 14:31:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:50,585 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 14:31:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:31:50,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:50,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:50,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:50,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:50,586 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-08 14:31:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-08 14:31:50,587 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-08 14:31:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:50,588 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-08 14:31:50,588 INFO L479 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-08 14:31:50,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-08 14:31:50,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:31:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 14:31:50,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:50,788 INFO L499 BasicCegarLoop]: 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-08 14:31:50,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 14:31:50,992 WARN L460 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-08 14:31:50,992 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-08 14:31:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403148964] [2022-04-08 14:31:51,119 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:51,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-08 14:31:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:51,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328661026] [2022-04-08 14:31:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:51,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:51,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852303119] [2022-04-08 14:31:51,133 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:31:51,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:51,134 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-08 14:31:51,161 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-08 14:31:51,535 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 14:31:51,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:51,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 14:31:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:51,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:51,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 14:31:51,827 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-08 14:31:51,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:51,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:51,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:51,829 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-08 14:31:51,829 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-08 14:31:51,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:51,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:51,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:51,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:51,831 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-08 14:31:51,832 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-08 14:31:51,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:51,833 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-08 14:31:51,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:51,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:51,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:51,834 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:51,835 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-08 14:31:51,835 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-08 14:31:51,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:51,836 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-08 14:31:51,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:51,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:51,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:51,838 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:51,838 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-08 14:31:51,839 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-08 14:31:51,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:51,840 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-08 14:31:51,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:51,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:51,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:51,841 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:51,842 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-08 14:31:51,842 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-08 14:31:51,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:51,843 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-08 14:31:51,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:51,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:51,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:51,844 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:51,845 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-08 14:31:51,845 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-08 14:31:51,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {4149#false} is VALID [2022-04-08 14:31:51,845 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-08 14:31:51,845 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:31:51,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-08 14:31:51,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-08 14:31:51,846 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 14:31:51,846 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-08 14:31:51,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:31:51,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 14:31:51,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 14:31:51,846 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-08 14:31:51,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:52,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 14:31:52,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 14:31:52,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:31:52,117 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-08 14:31:52,117 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 14:31:52,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:31:52,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:31:52,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:31:52,118 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-08 14:31:52,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {4149#false} is VALID [2022-04-08 14:31:52,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:31:52,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-08 14:31:52,120 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 100)} #55#return; {4352#(< ~counter~0 100)} is VALID [2022-04-08 14:31:52,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:31:52,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:31:52,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:31:52,120 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:52,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {4352#(< ~counter~0 100)} is VALID [2022-04-08 14:31:52,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 100)} is VALID [2022-04-08 14:31:52,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-08 14:31:52,122 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 99)} #55#return; {4377#(< ~counter~0 99)} is VALID [2022-04-08 14:31:52,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:31:52,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:31:52,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:31:52,122 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:52,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {4377#(< ~counter~0 99)} is VALID [2022-04-08 14:31:52,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 99)} is VALID [2022-04-08 14:31:52,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-08 14:31:52,123 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 98)} #55#return; {4402#(< ~counter~0 98)} is VALID [2022-04-08 14:31:52,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:31:52,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:31:52,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:31:52,124 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:52,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {4402#(< ~counter~0 98)} is VALID [2022-04-08 14:31:52,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 98)} is VALID [2022-04-08 14:31:52,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-08 14:31:52,126 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 97)} #55#return; {4427#(< ~counter~0 97)} is VALID [2022-04-08 14:31:52,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:31:52,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:31:52,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:31:52,126 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:52,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {4427#(< ~counter~0 97)} is VALID [2022-04-08 14:31:52,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 97)} is VALID [2022-04-08 14:31:52,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 96)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 96)} is VALID [2022-04-08 14:31:52,128 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 96)} #53#return; {4452#(< ~counter~0 96)} is VALID [2022-04-08 14:31:52,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:31:52,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:31:52,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:31:52,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 96)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:31:52,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 96)} 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 96)} is VALID [2022-04-08 14:31:52,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 96)} call #t~ret6 := main(); {4452#(< ~counter~0 96)} is VALID [2022-04-08 14:31:52,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 96)} {4148#true} #61#return; {4452#(< ~counter~0 96)} is VALID [2022-04-08 14:31:52,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 96)} assume true; {4452#(< ~counter~0 96)} is VALID [2022-04-08 14:31:52,137 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 96)} is VALID [2022-04-08 14:31:52,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 14:31:52,138 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-08 14:31:52,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:52,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328661026] [2022-04-08 14:31:52,138 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:52,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852303119] [2022-04-08 14:31:52,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852303119] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:31:52,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:31:52,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 14:31:52,139 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:52,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403148964] [2022-04-08 14:31:52,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403148964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:52,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:52,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:31:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964705611] [2022-04-08 14:31:52,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:52,140 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-08 14:31:52,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:52,140 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-08 14:31:52,184 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-08 14:31:52,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:31:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:31:52,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:31:52,185 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-08 14:31:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:52,371 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-08 14:31:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:31:52,371 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-08 14:31:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:52,371 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-08 14:31:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 14:31:52,373 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-08 14:31:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 14:31:52,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-08 14:31:52,425 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-08 14:31:52,426 INFO L225 Difference]: With dead ends: 70 [2022-04-08 14:31:52,426 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 14:31:52,427 INFO L912 BasicCegarLoop]: 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-08 14:31:52,427 INFO L913 BasicCegarLoop]: 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-08 14:31:52,427 INFO L914 BasicCegarLoop]: 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-08 14:31:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 14:31:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 14:31:52,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:52,483 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-08 14:31:52,483 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-08 14:31:52,484 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-08 14:31:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:52,485 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:31:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:31:52,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:52,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:52,485 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-08 14:31:52,486 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-08 14:31:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:52,487 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:31:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:31:52,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:52,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:52,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:52,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:52,488 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-08 14:31:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-08 14:31:52,489 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-08 14:31:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:52,489 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-08 14:31:52,489 INFO L479 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-08 14:31:52,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-08 14:31:52,606 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-08 14:31:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:31:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 14:31:52,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:52,606 INFO L499 BasicCegarLoop]: 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-08 14:31:52,611 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-08 14:31:52,807 WARN L460 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-08 14:31:52,807 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:52,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-08 14:31:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:52,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444054609] [2022-04-08 14:31:52,927 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:52,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-08 14:31:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:52,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569937130] [2022-04-08 14:31:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:52,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:52,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876237587] [2022-04-08 14:31:52,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:52,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:52,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:52,960 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-08 14:31:52,978 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-08 14:31:53,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:53,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:53,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 14:31:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:53,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:53,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-08 14:31:53,992 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-08 14:31:53,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:31:53,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-08 14:31:53,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-08 14:31:53,992 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-08 14:31:53,992 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-08 14:31:53,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:31:53,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:31:53,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:31:53,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-08 14:31:53,993 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-08 14:31:53,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-08 14:31:53,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:53,994 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-08 14:31:53,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:31:53,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:31:53,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:31:53,995 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-08 14:31:53,996 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-08 14:31:53,996 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-08 14:31:53,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 < 100);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-08 14:31:53,997 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-08 14:31:53,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:31:53,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:31:53,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:31:53,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-08 14:31:53,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-08 14:31:53,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-08 14:31:53,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 < 100);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:31:53,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-08 14:31:53,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:31:53,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:31:53,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:31:53,999 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-08 14:31:54,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-08 14:31:54,000 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-08 14:31:54,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 < 100);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:31:54,001 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-08 14:31:54,001 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:31:54,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:31:54,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:31:54,001 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-08 14:31:54,002 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-08 14:31:54,005 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-08 14:31:54,005 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:31:54,005 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-08 14:31:54,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:31:54,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:31:54,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:31:54,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-08 14:31:54,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-08 14:31:54,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-08 14:31:54,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:31:54,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:31:54,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:31:54,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-08 14:31:54,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-08 14:31:54,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:54,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-08 14:31:54,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-08 14:31:54,009 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-08 14:31:54,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:54,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569937130] [2022-04-08 14:31:54,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:54,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876237587] [2022-04-08 14:31:54,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876237587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:54,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:54,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 14:31:54,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:54,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1444054609] [2022-04-08 14:31:54,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1444054609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:54,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:54,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:31:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344190864] [2022-04-08 14:31:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:54,769 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-08 14:31:54,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:54,769 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-08 14:31:54,802 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-08 14:31:54,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:31:54,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:54,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:31:54,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:31:54,802 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-08 14:31:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:55,375 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-08 14:31:55,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:31:55,375 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-08 14:31:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:55,376 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-08 14:31:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 14:31:55,377 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-08 14:31:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 14:31:55,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-08 14:31:55,425 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-08 14:31:55,426 INFO L225 Difference]: With dead ends: 68 [2022-04-08 14:31:55,426 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 14:31:55,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:31:55,427 INFO L913 BasicCegarLoop]: 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-08 14:31:55,427 INFO L914 BasicCegarLoop]: 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-08 14:31:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 14:31:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-08 14:31:55,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:55,489 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-08 14:31:55,489 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-08 14:31:55,489 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-08 14:31:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:55,491 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 14:31:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:31:55,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:55,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:55,491 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-08 14:31:55,492 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-08 14:31:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:55,493 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 14:31:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:31:55,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:55,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:55,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:55,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:55,494 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-08 14:31:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-08 14:31:55,495 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-08 14:31:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:55,495 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-08 14:31:55,495 INFO L479 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-08 14:31:55,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-08 14:31:55,651 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-08 14:31:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:31:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 14:31:55,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:55,652 INFO L499 BasicCegarLoop]: 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-08 14:31:55,657 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-08 14:31:55,855 WARN L460 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-08 14:31:55,855 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-08 14:31:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:55,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286568170] [2022-04-08 14:31:55,963 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:55,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-08 14:31:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:55,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283886188] [2022-04-08 14:31:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:55,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:55,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825220126] [2022-04-08 14:31:55,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:31:55,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:55,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:55,976 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-08 14:31:56,006 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-08 14:31:56,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:31:56,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:56,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:31:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:56,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:56,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 14:31:56,344 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-08 14:31:56,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:56,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:56,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:56,346 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-08 14:31:56,346 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-08 14:31:56,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:56,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:56,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:56,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:31:56,348 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-08 14:31:56,348 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-08 14:31:56,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:56,349 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-08 14:31:56,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:56,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:56,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:56,350 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:31:56,350 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-08 14:31:56,351 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-08 14:31:56,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:56,352 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-08 14:31:56,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:56,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:56,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:56,353 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:31:56,353 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-08 14:31:56,354 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-08 14:31:56,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:56,354 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-08 14:31:56,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:56,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:56,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:56,356 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:31:56,356 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-08 14:31:56,356 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-08 14:31:56,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:56,357 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-08 14:31:56,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:56,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:56,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:56,359 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:31:56,360 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-08 14:31:56,360 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-08 14:31:56,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:31:56,364 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-08 14:31:56,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:31:56,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:31:56,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:31:56,365 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:31:56,365 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-08 14:31:56,365 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-08 14:31:56,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 100);havoc #t~post5; {5595#false} is VALID [2022-04-08 14:31:56,366 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-08 14:31:56,366 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:31:56,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-08 14:31:56,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-08 14:31:56,366 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 14:31:56,366 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-08 14:31:56,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:31:56,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 14:31:56,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 14:31:56,367 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-08 14:31:56,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:56,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 14:31:56,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 14:31:56,683 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:31:56,683 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-08 14:31:56,683 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 14:31:56,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:31:56,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:31:56,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:31:56,683 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-08 14:31:56,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {5595#false} is VALID [2022-04-08 14:31:56,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:31:56,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-08 14:31:56,684 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 100)} #55#return; {5823#(< ~counter~0 100)} is VALID [2022-04-08 14:31:56,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:31:56,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:31:56,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:31:56,685 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:56,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {5823#(< ~counter~0 100)} is VALID [2022-04-08 14:31:56,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 100)} is VALID [2022-04-08 14:31:56,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-08 14:31:56,686 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 99)} #55#return; {5848#(< ~counter~0 99)} is VALID [2022-04-08 14:31:56,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:31:56,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:31:56,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:31:56,687 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:56,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5848#(< ~counter~0 99)} is VALID [2022-04-08 14:31:56,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 99)} is VALID [2022-04-08 14:31:56,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-08 14:31:56,688 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 98)} #55#return; {5873#(< ~counter~0 98)} is VALID [2022-04-08 14:31:56,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:31:56,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:31:56,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:31:56,688 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:56,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {5873#(< ~counter~0 98)} is VALID [2022-04-08 14:31:56,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 98)} is VALID [2022-04-08 14:31:56,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-08 14:31:56,690 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 97)} #55#return; {5898#(< ~counter~0 97)} is VALID [2022-04-08 14:31:56,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:31:56,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:31:56,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:31:56,690 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:56,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {5898#(< ~counter~0 97)} is VALID [2022-04-08 14:31:56,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 97)} is VALID [2022-04-08 14:31:56,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {5923#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5923#(< ~counter~0 96)} is VALID [2022-04-08 14:31:56,692 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5923#(< ~counter~0 96)} #55#return; {5923#(< ~counter~0 96)} is VALID [2022-04-08 14:31:56,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:31:56,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:31:56,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:31:56,692 INFO L272 TraceCheckUtils]: 14: Hoare triple {5923#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-08 14:31:56,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {5923#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {5923#(< ~counter~0 96)} is VALID [2022-04-08 14:31:56,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5923#(< ~counter~0 96)} is VALID [2022-04-08 14:31:56,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {5948#(< ~counter~0 95)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5948#(< ~counter~0 95)} is VALID [2022-04-08 14:31:56,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5948#(< ~counter~0 95)} #53#return; {5948#(< ~counter~0 95)} is VALID [2022-04-08 14:31:56,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:31:56,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:31:56,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:31:56,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {5948#(< ~counter~0 95)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:31:56,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#(< ~counter~0 95)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5948#(< ~counter~0 95)} is VALID [2022-04-08 14:31:56,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#(< ~counter~0 95)} call #t~ret6 := main(); {5948#(< ~counter~0 95)} is VALID [2022-04-08 14:31:56,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#(< ~counter~0 95)} {5594#true} #61#return; {5948#(< ~counter~0 95)} is VALID [2022-04-08 14:31:56,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#(< ~counter~0 95)} assume true; {5948#(< ~counter~0 95)} is VALID [2022-04-08 14:31:56,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5948#(< ~counter~0 95)} is VALID [2022-04-08 14:31:56,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 14:31:56,701 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-08 14:31:56,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:56,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283886188] [2022-04-08 14:31:56,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:56,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825220126] [2022-04-08 14:31:56,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825220126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:31:56,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:31:56,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 14:31:56,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:56,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286568170] [2022-04-08 14:31:56,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286568170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:56,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:56,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:31:56,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91982227] [2022-04-08 14:31:56,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:56,705 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-08 14:31:56,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:56,705 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-08 14:31:56,755 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-08 14:31:56,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:31:56,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:31:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:31:56,756 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-08 14:31:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:56,971 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-08 14:31:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:31:56,971 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-08 14:31:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:56,972 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-08 14:31:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 14:31:56,973 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-08 14:31:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 14:31:56,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-08 14:31:57,030 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-08 14:31:57,032 INFO L225 Difference]: With dead ends: 78 [2022-04-08 14:31:57,032 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 14:31:57,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:31:57,033 INFO L913 BasicCegarLoop]: 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-08 14:31:57,033 INFO L914 BasicCegarLoop]: 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-08 14:31:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 14:31:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 14:31:57,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:57,109 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-08 14:31:57,109 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-08 14:31:57,109 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-08 14:31:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:57,111 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:31:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:31:57,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:57,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:57,111 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-08 14:31:57,112 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-08 14:31:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:57,113 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:31:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:31:57,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:57,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:57,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:57,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:57,114 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-08 14:31:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-08 14:31:57,115 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-08 14:31:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:57,115 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-08 14:31:57,115 INFO L479 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-08 14:31:57,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-08 14:31:57,329 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-08 14:31:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:31:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 14:31:57,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:57,330 INFO L499 BasicCegarLoop]: 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-08 14:31:57,346 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-08 14:31:57,530 WARN L460 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-08 14:31:57,531 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-08 14:31:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:57,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720749496] [2022-04-08 14:31:57,636 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:57,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-08 14:31:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:57,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301297977] [2022-04-08 14:31:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:57,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:57,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156274553] [2022-04-08 14:31:57,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:31:57,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:57,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:57,660 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-08 14:31:57,662 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-08 14:31:57,702 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:31:57,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:57,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:31:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:57,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:31:58,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6425#true} is VALID [2022-04-08 14:31:58,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6425#true} is VALID [2022-04-08 14:31:58,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #61#return; {6425#true} is VALID [2022-04-08 14:31:58,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret6 := main(); {6425#true} is VALID [2022-04-08 14:31:58,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6425#true} is VALID [2022-04-08 14:31:58,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {6425#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:31:58,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:31:58,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:31:58,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6425#true} {6425#true} #53#return; {6425#true} is VALID [2022-04-08 14:31:58,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {6425#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:58,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:58,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:58,176 INFO L272 TraceCheckUtils]: 14: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:31:58,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:31:58,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:31:58,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,177 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6425#true} {6463#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:31:58,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:31:58,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:31:58,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:31:58,178 INFO L272 TraceCheckUtils]: 22: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:31:58,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:31:58,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:31:58,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,179 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6425#true} {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:31:58,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:31:58,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:31:58,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:31:58,180 INFO L272 TraceCheckUtils]: 30: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:31:58,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:31:58,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:31:58,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,181 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6425#true} {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:31:58,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:31:58,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:31:58,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:31:58,182 INFO L272 TraceCheckUtils]: 38: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:31:58,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:31:58,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:31:58,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,184 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6425#true} {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:31:58,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:31:58,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:31:58,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:31:58,185 INFO L272 TraceCheckUtils]: 46: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:31:58,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:31:58,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:31:58,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,186 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6425#true} {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:31:58,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:58,187 INFO L290 TraceCheckUtils]: 52: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:58,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:58,187 INFO L272 TraceCheckUtils]: 54: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:31:58,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:31:58,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:31:58,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,188 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6425#true} {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:58,188 INFO L290 TraceCheckUtils]: 59: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:58,188 INFO L272 TraceCheckUtils]: 60: Hoare triple {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:31:58,188 INFO L290 TraceCheckUtils]: 61: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:31:58,189 INFO L290 TraceCheckUtils]: 62: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:31:58,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:31:58,189 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6425#true} {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:31:58,190 INFO L272 TraceCheckUtils]: 65: Hoare triple {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:31:58,190 INFO L290 TraceCheckUtils]: 66: Hoare triple {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:31:58,191 INFO L290 TraceCheckUtils]: 67: Hoare triple {6636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6426#false} is VALID [2022-04-08 14:31:58,191 INFO L290 TraceCheckUtils]: 68: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-08 14:31:58,191 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-08 14:31:58,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:31:58,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301297977] [2022-04-08 14:31:58,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:31:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156274553] [2022-04-08 14:31:58,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156274553] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:31:58,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:31:58,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:31:58,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720749496] [2022-04-08 14:31:58,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720749496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:58,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:58,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:31:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176365251] [2022-04-08 14:31:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:58,498 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-08 14:31:58,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:58,498 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-08 14:31:58,535 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-08 14:31:58,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:31:58,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:58,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:31:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:31:58,536 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-08 14:31:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:59,226 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 14:31:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:31:59,226 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-08 14:31:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:31:59,227 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-08 14:31:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 14:31:59,228 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-08 14:31:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 14:31:59,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 14:31:59,282 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-08 14:31:59,283 INFO L225 Difference]: With dead ends: 76 [2022-04-08 14:31:59,283 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 14:31:59,284 INFO L912 BasicCegarLoop]: 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-08 14:31:59,284 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:31:59,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:31:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 14:31:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 14:31:59,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:31:59,361 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-08 14:31:59,362 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-08 14:31:59,362 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-08 14:31:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:59,363 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 14:31:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:31:59,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:59,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:59,363 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-08 14:31:59,363 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-08 14:31:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:31:59,365 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 14:31:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:31:59,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:31:59,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:31:59,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:31:59,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:31:59,366 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-08 14:31:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-08 14:31:59,367 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-08 14:31:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:31:59,367 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-08 14:31:59,367 INFO L479 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-08 14:31:59,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-08 14:31:59,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:31:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 14:31:59,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:59,567 INFO L499 BasicCegarLoop]: 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-08 14:31:59,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 14:31:59,771 WARN L460 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-08 14:31:59,771 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-08 14:31:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:59,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846875468] [2022-04-08 14:31:59,878 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:31:59,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:31:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-08 14:31:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:59,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457334043] [2022-04-08 14:31:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:59,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:31:59,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139262719] [2022-04-08 14:31:59,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:31:59,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:31:59,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:59,893 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-08 14:31:59,901 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-08 14:31:59,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:31:59,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:31:59,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:31:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:59,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:00,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-08 14:32:00,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7146#(<= ~counter~0 0)} {7138#true} #61#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {7146#(<= ~counter~0 0)} call #t~ret6 := main(); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {7146#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {7146#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {7146#(<= ~counter~0 0)} ~cond := #in~cond; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {7146#(<= ~counter~0 0)} assume !(0 == ~cond); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7146#(<= ~counter~0 0)} {7146#(<= ~counter~0 0)} #53#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {7146#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:00,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {7146#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:00,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {7180#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:00,291 INFO L272 TraceCheckUtils]: 14: Hoare triple {7180#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:00,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {7180#(<= ~counter~0 1)} ~cond := #in~cond; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:00,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {7180#(<= ~counter~0 1)} assume !(0 == ~cond); {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:00,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {7180#(<= ~counter~0 1)} assume true; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:00,292 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7180#(<= ~counter~0 1)} {7180#(<= ~counter~0 1)} #55#return; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:00,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {7180#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:00,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {7180#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:00,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {7205#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:00,293 INFO L272 TraceCheckUtils]: 22: Hoare triple {7205#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:00,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {7205#(<= ~counter~0 2)} ~cond := #in~cond; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:00,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {7205#(<= ~counter~0 2)} assume !(0 == ~cond); {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:00,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {7205#(<= ~counter~0 2)} assume true; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:00,294 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7205#(<= ~counter~0 2)} {7205#(<= ~counter~0 2)} #55#return; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:00,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {7205#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:00,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {7205#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:00,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {7230#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:00,296 INFO L272 TraceCheckUtils]: 30: Hoare triple {7230#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:00,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {7230#(<= ~counter~0 3)} ~cond := #in~cond; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:00,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {7230#(<= ~counter~0 3)} assume !(0 == ~cond); {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:00,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {7230#(<= ~counter~0 3)} assume true; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:00,297 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7230#(<= ~counter~0 3)} {7230#(<= ~counter~0 3)} #55#return; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:00,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {7230#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:00,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {7230#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:00,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {7255#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:00,299 INFO L272 TraceCheckUtils]: 38: Hoare triple {7255#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:00,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {7255#(<= ~counter~0 4)} ~cond := #in~cond; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:00,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {7255#(<= ~counter~0 4)} assume !(0 == ~cond); {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:00,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {7255#(<= ~counter~0 4)} assume true; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:00,300 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7255#(<= ~counter~0 4)} {7255#(<= ~counter~0 4)} #55#return; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:00,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {7255#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:00,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {7255#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:00,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {7280#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:00,301 INFO L272 TraceCheckUtils]: 46: Hoare triple {7280#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:00,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {7280#(<= ~counter~0 5)} ~cond := #in~cond; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:00,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {7280#(<= ~counter~0 5)} assume !(0 == ~cond); {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:00,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {7280#(<= ~counter~0 5)} assume true; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:00,302 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7280#(<= ~counter~0 5)} {7280#(<= ~counter~0 5)} #55#return; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:00,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {7280#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:00,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {7280#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:00,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {7305#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:00,304 INFO L272 TraceCheckUtils]: 54: Hoare triple {7305#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:00,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {7305#(<= ~counter~0 6)} ~cond := #in~cond; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:00,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {7305#(<= ~counter~0 6)} assume !(0 == ~cond); {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:00,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= ~counter~0 6)} assume true; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:00,305 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7305#(<= ~counter~0 6)} {7305#(<= ~counter~0 6)} #55#return; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:00,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {7305#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:00,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {7305#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7330#(<= |main_#t~post5| 6)} is VALID [2022-04-08 14:32:00,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {7330#(<= |main_#t~post5| 6)} assume !(#t~post5 < 100);havoc #t~post5; {7139#false} is VALID [2022-04-08 14:32:00,306 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 14:32:00,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 14:32:00,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {7139#false} assume !(0 == ~cond); {7139#false} is VALID [2022-04-08 14:32:00,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {7139#false} assume true; {7139#false} is VALID [2022-04-08 14:32:00,306 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7139#false} {7139#false} #57#return; {7139#false} is VALID [2022-04-08 14:32:00,306 INFO L272 TraceCheckUtils]: 67: Hoare triple {7139#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 14:32:00,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 14:32:00,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-08 14:32:00,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-08 14:32:00,307 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-08 14:32:00,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:00,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-08 14:32:00,681 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-08 14:32:00,681 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 14:32:00,682 INFO L272 TraceCheckUtils]: 67: Hoare triple {7139#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 14:32:00,682 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7138#true} {7139#false} #57#return; {7139#false} is VALID [2022-04-08 14:32:00,682 INFO L290 TraceCheckUtils]: 65: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:32:00,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:32:00,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:32:00,682 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:32:00,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {7388#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {7139#false} is VALID [2022-04-08 14:32:00,683 INFO L290 TraceCheckUtils]: 60: Hoare triple {7392#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7388#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:32:00,683 INFO L290 TraceCheckUtils]: 59: Hoare triple {7392#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7392#(< ~counter~0 100)} is VALID [2022-04-08 14:32:00,683 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7138#true} {7392#(< ~counter~0 100)} #55#return; {7392#(< ~counter~0 100)} is VALID [2022-04-08 14:32:00,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:32:00,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:32:00,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:32:00,684 INFO L272 TraceCheckUtils]: 54: Hoare triple {7392#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:32:00,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {7392#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {7392#(< ~counter~0 100)} is VALID [2022-04-08 14:32:00,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {7417#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7392#(< ~counter~0 100)} is VALID [2022-04-08 14:32:00,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {7417#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7417#(< ~counter~0 99)} is VALID [2022-04-08 14:32:00,685 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7138#true} {7417#(< ~counter~0 99)} #55#return; {7417#(< ~counter~0 99)} is VALID [2022-04-08 14:32:00,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:32:00,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:32:00,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:32:00,685 INFO L272 TraceCheckUtils]: 46: Hoare triple {7417#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:32:00,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {7417#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {7417#(< ~counter~0 99)} is VALID [2022-04-08 14:32:00,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {7442#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7417#(< ~counter~0 99)} is VALID [2022-04-08 14:32:00,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {7442#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7442#(< ~counter~0 98)} is VALID [2022-04-08 14:32:00,687 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7138#true} {7442#(< ~counter~0 98)} #55#return; {7442#(< ~counter~0 98)} is VALID [2022-04-08 14:32:00,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:32:00,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:32:00,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:32:00,687 INFO L272 TraceCheckUtils]: 38: Hoare triple {7442#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:32:00,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {7442#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {7442#(< ~counter~0 98)} is VALID [2022-04-08 14:32:00,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7442#(< ~counter~0 98)} is VALID [2022-04-08 14:32:00,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7467#(< ~counter~0 97)} is VALID [2022-04-08 14:32:00,689 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7138#true} {7467#(< ~counter~0 97)} #55#return; {7467#(< ~counter~0 97)} is VALID [2022-04-08 14:32:00,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:32:00,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:32:00,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:32:00,689 INFO L272 TraceCheckUtils]: 30: Hoare triple {7467#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:32:00,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {7467#(< ~counter~0 97)} is VALID [2022-04-08 14:32:00,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {7492#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7467#(< ~counter~0 97)} is VALID [2022-04-08 14:32:00,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {7492#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7492#(< ~counter~0 96)} is VALID [2022-04-08 14:32:00,690 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7138#true} {7492#(< ~counter~0 96)} #55#return; {7492#(< ~counter~0 96)} is VALID [2022-04-08 14:32:00,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:32:00,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:32:00,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:32:00,691 INFO L272 TraceCheckUtils]: 22: Hoare triple {7492#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:32:00,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {7492#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {7492#(< ~counter~0 96)} is VALID [2022-04-08 14:32:00,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {7517#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7492#(< ~counter~0 96)} is VALID [2022-04-08 14:32:00,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {7517#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7517#(< ~counter~0 95)} is VALID [2022-04-08 14:32:00,692 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7138#true} {7517#(< ~counter~0 95)} #55#return; {7517#(< ~counter~0 95)} is VALID [2022-04-08 14:32:00,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:32:00,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:32:00,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:32:00,692 INFO L272 TraceCheckUtils]: 14: Hoare triple {7517#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:32:00,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {7517#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {7517#(< ~counter~0 95)} is VALID [2022-04-08 14:32:00,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {7542#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7517#(< ~counter~0 95)} is VALID [2022-04-08 14:32:00,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {7542#(< ~counter~0 94)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7542#(< ~counter~0 94)} is VALID [2022-04-08 14:32:00,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7138#true} {7542#(< ~counter~0 94)} #53#return; {7542#(< ~counter~0 94)} is VALID [2022-04-08 14:32:00,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:32:00,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:32:00,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:32:00,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {7542#(< ~counter~0 94)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:32:00,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {7542#(< ~counter~0 94)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7542#(< ~counter~0 94)} is VALID [2022-04-08 14:32:00,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {7542#(< ~counter~0 94)} call #t~ret6 := main(); {7542#(< ~counter~0 94)} is VALID [2022-04-08 14:32:00,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7542#(< ~counter~0 94)} {7138#true} #61#return; {7542#(< ~counter~0 94)} is VALID [2022-04-08 14:32:00,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {7542#(< ~counter~0 94)} assume true; {7542#(< ~counter~0 94)} is VALID [2022-04-08 14:32:00,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7542#(< ~counter~0 94)} is VALID [2022-04-08 14:32:00,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-08 14:32:00,697 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-08 14:32:00,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457334043] [2022-04-08 14:32:00,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139262719] [2022-04-08 14:32:00,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139262719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:00,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:00,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 14:32:00,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846875468] [2022-04-08 14:32:00,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846875468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:00,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:00,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:32:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731554422] [2022-04-08 14:32:00,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:00,699 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-08 14:32:00,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:00,699 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-08 14:32:00,746 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-08 14:32:00,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:32:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:32:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:32:00,747 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-08 14:32:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:00,997 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-08 14:32:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:32:00,997 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-08 14:32:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:00,998 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-08 14:32:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 14:32:01,000 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-08 14:32:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 14:32:01,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-08 14:32:01,089 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-08 14:32:01,090 INFO L225 Difference]: With dead ends: 86 [2022-04-08 14:32:01,090 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:32:01,090 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:32:01,091 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:01,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:32:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 14:32:01,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:01,173 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-08 14:32:01,173 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-08 14:32:01,173 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-08 14:32:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:01,175 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:32:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:32:01,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:01,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:01,176 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-08 14:32:01,176 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-08 14:32:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:01,177 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:32:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:32:01,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:01,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:01,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:01,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:01,178 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-08 14:32:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-08 14:32:01,179 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-08 14:32:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:01,180 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-08 14:32:01,180 INFO L479 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-08 14:32:01,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-08 14:32:01,347 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-08 14:32:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:32:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 14:32:01,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:01,348 INFO L499 BasicCegarLoop]: 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-08 14:32:01,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 14:32:01,549 WARN L460 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-08 14:32:01,549 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-08 14:32:01,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:01,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756838506] [2022-04-08 14:32:01,642 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:01,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-08 14:32:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:01,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691246206] [2022-04-08 14:32:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:01,654 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:01,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616703424] [2022-04-08 14:32:01,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:32:01,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:01,656 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-08 14:32:01,675 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-08 14:32:07,403 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:32:07,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:07,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 14:32:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:07,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:07,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {8069#true} call ULTIMATE.init(); {8069#true} is VALID [2022-04-08 14:32:07,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {8069#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8069#true} is VALID [2022-04-08 14:32:07,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8069#true} {8069#true} #61#return; {8069#true} is VALID [2022-04-08 14:32:07,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {8069#true} call #t~ret6 := main(); {8069#true} is VALID [2022-04-08 14:32:07,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {8069#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8069#true} is VALID [2022-04-08 14:32:07,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {8069#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8069#true} {8069#true} #53#return; {8069#true} is VALID [2022-04-08 14:32:07,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {8069#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:07,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:07,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:07,942 INFO L272 TraceCheckUtils]: 14: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,943 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8069#true} {8107#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:07,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:32:07,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:32:07,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:32:07,948 INFO L272 TraceCheckUtils]: 22: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,949 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8069#true} {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:32:07,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:32:07,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:32:07,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:32:07,951 INFO L272 TraceCheckUtils]: 30: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,952 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8069#true} {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:32:07,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:32:07,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:32:07,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:32:07,954 INFO L272 TraceCheckUtils]: 38: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,955 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8069#true} {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:32:07,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:32:07,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:32:07,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:32:07,957 INFO L272 TraceCheckUtils]: 46: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,958 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8069#true} {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:32:07,958 INFO L290 TraceCheckUtils]: 51: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:32:07,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:32:07,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 100);havoc #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:32:07,959 INFO L272 TraceCheckUtils]: 54: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,959 INFO L290 TraceCheckUtils]: 55: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,960 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8069#true} {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:32:07,961 INFO L290 TraceCheckUtils]: 59: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:32:07,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:32:07,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:32:07,962 INFO L272 TraceCheckUtils]: 62: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,962 INFO L290 TraceCheckUtils]: 64: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,963 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8069#true} {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:32:07,964 INFO L290 TraceCheckUtils]: 67: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:32:07,964 INFO L272 TraceCheckUtils]: 68: Hoare triple {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:32:07,964 INFO L290 TraceCheckUtils]: 69: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:32:07,964 INFO L290 TraceCheckUtils]: 70: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:32:07,964 INFO L290 TraceCheckUtils]: 71: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:32:07,965 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8069#true} {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:32:07,965 INFO L272 TraceCheckUtils]: 73: Hoare triple {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:07,966 INFO L290 TraceCheckUtils]: 74: Hoare triple {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:07,966 INFO L290 TraceCheckUtils]: 75: Hoare triple {8305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8070#false} is VALID [2022-04-08 14:32:07,966 INFO L290 TraceCheckUtils]: 76: Hoare triple {8070#false} assume !false; {8070#false} is VALID [2022-04-08 14:32:07,967 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-08 14:32:07,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:08,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691246206] [2022-04-08 14:32:08,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:08,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616703424] [2022-04-08 14:32:08,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616703424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:08,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:08,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 14:32:08,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:08,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756838506] [2022-04-08 14:32:08,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756838506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:08,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:08,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:32:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548153964] [2022-04-08 14:32:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:08,724 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-08 14:32:08,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:08,724 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-08 14:32:08,768 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-08 14:32:08,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:32:08,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:32:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:32:08,769 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-08 14:32:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:09,506 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-08 14:32:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:32:09,507 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-08 14:32:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:09,507 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-08 14:32:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 14:32:09,508 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-08 14:32:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 14:32:09,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-08 14:32:09,558 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-08 14:32:09,559 INFO L225 Difference]: With dead ends: 84 [2022-04-08 14:32:09,559 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 14:32:09,559 INFO L912 BasicCegarLoop]: 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-08 14:32:09,560 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:09,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:32:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 14:32:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 14:32:09,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:09,662 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-08 14:32:09,662 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-08 14:32:09,663 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-08 14:32:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:09,665 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 14:32:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:32:09,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:09,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:09,666 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-08 14:32:09,666 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-08 14:32:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:09,668 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 14:32:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:32:09,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:09,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:09,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:09,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:09,668 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-08 14:32:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-08 14:32:09,670 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-08 14:32:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:09,670 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-08 14:32:09,670 INFO L479 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-08 14:32:09,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-08 14:32:09,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:32:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 14:32:09,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:09,850 INFO L499 BasicCegarLoop]: 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-08 14:32:09,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 14:32:10,055 WARN L460 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-08 14:32:10,055 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-08 14:32:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:10,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [398193911] [2022-04-08 14:32:10,157 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:10,158 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-08 14:32:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:10,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276220383] [2022-04-08 14:32:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:10,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:10,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398242637] [2022-04-08 14:32:10,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:32:10,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:10,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:10,175 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-08 14:32:10,179 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-08 14:32:10,338 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 14:32:10,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:10,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:32:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:10,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:10,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-08 14:32:10,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#(<= ~counter~0 0)} {8955#true} #61#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#(<= ~counter~0 0)} call #t~ret6 := main(); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {8963#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,747 INFO L272 TraceCheckUtils]: 6: Hoare triple {8963#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#(<= ~counter~0 0)} ~cond := #in~cond; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#(<= ~counter~0 0)} assume !(0 == ~cond); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#(<= ~counter~0 0)} {8963#(<= ~counter~0 0)} #53#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {8963#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:10,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {8963#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:10,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {8997#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:10,751 INFO L272 TraceCheckUtils]: 14: Hoare triple {8997#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:10,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#(<= ~counter~0 1)} ~cond := #in~cond; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:10,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#(<= ~counter~0 1)} assume !(0 == ~cond); {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:10,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#(<= ~counter~0 1)} assume true; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:10,752 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8997#(<= ~counter~0 1)} {8997#(<= ~counter~0 1)} #55#return; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:10,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {8997#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:10,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {8997#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:10,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {9022#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:10,753 INFO L272 TraceCheckUtils]: 22: Hoare triple {9022#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:10,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#(<= ~counter~0 2)} ~cond := #in~cond; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:10,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#(<= ~counter~0 2)} assume !(0 == ~cond); {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:10,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {9022#(<= ~counter~0 2)} assume true; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:10,754 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9022#(<= ~counter~0 2)} {9022#(<= ~counter~0 2)} #55#return; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:10,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {9022#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:10,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {9022#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:10,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {9047#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:10,756 INFO L272 TraceCheckUtils]: 30: Hoare triple {9047#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:10,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {9047#(<= ~counter~0 3)} ~cond := #in~cond; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:10,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {9047#(<= ~counter~0 3)} assume !(0 == ~cond); {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:10,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {9047#(<= ~counter~0 3)} assume true; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:10,757 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9047#(<= ~counter~0 3)} {9047#(<= ~counter~0 3)} #55#return; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:10,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {9047#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:10,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {9047#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:10,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {9072#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:10,759 INFO L272 TraceCheckUtils]: 38: Hoare triple {9072#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:10,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {9072#(<= ~counter~0 4)} ~cond := #in~cond; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:10,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {9072#(<= ~counter~0 4)} assume !(0 == ~cond); {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:10,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {9072#(<= ~counter~0 4)} assume true; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:10,760 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9072#(<= ~counter~0 4)} {9072#(<= ~counter~0 4)} #55#return; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:10,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {9072#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:10,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {9072#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:10,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {9097#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:10,761 INFO L272 TraceCheckUtils]: 46: Hoare triple {9097#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:10,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {9097#(<= ~counter~0 5)} ~cond := #in~cond; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:10,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {9097#(<= ~counter~0 5)} assume !(0 == ~cond); {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:10,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {9097#(<= ~counter~0 5)} assume true; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:10,762 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9097#(<= ~counter~0 5)} {9097#(<= ~counter~0 5)} #55#return; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:10,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {9097#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:10,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {9097#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:10,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {9122#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:10,764 INFO L272 TraceCheckUtils]: 54: Hoare triple {9122#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:10,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {9122#(<= ~counter~0 6)} ~cond := #in~cond; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:10,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {9122#(<= ~counter~0 6)} assume !(0 == ~cond); {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:10,765 INFO L290 TraceCheckUtils]: 57: Hoare triple {9122#(<= ~counter~0 6)} assume true; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:10,765 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9122#(<= ~counter~0 6)} {9122#(<= ~counter~0 6)} #55#return; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:10,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {9122#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:10,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {9122#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:10,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {9147#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:10,767 INFO L272 TraceCheckUtils]: 62: Hoare triple {9147#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:10,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {9147#(<= ~counter~0 7)} ~cond := #in~cond; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:10,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {9147#(<= ~counter~0 7)} assume !(0 == ~cond); {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:10,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {9147#(<= ~counter~0 7)} assume true; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:10,768 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9147#(<= ~counter~0 7)} {9147#(<= ~counter~0 7)} #55#return; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:10,768 INFO L290 TraceCheckUtils]: 67: Hoare triple {9147#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:10,768 INFO L290 TraceCheckUtils]: 68: Hoare triple {9147#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9172#(<= |main_#t~post5| 7)} is VALID [2022-04-08 14:32:10,769 INFO L290 TraceCheckUtils]: 69: Hoare triple {9172#(<= |main_#t~post5| 7)} assume !(#t~post5 < 100);havoc #t~post5; {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L272 TraceCheckUtils]: 70: Hoare triple {8956#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L290 TraceCheckUtils]: 71: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L290 TraceCheckUtils]: 72: Hoare triple {8956#false} assume !(0 == ~cond); {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L290 TraceCheckUtils]: 73: Hoare triple {8956#false} assume true; {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8956#false} {8956#false} #57#return; {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L272 TraceCheckUtils]: 75: Hoare triple {8956#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-08 14:32:10,769 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-08 14:32:10,770 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-08 14:32:10,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:11,192 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-08 14:32:11,192 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-08 14:32:11,192 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 14:32:11,192 INFO L272 TraceCheckUtils]: 75: Hoare triple {8956#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 14:32:11,192 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8955#true} {8956#false} #57#return; {8956#false} is VALID [2022-04-08 14:32:11,192 INFO L290 TraceCheckUtils]: 73: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,193 INFO L290 TraceCheckUtils]: 72: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,193 INFO L290 TraceCheckUtils]: 71: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,193 INFO L272 TraceCheckUtils]: 70: Hoare triple {8956#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,193 INFO L290 TraceCheckUtils]: 69: Hoare triple {9230#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {8956#false} is VALID [2022-04-08 14:32:11,193 INFO L290 TraceCheckUtils]: 68: Hoare triple {9234#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9230#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:32:11,194 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9234#(< ~counter~0 100)} is VALID [2022-04-08 14:32:11,194 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8955#true} {9234#(< ~counter~0 100)} #55#return; {9234#(< ~counter~0 100)} is VALID [2022-04-08 14:32:11,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,194 INFO L272 TraceCheckUtils]: 62: Hoare triple {9234#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {9234#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {9234#(< ~counter~0 100)} is VALID [2022-04-08 14:32:11,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {9259#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(< ~counter~0 100)} is VALID [2022-04-08 14:32:11,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {9259#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9259#(< ~counter~0 99)} is VALID [2022-04-08 14:32:11,196 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8955#true} {9259#(< ~counter~0 99)} #55#return; {9259#(< ~counter~0 99)} is VALID [2022-04-08 14:32:11,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,196 INFO L290 TraceCheckUtils]: 55: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,196 INFO L272 TraceCheckUtils]: 54: Hoare triple {9259#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {9259#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {9259#(< ~counter~0 99)} is VALID [2022-04-08 14:32:11,200 INFO L290 TraceCheckUtils]: 52: Hoare triple {9284#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(< ~counter~0 99)} is VALID [2022-04-08 14:32:11,200 INFO L290 TraceCheckUtils]: 51: Hoare triple {9284#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9284#(< ~counter~0 98)} is VALID [2022-04-08 14:32:11,200 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8955#true} {9284#(< ~counter~0 98)} #55#return; {9284#(< ~counter~0 98)} is VALID [2022-04-08 14:32:11,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,201 INFO L290 TraceCheckUtils]: 47: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,201 INFO L272 TraceCheckUtils]: 46: Hoare triple {9284#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {9284#(< ~counter~0 98)} is VALID [2022-04-08 14:32:11,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {9309#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9284#(< ~counter~0 98)} is VALID [2022-04-08 14:32:11,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {9309#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9309#(< ~counter~0 97)} is VALID [2022-04-08 14:32:11,202 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8955#true} {9309#(< ~counter~0 97)} #55#return; {9309#(< ~counter~0 97)} is VALID [2022-04-08 14:32:11,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,202 INFO L272 TraceCheckUtils]: 38: Hoare triple {9309#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {9309#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {9309#(< ~counter~0 97)} is VALID [2022-04-08 14:32:11,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {9334#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9309#(< ~counter~0 97)} is VALID [2022-04-08 14:32:11,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {9334#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9334#(< ~counter~0 96)} is VALID [2022-04-08 14:32:11,204 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8955#true} {9334#(< ~counter~0 96)} #55#return; {9334#(< ~counter~0 96)} is VALID [2022-04-08 14:32:11,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,204 INFO L272 TraceCheckUtils]: 30: Hoare triple {9334#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {9334#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {9334#(< ~counter~0 96)} is VALID [2022-04-08 14:32:11,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {9359#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9334#(< ~counter~0 96)} is VALID [2022-04-08 14:32:11,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {9359#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9359#(< ~counter~0 95)} is VALID [2022-04-08 14:32:11,206 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8955#true} {9359#(< ~counter~0 95)} #55#return; {9359#(< ~counter~0 95)} is VALID [2022-04-08 14:32:11,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,206 INFO L272 TraceCheckUtils]: 22: Hoare triple {9359#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {9359#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {9359#(< ~counter~0 95)} is VALID [2022-04-08 14:32:11,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {9384#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9359#(< ~counter~0 95)} is VALID [2022-04-08 14:32:11,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {9384#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9384#(< ~counter~0 94)} is VALID [2022-04-08 14:32:11,207 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8955#true} {9384#(< ~counter~0 94)} #55#return; {9384#(< ~counter~0 94)} is VALID [2022-04-08 14:32:11,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,208 INFO L272 TraceCheckUtils]: 14: Hoare triple {9384#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {9384#(< ~counter~0 94)} is VALID [2022-04-08 14:32:11,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {9409#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9384#(< ~counter~0 94)} is VALID [2022-04-08 14:32:11,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {9409#(< ~counter~0 93)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9409#(< ~counter~0 93)} is VALID [2022-04-08 14:32:11,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8955#true} {9409#(< ~counter~0 93)} #53#return; {9409#(< ~counter~0 93)} is VALID [2022-04-08 14:32:11,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:32:11,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:32:11,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:32:11,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {9409#(< ~counter~0 93)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:32:11,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {9409#(< ~counter~0 93)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9409#(< ~counter~0 93)} is VALID [2022-04-08 14:32:11,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {9409#(< ~counter~0 93)} call #t~ret6 := main(); {9409#(< ~counter~0 93)} is VALID [2022-04-08 14:32:11,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9409#(< ~counter~0 93)} {8955#true} #61#return; {9409#(< ~counter~0 93)} is VALID [2022-04-08 14:32:11,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {9409#(< ~counter~0 93)} assume true; {9409#(< ~counter~0 93)} is VALID [2022-04-08 14:32:11,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9409#(< ~counter~0 93)} is VALID [2022-04-08 14:32:11,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-08 14:32:11,211 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-08 14:32:11,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:11,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276220383] [2022-04-08 14:32:11,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:11,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398242637] [2022-04-08 14:32:11,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398242637] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:11,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:11,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 14:32:11,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:11,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [398193911] [2022-04-08 14:32:11,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [398193911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:11,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:11,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:32:11,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392574531] [2022-04-08 14:32:11,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:11,213 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-08 14:32:11,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:11,214 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-08 14:32:11,268 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-08 14:32:11,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:32:11,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:11,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:32:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:32:11,269 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-08 14:32:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:11,585 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-08 14:32:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:32:11,585 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-08 14:32:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:11,586 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-08 14:32:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 14:32:11,587 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-08 14:32:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 14:32:11,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-08 14:32:11,652 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-08 14:32:11,653 INFO L225 Difference]: With dead ends: 94 [2022-04-08 14:32:11,653 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 14:32:11,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-08 14:32:11,654 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:11,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 14:32:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 14:32:11,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:11,751 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-08 14:32:11,751 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-08 14:32:11,751 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-08 14:32:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:11,753 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:32:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:32:11,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:11,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:11,753 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-08 14:32:11,754 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-08 14:32:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:11,755 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:32:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:32:11,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:11,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:11,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:11,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:11,756 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-08 14:32:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-08 14:32:11,757 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-08 14:32:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:11,758 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-08 14:32:11,758 INFO L479 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-08 14:32:11,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-08 14:32:11,997 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-08 14:32:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:32:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 14:32:11,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:11,998 INFO L499 BasicCegarLoop]: 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-08 14:32:12,003 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-08 14:32:12,203 WARN L460 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-08 14:32:12,203 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-08 14:32:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:12,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825335418] [2022-04-08 14:32:12,289 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:12,289 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-08 14:32:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:12,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808036985] [2022-04-08 14:32:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:12,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:12,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338174307] [2022-04-08 14:32:12,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:12,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:12,306 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-08 14:32:12,312 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-08 14:32:13,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:13,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:13,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 14:32:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:13,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:13,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {9986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #61#return; {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret6 := main(); {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {9986#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {9986#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9986#true} {9986#true} #53#return; {9986#true} is VALID [2022-04-08 14:32:13,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {9986#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:13,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:13,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:13,846 INFO L272 TraceCheckUtils]: 14: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,847 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9986#true} {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:13,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:32:13,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:32:13,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:32:13,849 INFO L272 TraceCheckUtils]: 22: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,849 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9986#true} {10049#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:32:13,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:32:13,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:32:13,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:32:13,851 INFO L272 TraceCheckUtils]: 30: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,852 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9986#true} {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:32:13,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:32:13,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:32:13,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:32:13,853 INFO L272 TraceCheckUtils]: 38: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,854 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9986#true} {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:32:13,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:32:13,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:32:13,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:32:13,855 INFO L272 TraceCheckUtils]: 46: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,856 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9986#true} {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:32:13,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:32:13,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:32:13,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:32:13,857 INFO L272 TraceCheckUtils]: 54: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,858 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9986#true} {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:32:13,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:32:13,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:32:13,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:32:13,859 INFO L272 TraceCheckUtils]: 62: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,859 INFO L290 TraceCheckUtils]: 64: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,860 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9986#true} {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:32:13,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:32:13,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:32:13,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:32:13,861 INFO L272 TraceCheckUtils]: 70: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,862 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9986#true} {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:32:13,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:32:13,862 INFO L272 TraceCheckUtils]: 76: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:32:13,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:32:13,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:32:13,863 INFO L290 TraceCheckUtils]: 79: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:32:13,863 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9986#true} {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:32:13,864 INFO L272 TraceCheckUtils]: 81: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:13,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:13,864 INFO L290 TraceCheckUtils]: 83: Hoare triple {10247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9987#false} is VALID [2022-04-08 14:32:13,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-08 14:32:13,865 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-08 14:32:13,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:14,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808036985] [2022-04-08 14:32:14,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:14,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338174307] [2022-04-08 14:32:14,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338174307] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:14,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:14,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 14:32:14,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:14,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825335418] [2022-04-08 14:32:14,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825335418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:14,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:14,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:32:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876702087] [2022-04-08 14:32:14,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:14,148 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-08 14:32:14,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:14,149 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-08 14:32:14,194 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-08 14:32:14,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:32:14,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:14,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:32:14,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:32:14,195 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-08 14:32:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:15,039 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-08 14:32:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:32:15,040 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-08 14:32:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:15,040 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-08 14:32:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 14:32:15,043 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-08 14:32:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 14:32:15,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-08 14:32:15,118 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-08 14:32:15,119 INFO L225 Difference]: With dead ends: 92 [2022-04-08 14:32:15,119 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 14:32:15,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:32:15,120 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:15,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 431 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:32:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 14:32:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 14:32:15,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:15,232 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-08 14:32:15,232 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-08 14:32:15,232 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-08 14:32:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:15,234 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 14:32:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:32:15,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:15,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:15,234 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-08 14:32:15,235 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-08 14:32:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:15,236 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 14:32:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:32:15,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:15,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:15,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:15,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:15,237 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-08 14:32:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-08 14:32:15,238 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-08 14:32:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:15,238 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-08 14:32:15,239 INFO L479 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-08 14:32:15,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-08 14:32:15,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:32:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 14:32:15,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:15,417 INFO L499 BasicCegarLoop]: 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-08 14:32:15,423 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-08 14:32:15,622 WARN L460 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-08 14:32:15,623 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-08 14:32:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:15,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797385788] [2022-04-08 14:32:15,705 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:15,705 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-08 14:32:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:15,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340296134] [2022-04-08 14:32:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:15,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:15,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817481030] [2022-04-08 14:32:15,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:15,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:15,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:15,719 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-08 14:32:15,730 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-08 14:32:15,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:15,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:15,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:32:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:15,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:16,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-08 14:32:16,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10853#(<= ~counter~0 0)} {10845#true} #61#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {10853#(<= ~counter~0 0)} call #t~ret6 := main(); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {10853#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {10853#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {10853#(<= ~counter~0 0)} ~cond := #in~cond; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {10853#(<= ~counter~0 0)} assume !(0 == ~cond); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10853#(<= ~counter~0 0)} {10853#(<= ~counter~0 0)} #53#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {10853#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:16,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {10853#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:16,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {10887#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:16,239 INFO L272 TraceCheckUtils]: 14: Hoare triple {10887#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:16,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {10887#(<= ~counter~0 1)} ~cond := #in~cond; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:16,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {10887#(<= ~counter~0 1)} assume !(0 == ~cond); {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:16,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {10887#(<= ~counter~0 1)} assume true; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:16,240 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10887#(<= ~counter~0 1)} {10887#(<= ~counter~0 1)} #55#return; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:16,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {10887#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:16,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {10887#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:16,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {10912#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:16,242 INFO L272 TraceCheckUtils]: 22: Hoare triple {10912#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:16,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {10912#(<= ~counter~0 2)} ~cond := #in~cond; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:16,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {10912#(<= ~counter~0 2)} assume !(0 == ~cond); {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:16,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {10912#(<= ~counter~0 2)} assume true; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:16,243 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10912#(<= ~counter~0 2)} {10912#(<= ~counter~0 2)} #55#return; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:16,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {10912#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:16,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {10912#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:16,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {10937#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:16,245 INFO L272 TraceCheckUtils]: 30: Hoare triple {10937#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:16,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(<= ~counter~0 3)} ~cond := #in~cond; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:16,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {10937#(<= ~counter~0 3)} assume !(0 == ~cond); {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:16,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {10937#(<= ~counter~0 3)} assume true; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:16,246 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10937#(<= ~counter~0 3)} {10937#(<= ~counter~0 3)} #55#return; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:16,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {10937#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:16,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {10937#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:16,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {10962#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:16,247 INFO L272 TraceCheckUtils]: 38: Hoare triple {10962#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:16,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(<= ~counter~0 4)} ~cond := #in~cond; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:16,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(<= ~counter~0 4)} assume !(0 == ~cond); {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:16,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {10962#(<= ~counter~0 4)} assume true; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:16,248 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10962#(<= ~counter~0 4)} {10962#(<= ~counter~0 4)} #55#return; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:16,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {10962#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:16,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {10962#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:16,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {10987#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:16,250 INFO L272 TraceCheckUtils]: 46: Hoare triple {10987#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:16,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {10987#(<= ~counter~0 5)} ~cond := #in~cond; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:16,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {10987#(<= ~counter~0 5)} assume !(0 == ~cond); {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:16,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {10987#(<= ~counter~0 5)} assume true; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:16,251 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10987#(<= ~counter~0 5)} {10987#(<= ~counter~0 5)} #55#return; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:16,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {10987#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:16,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {10987#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:16,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {11012#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:16,252 INFO L272 TraceCheckUtils]: 54: Hoare triple {11012#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:16,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {11012#(<= ~counter~0 6)} ~cond := #in~cond; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:16,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {11012#(<= ~counter~0 6)} assume !(0 == ~cond); {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:16,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {11012#(<= ~counter~0 6)} assume true; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:16,254 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11012#(<= ~counter~0 6)} {11012#(<= ~counter~0 6)} #55#return; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:16,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {11012#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:16,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {11012#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:16,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {11037#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:16,255 INFO L272 TraceCheckUtils]: 62: Hoare triple {11037#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:16,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {11037#(<= ~counter~0 7)} ~cond := #in~cond; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:16,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {11037#(<= ~counter~0 7)} assume !(0 == ~cond); {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:16,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {11037#(<= ~counter~0 7)} assume true; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:16,259 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11037#(<= ~counter~0 7)} {11037#(<= ~counter~0 7)} #55#return; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:16,260 INFO L290 TraceCheckUtils]: 67: Hoare triple {11037#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:16,260 INFO L290 TraceCheckUtils]: 68: Hoare triple {11037#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:16,261 INFO L290 TraceCheckUtils]: 69: Hoare triple {11062#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:16,261 INFO L272 TraceCheckUtils]: 70: Hoare triple {11062#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:16,262 INFO L290 TraceCheckUtils]: 71: Hoare triple {11062#(<= ~counter~0 8)} ~cond := #in~cond; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:16,262 INFO L290 TraceCheckUtils]: 72: Hoare triple {11062#(<= ~counter~0 8)} assume !(0 == ~cond); {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:16,263 INFO L290 TraceCheckUtils]: 73: Hoare triple {11062#(<= ~counter~0 8)} assume true; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:16,263 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11062#(<= ~counter~0 8)} {11062#(<= ~counter~0 8)} #55#return; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:16,264 INFO L290 TraceCheckUtils]: 75: Hoare triple {11062#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:16,264 INFO L290 TraceCheckUtils]: 76: Hoare triple {11062#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11087#(<= |main_#t~post5| 8)} is VALID [2022-04-08 14:32:16,264 INFO L290 TraceCheckUtils]: 77: Hoare triple {11087#(<= |main_#t~post5| 8)} assume !(#t~post5 < 100);havoc #t~post5; {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L272 TraceCheckUtils]: 78: Hoare triple {10846#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L290 TraceCheckUtils]: 79: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L290 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !(0 == ~cond); {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L290 TraceCheckUtils]: 81: Hoare triple {10846#false} assume true; {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10846#false} {10846#false} #57#return; {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L272 TraceCheckUtils]: 83: Hoare triple {10846#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-08 14:32:16,265 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-08 14:32:16,266 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-08 14:32:16,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:16,724 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-08 14:32:16,724 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-08 14:32:16,724 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 14:32:16,724 INFO L272 TraceCheckUtils]: 83: Hoare triple {10846#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 14:32:16,724 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10845#true} {10846#false} #57#return; {10846#false} is VALID [2022-04-08 14:32:16,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,724 INFO L272 TraceCheckUtils]: 78: Hoare triple {10846#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,725 INFO L290 TraceCheckUtils]: 77: Hoare triple {11145#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {10846#false} is VALID [2022-04-08 14:32:16,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {11149#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11145#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:32:16,725 INFO L290 TraceCheckUtils]: 75: Hoare triple {11149#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11149#(< ~counter~0 100)} is VALID [2022-04-08 14:32:16,726 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10845#true} {11149#(< ~counter~0 100)} #55#return; {11149#(< ~counter~0 100)} is VALID [2022-04-08 14:32:16,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,726 INFO L272 TraceCheckUtils]: 70: Hoare triple {11149#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {11149#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {11149#(< ~counter~0 100)} is VALID [2022-04-08 14:32:16,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {11174#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11149#(< ~counter~0 100)} is VALID [2022-04-08 14:32:16,727 INFO L290 TraceCheckUtils]: 67: Hoare triple {11174#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11174#(< ~counter~0 99)} is VALID [2022-04-08 14:32:16,728 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10845#true} {11174#(< ~counter~0 99)} #55#return; {11174#(< ~counter~0 99)} is VALID [2022-04-08 14:32:16,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,728 INFO L272 TraceCheckUtils]: 62: Hoare triple {11174#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {11174#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {11174#(< ~counter~0 99)} is VALID [2022-04-08 14:32:16,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {11199#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11174#(< ~counter~0 99)} is VALID [2022-04-08 14:32:16,729 INFO L290 TraceCheckUtils]: 59: Hoare triple {11199#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11199#(< ~counter~0 98)} is VALID [2022-04-08 14:32:16,729 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10845#true} {11199#(< ~counter~0 98)} #55#return; {11199#(< ~counter~0 98)} is VALID [2022-04-08 14:32:16,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,730 INFO L272 TraceCheckUtils]: 54: Hoare triple {11199#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {11199#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {11199#(< ~counter~0 98)} is VALID [2022-04-08 14:32:16,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {11224#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11199#(< ~counter~0 98)} is VALID [2022-04-08 14:32:16,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {11224#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11224#(< ~counter~0 97)} is VALID [2022-04-08 14:32:16,731 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10845#true} {11224#(< ~counter~0 97)} #55#return; {11224#(< ~counter~0 97)} is VALID [2022-04-08 14:32:16,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,732 INFO L272 TraceCheckUtils]: 46: Hoare triple {11224#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {11224#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {11224#(< ~counter~0 97)} is VALID [2022-04-08 14:32:16,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {11249#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11224#(< ~counter~0 97)} is VALID [2022-04-08 14:32:16,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {11249#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11249#(< ~counter~0 96)} is VALID [2022-04-08 14:32:16,733 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10845#true} {11249#(< ~counter~0 96)} #55#return; {11249#(< ~counter~0 96)} is VALID [2022-04-08 14:32:16,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,733 INFO L272 TraceCheckUtils]: 38: Hoare triple {11249#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {11249#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {11249#(< ~counter~0 96)} is VALID [2022-04-08 14:32:16,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {11274#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11249#(< ~counter~0 96)} is VALID [2022-04-08 14:32:16,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {11274#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11274#(< ~counter~0 95)} is VALID [2022-04-08 14:32:16,735 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10845#true} {11274#(< ~counter~0 95)} #55#return; {11274#(< ~counter~0 95)} is VALID [2022-04-08 14:32:16,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,735 INFO L272 TraceCheckUtils]: 30: Hoare triple {11274#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {11274#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {11274#(< ~counter~0 95)} is VALID [2022-04-08 14:32:16,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {11299#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11274#(< ~counter~0 95)} is VALID [2022-04-08 14:32:16,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {11299#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11299#(< ~counter~0 94)} is VALID [2022-04-08 14:32:16,737 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10845#true} {11299#(< ~counter~0 94)} #55#return; {11299#(< ~counter~0 94)} is VALID [2022-04-08 14:32:16,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,737 INFO L272 TraceCheckUtils]: 22: Hoare triple {11299#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {11299#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {11299#(< ~counter~0 94)} is VALID [2022-04-08 14:32:16,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {11324#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11299#(< ~counter~0 94)} is VALID [2022-04-08 14:32:16,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {11324#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11324#(< ~counter~0 93)} is VALID [2022-04-08 14:32:16,738 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10845#true} {11324#(< ~counter~0 93)} #55#return; {11324#(< ~counter~0 93)} is VALID [2022-04-08 14:32:16,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,739 INFO L272 TraceCheckUtils]: 14: Hoare triple {11324#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {11324#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {11324#(< ~counter~0 93)} is VALID [2022-04-08 14:32:16,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {11349#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11324#(< ~counter~0 93)} is VALID [2022-04-08 14:32:16,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {11349#(< ~counter~0 92)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11349#(< ~counter~0 92)} is VALID [2022-04-08 14:32:16,740 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10845#true} {11349#(< ~counter~0 92)} #53#return; {11349#(< ~counter~0 92)} is VALID [2022-04-08 14:32:16,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:32:16,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:32:16,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:32:16,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {11349#(< ~counter~0 92)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:32:16,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {11349#(< ~counter~0 92)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11349#(< ~counter~0 92)} is VALID [2022-04-08 14:32:16,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {11349#(< ~counter~0 92)} call #t~ret6 := main(); {11349#(< ~counter~0 92)} is VALID [2022-04-08 14:32:16,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11349#(< ~counter~0 92)} {10845#true} #61#return; {11349#(< ~counter~0 92)} is VALID [2022-04-08 14:32:16,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {11349#(< ~counter~0 92)} assume true; {11349#(< ~counter~0 92)} is VALID [2022-04-08 14:32:16,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11349#(< ~counter~0 92)} is VALID [2022-04-08 14:32:16,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-08 14:32:16,742 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-08 14:32:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:16,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340296134] [2022-04-08 14:32:16,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817481030] [2022-04-08 14:32:16,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817481030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:16,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:16,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 14:32:16,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797385788] [2022-04-08 14:32:16,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797385788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:16,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:16,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:32:16,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931599885] [2022-04-08 14:32:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:16,744 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-08 14:32:16,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:16,744 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-08 14:32:16,802 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-08 14:32:16,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:32:16,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:32:16,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:32:16,803 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-08 14:32:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:17,161 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-08 14:32:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:32:17,161 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-08 14:32:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:17,162 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-08 14:32:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 14:32:17,164 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-08 14:32:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 14:32:17,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-08 14:32:17,252 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-08 14:32:17,254 INFO L225 Difference]: With dead ends: 102 [2022-04-08 14:32:17,254 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 14:32:17,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-08 14:32:17,255 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:17,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 129 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 14:32:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-08 14:32:17,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:17,396 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-08 14:32:17,396 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-08 14:32:17,396 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-08 14:32:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:17,398 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:32:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:32:17,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:17,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:17,399 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-08 14:32:17,399 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-08 14:32:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:17,401 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:32:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:32:17,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:17,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:17,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:17,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:17,403 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-08 14:32:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-08 14:32:17,404 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-08 14:32:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:17,404 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-08 14:32:17,404 INFO L479 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-08 14:32:17,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-08 14:32:17,698 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-08 14:32:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:32:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 14:32:17,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:17,699 INFO L499 BasicCegarLoop]: 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-08 14:32:17,723 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-08 14:32:17,899 WARN L460 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-08 14:32:17,899 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-08 14:32:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:17,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852957867] [2022-04-08 14:32:17,985 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:17,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-08 14:32:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:17,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22144260] [2022-04-08 14:32:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:17,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:17,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450517796] [2022-04-08 14:32:17,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:32:17,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:17,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:17,998 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-08 14:32:17,999 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-08 14:32:18,047 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:32:18,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:18,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 14:32:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:18,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:18,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {11976#true} call ULTIMATE.init(); {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {11976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11976#true} {11976#true} #61#return; {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {11976#true} call #t~ret6 := main(); {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {11976#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {11976#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11976#true} {11976#true} #53#return; {11976#true} is VALID [2022-04-08 14:32:18,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {11976#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:18,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:18,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:18,573 INFO L272 TraceCheckUtils]: 14: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,574 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11976#true} {12014#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:18,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:18,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:18,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:18,575 INFO L272 TraceCheckUtils]: 22: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,576 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11976#true} {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:18,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:32:18,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:32:18,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:32:18,577 INFO L272 TraceCheckUtils]: 30: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,578 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11976#true} {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:32:18,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:32:18,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:32:18,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:32:18,579 INFO L272 TraceCheckUtils]: 38: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,580 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11976#true} {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:32:18,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:32:18,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:32:18,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:32:18,581 INFO L272 TraceCheckUtils]: 46: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,581 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11976#true} {12114#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:32:18,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:32:18,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:32:18,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:32:18,583 INFO L272 TraceCheckUtils]: 54: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,583 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,583 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11976#true} {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:32:18,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:32:18,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:32:18,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:32:18,584 INFO L272 TraceCheckUtils]: 62: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,585 INFO L290 TraceCheckUtils]: 64: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,585 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11976#true} {12164#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:32:18,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:32:18,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:32:18,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:32:18,586 INFO L272 TraceCheckUtils]: 70: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,586 INFO L290 TraceCheckUtils]: 71: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,586 INFO L290 TraceCheckUtils]: 72: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,587 INFO L290 TraceCheckUtils]: 73: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,587 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11976#true} {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:32:18,587 INFO L290 TraceCheckUtils]: 75: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:32:18,588 INFO L290 TraceCheckUtils]: 76: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:32:18,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:32:18,588 INFO L272 TraceCheckUtils]: 78: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,588 INFO L290 TraceCheckUtils]: 79: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,588 INFO L290 TraceCheckUtils]: 80: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,588 INFO L290 TraceCheckUtils]: 81: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,589 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11976#true} {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:32:18,589 INFO L290 TraceCheckUtils]: 83: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:32:18,589 INFO L272 TraceCheckUtils]: 84: Hoare triple {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:32:18,589 INFO L290 TraceCheckUtils]: 85: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:32:18,590 INFO L290 TraceCheckUtils]: 86: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:32:18,590 INFO L290 TraceCheckUtils]: 87: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:32:18,590 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11976#true} {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:32:18,591 INFO L272 TraceCheckUtils]: 89: Hoare triple {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:18,591 INFO L290 TraceCheckUtils]: 90: Hoare triple {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:18,592 INFO L290 TraceCheckUtils]: 91: Hoare triple {12262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11977#false} is VALID [2022-04-08 14:32:18,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {11977#false} assume !false; {11977#false} is VALID [2022-04-08 14:32:18,592 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-08 14:32:18,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:18,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22144260] [2022-04-08 14:32:18,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:18,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450517796] [2022-04-08 14:32:18,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450517796] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:18,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:18,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 14:32:18,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:18,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852957867] [2022-04-08 14:32:18,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852957867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:18,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:18,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:32:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39080570] [2022-04-08 14:32:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:18,868 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-08 14:32:18,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:18,868 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-08 14:32:18,916 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-08 14:32:18,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:32:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:18,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:32:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:32:18,917 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-08 14:32:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:19,946 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-08 14:32:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:32:19,947 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-08 14:32:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:19,947 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-08 14:32:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 14:32:19,949 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-08 14:32:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 14:32:19,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-08 14:32:20,006 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-08 14:32:20,007 INFO L225 Difference]: With dead ends: 100 [2022-04-08 14:32:20,007 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 14:32:20,008 INFO L912 BasicCegarLoop]: 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-08 14:32:20,008 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:20,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:32:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 14:32:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 14:32:20,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:20,124 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-08 14:32:20,124 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-08 14:32:20,124 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-08 14:32:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:20,126 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 14:32:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:32:20,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:20,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:20,127 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-08 14:32:20,127 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-08 14:32:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:20,128 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 14:32:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:32:20,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:20,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:20,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:20,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:20,129 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-08 14:32:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-08 14:32:20,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-08 14:32:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:20,131 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-08 14:32:20,131 INFO L479 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-08 14:32:20,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-08 14:32:20,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:32:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 14:32:20,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:20,335 INFO L499 BasicCegarLoop]: 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-08 14:32:20,351 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-08 14:32:20,535 WARN L460 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-08 14:32:20,536 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-08 14:32:20,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:20,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208855277] [2022-04-08 14:32:20,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:20,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-08 14:32:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:20,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174032543] [2022-04-08 14:32:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:20,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:20,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004059821] [2022-04-08 14:32:20,640 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:32:20,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:20,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:20,641 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-08 14:32:20,644 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-08 14:32:20,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:32:20,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:20,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 14:32:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:20,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:21,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-08 14:32:21,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12916#(<= ~counter~0 0)} {12908#true} #61#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {12916#(<= ~counter~0 0)} call #t~ret6 := main(); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {12916#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {12916#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {12916#(<= ~counter~0 0)} ~cond := #in~cond; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {12916#(<= ~counter~0 0)} assume !(0 == ~cond); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12916#(<= ~counter~0 0)} {12916#(<= ~counter~0 0)} #53#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {12916#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:21,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {12916#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:21,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:21,203 INFO L272 TraceCheckUtils]: 14: Hoare triple {12950#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:21,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(<= ~counter~0 1)} ~cond := #in~cond; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:21,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {12950#(<= ~counter~0 1)} assume !(0 == ~cond); {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:21,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {12950#(<= ~counter~0 1)} assume true; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:21,205 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12950#(<= ~counter~0 1)} {12950#(<= ~counter~0 1)} #55#return; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:21,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {12950#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:21,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:21,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {12975#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:21,206 INFO L272 TraceCheckUtils]: 22: Hoare triple {12975#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:21,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {12975#(<= ~counter~0 2)} ~cond := #in~cond; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:21,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {12975#(<= ~counter~0 2)} assume !(0 == ~cond); {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:21,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {12975#(<= ~counter~0 2)} assume true; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:21,207 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12975#(<= ~counter~0 2)} {12975#(<= ~counter~0 2)} #55#return; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:21,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {12975#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:21,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {12975#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:21,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {13000#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:21,209 INFO L272 TraceCheckUtils]: 30: Hoare triple {13000#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:21,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {13000#(<= ~counter~0 3)} ~cond := #in~cond; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:21,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {13000#(<= ~counter~0 3)} assume !(0 == ~cond); {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:21,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {13000#(<= ~counter~0 3)} assume true; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:21,210 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13000#(<= ~counter~0 3)} {13000#(<= ~counter~0 3)} #55#return; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:21,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {13000#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:21,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {13000#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:21,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {13025#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:21,212 INFO L272 TraceCheckUtils]: 38: Hoare triple {13025#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:21,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {13025#(<= ~counter~0 4)} ~cond := #in~cond; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:21,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {13025#(<= ~counter~0 4)} assume !(0 == ~cond); {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:21,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {13025#(<= ~counter~0 4)} assume true; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:21,213 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13025#(<= ~counter~0 4)} {13025#(<= ~counter~0 4)} #55#return; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:21,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {13025#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:21,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {13025#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:21,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {13050#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:21,214 INFO L272 TraceCheckUtils]: 46: Hoare triple {13050#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:21,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {13050#(<= ~counter~0 5)} ~cond := #in~cond; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:21,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {13050#(<= ~counter~0 5)} assume !(0 == ~cond); {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:21,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {13050#(<= ~counter~0 5)} assume true; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:21,215 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13050#(<= ~counter~0 5)} {13050#(<= ~counter~0 5)} #55#return; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:21,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {13050#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:32:21,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {13050#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:21,217 INFO L290 TraceCheckUtils]: 53: Hoare triple {13075#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:21,217 INFO L272 TraceCheckUtils]: 54: Hoare triple {13075#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:21,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {13075#(<= ~counter~0 6)} ~cond := #in~cond; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:21,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {13075#(<= ~counter~0 6)} assume !(0 == ~cond); {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:21,218 INFO L290 TraceCheckUtils]: 57: Hoare triple {13075#(<= ~counter~0 6)} assume true; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:21,218 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13075#(<= ~counter~0 6)} {13075#(<= ~counter~0 6)} #55#return; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:21,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {13075#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:32:21,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {13075#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:21,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:21,220 INFO L272 TraceCheckUtils]: 62: Hoare triple {13100#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:21,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {13100#(<= ~counter~0 7)} ~cond := #in~cond; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:21,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {13100#(<= ~counter~0 7)} assume !(0 == ~cond); {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:21,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {13100#(<= ~counter~0 7)} assume true; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:21,221 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13100#(<= ~counter~0 7)} {13100#(<= ~counter~0 7)} #55#return; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:21,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {13100#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:32:21,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {13100#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:21,222 INFO L290 TraceCheckUtils]: 69: Hoare triple {13125#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:21,222 INFO L272 TraceCheckUtils]: 70: Hoare triple {13125#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:21,223 INFO L290 TraceCheckUtils]: 71: Hoare triple {13125#(<= ~counter~0 8)} ~cond := #in~cond; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:21,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {13125#(<= ~counter~0 8)} assume !(0 == ~cond); {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:21,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {13125#(<= ~counter~0 8)} assume true; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:21,224 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13125#(<= ~counter~0 8)} {13125#(<= ~counter~0 8)} #55#return; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:21,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {13125#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:32:21,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {13125#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:32:21,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {13150#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:32:21,225 INFO L272 TraceCheckUtils]: 78: Hoare triple {13150#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:32:21,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {13150#(<= ~counter~0 9)} ~cond := #in~cond; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:32:21,226 INFO L290 TraceCheckUtils]: 80: Hoare triple {13150#(<= ~counter~0 9)} assume !(0 == ~cond); {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:32:21,226 INFO L290 TraceCheckUtils]: 81: Hoare triple {13150#(<= ~counter~0 9)} assume true; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:32:21,226 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13150#(<= ~counter~0 9)} {13150#(<= ~counter~0 9)} #55#return; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:32:21,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {13150#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:32:21,227 INFO L290 TraceCheckUtils]: 84: Hoare triple {13150#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13175#(<= |main_#t~post5| 9)} is VALID [2022-04-08 14:32:21,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {13175#(<= |main_#t~post5| 9)} assume !(#t~post5 < 100);havoc #t~post5; {12909#false} is VALID [2022-04-08 14:32:21,227 INFO L272 TraceCheckUtils]: 86: Hoare triple {12909#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 14:32:21,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 14:32:21,227 INFO L290 TraceCheckUtils]: 88: Hoare triple {12909#false} assume !(0 == ~cond); {12909#false} is VALID [2022-04-08 14:32:21,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {12909#false} assume true; {12909#false} is VALID [2022-04-08 14:32:21,228 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12909#false} {12909#false} #57#return; {12909#false} is VALID [2022-04-08 14:32:21,228 INFO L272 TraceCheckUtils]: 91: Hoare triple {12909#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 14:32:21,228 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 14:32:21,228 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-08 14:32:21,228 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-08 14:32:21,228 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-08 14:32:21,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:21,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-08 14:32:21,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-08 14:32:21,738 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 14:32:21,739 INFO L272 TraceCheckUtils]: 91: Hoare triple {12909#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 14:32:21,739 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12908#true} {12909#false} #57#return; {12909#false} is VALID [2022-04-08 14:32:21,739 INFO L290 TraceCheckUtils]: 89: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,739 INFO L290 TraceCheckUtils]: 88: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,739 INFO L290 TraceCheckUtils]: 87: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,739 INFO L272 TraceCheckUtils]: 86: Hoare triple {12909#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {13233#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {12909#false} is VALID [2022-04-08 14:32:21,740 INFO L290 TraceCheckUtils]: 84: Hoare triple {13237#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13233#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:32:21,740 INFO L290 TraceCheckUtils]: 83: Hoare triple {13237#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13237#(< ~counter~0 100)} is VALID [2022-04-08 14:32:21,740 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12908#true} {13237#(< ~counter~0 100)} #55#return; {13237#(< ~counter~0 100)} is VALID [2022-04-08 14:32:21,740 INFO L290 TraceCheckUtils]: 81: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,740 INFO L290 TraceCheckUtils]: 80: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,741 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,741 INFO L272 TraceCheckUtils]: 78: Hoare triple {13237#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {13237#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {13237#(< ~counter~0 100)} is VALID [2022-04-08 14:32:21,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {13262#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13237#(< ~counter~0 100)} is VALID [2022-04-08 14:32:21,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {13262#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13262#(< ~counter~0 99)} is VALID [2022-04-08 14:32:21,742 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12908#true} {13262#(< ~counter~0 99)} #55#return; {13262#(< ~counter~0 99)} is VALID [2022-04-08 14:32:21,742 INFO L290 TraceCheckUtils]: 73: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,742 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,743 INFO L272 TraceCheckUtils]: 70: Hoare triple {13262#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,743 INFO L290 TraceCheckUtils]: 69: Hoare triple {13262#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {13262#(< ~counter~0 99)} is VALID [2022-04-08 14:32:21,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {13287#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13262#(< ~counter~0 99)} is VALID [2022-04-08 14:32:21,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {13287#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13287#(< ~counter~0 98)} is VALID [2022-04-08 14:32:21,744 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13287#(< ~counter~0 98)} #55#return; {13287#(< ~counter~0 98)} is VALID [2022-04-08 14:32:21,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,744 INFO L272 TraceCheckUtils]: 62: Hoare triple {13287#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {13287#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {13287#(< ~counter~0 98)} is VALID [2022-04-08 14:32:21,745 INFO L290 TraceCheckUtils]: 60: Hoare triple {13312#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13287#(< ~counter~0 98)} is VALID [2022-04-08 14:32:21,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {13312#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13312#(< ~counter~0 97)} is VALID [2022-04-08 14:32:21,746 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12908#true} {13312#(< ~counter~0 97)} #55#return; {13312#(< ~counter~0 97)} is VALID [2022-04-08 14:32:21,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,746 INFO L272 TraceCheckUtils]: 54: Hoare triple {13312#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {13312#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {13312#(< ~counter~0 97)} is VALID [2022-04-08 14:32:21,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {13337#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13312#(< ~counter~0 97)} is VALID [2022-04-08 14:32:21,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {13337#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13337#(< ~counter~0 96)} is VALID [2022-04-08 14:32:21,748 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12908#true} {13337#(< ~counter~0 96)} #55#return; {13337#(< ~counter~0 96)} is VALID [2022-04-08 14:32:21,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,748 INFO L272 TraceCheckUtils]: 46: Hoare triple {13337#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {13337#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {13337#(< ~counter~0 96)} is VALID [2022-04-08 14:32:21,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {13362#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13337#(< ~counter~0 96)} is VALID [2022-04-08 14:32:21,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {13362#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13362#(< ~counter~0 95)} is VALID [2022-04-08 14:32:21,749 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12908#true} {13362#(< ~counter~0 95)} #55#return; {13362#(< ~counter~0 95)} is VALID [2022-04-08 14:32:21,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,750 INFO L272 TraceCheckUtils]: 38: Hoare triple {13362#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {13362#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {13362#(< ~counter~0 95)} is VALID [2022-04-08 14:32:21,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {13387#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13362#(< ~counter~0 95)} is VALID [2022-04-08 14:32:21,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {13387#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13387#(< ~counter~0 94)} is VALID [2022-04-08 14:32:21,751 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12908#true} {13387#(< ~counter~0 94)} #55#return; {13387#(< ~counter~0 94)} is VALID [2022-04-08 14:32:21,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,751 INFO L272 TraceCheckUtils]: 30: Hoare triple {13387#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {13387#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {13387#(< ~counter~0 94)} is VALID [2022-04-08 14:32:21,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {13412#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13387#(< ~counter~0 94)} is VALID [2022-04-08 14:32:21,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {13412#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13412#(< ~counter~0 93)} is VALID [2022-04-08 14:32:21,753 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12908#true} {13412#(< ~counter~0 93)} #55#return; {13412#(< ~counter~0 93)} is VALID [2022-04-08 14:32:21,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,753 INFO L272 TraceCheckUtils]: 22: Hoare triple {13412#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {13412#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {13412#(< ~counter~0 93)} is VALID [2022-04-08 14:32:21,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {13437#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13412#(< ~counter~0 93)} is VALID [2022-04-08 14:32:21,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {13437#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13437#(< ~counter~0 92)} is VALID [2022-04-08 14:32:21,755 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12908#true} {13437#(< ~counter~0 92)} #55#return; {13437#(< ~counter~0 92)} is VALID [2022-04-08 14:32:21,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,755 INFO L272 TraceCheckUtils]: 14: Hoare triple {13437#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {13437#(< ~counter~0 92)} is VALID [2022-04-08 14:32:21,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {13462#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13437#(< ~counter~0 92)} is VALID [2022-04-08 14:32:21,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {13462#(< ~counter~0 91)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13462#(< ~counter~0 91)} is VALID [2022-04-08 14:32:21,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {13462#(< ~counter~0 91)} #53#return; {13462#(< ~counter~0 91)} is VALID [2022-04-08 14:32:21,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:32:21,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:32:21,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:32:21,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {13462#(< ~counter~0 91)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:32:21,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {13462#(< ~counter~0 91)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13462#(< ~counter~0 91)} is VALID [2022-04-08 14:32:21,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {13462#(< ~counter~0 91)} call #t~ret6 := main(); {13462#(< ~counter~0 91)} is VALID [2022-04-08 14:32:21,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13462#(< ~counter~0 91)} {12908#true} #61#return; {13462#(< ~counter~0 91)} is VALID [2022-04-08 14:32:21,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {13462#(< ~counter~0 91)} assume true; {13462#(< ~counter~0 91)} is VALID [2022-04-08 14:32:21,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13462#(< ~counter~0 91)} is VALID [2022-04-08 14:32:21,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-08 14:32:21,767 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-08 14:32:21,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:21,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174032543] [2022-04-08 14:32:21,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:21,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004059821] [2022-04-08 14:32:21,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004059821] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:21,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:21,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 14:32:21,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:21,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208855277] [2022-04-08 14:32:21,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208855277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:21,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:21,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:32:21,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047559219] [2022-04-08 14:32:21,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:21,768 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-08 14:32:21,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:21,769 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-08 14:32:21,858 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-08 14:32:21,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:32:21,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:21,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:32:21,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:32:21,859 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-08 14:32:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:22,296 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-08 14:32:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 14:32:22,296 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-08 14:32:22,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:22,297 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-08 14:32:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 14:32:22,299 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-08 14:32:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 14:32:22,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-08 14:32:22,395 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-08 14:32:22,397 INFO L225 Difference]: With dead ends: 110 [2022-04-08 14:32:22,397 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 14:32:22,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 14:32:22,398 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:22,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:32:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 14:32:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 14:32:22,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:22,554 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-08 14:32:22,555 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-08 14:32:22,555 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-08 14:32:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:22,557 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 14:32:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:32:22,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:22,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:22,557 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-08 14:32:22,557 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-08 14:32:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:22,559 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 14:32:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:32:22,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:22,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:22,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:22,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:22,560 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-08 14:32:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-08 14:32:22,562 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-08 14:32:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:22,562 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-08 14:32:22,562 INFO L479 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-08 14:32:22,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-08 14:32:22,763 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-08 14:32:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:32:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 14:32:22,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:22,764 INFO L499 BasicCegarLoop]: 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-08 14:32:22,784 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-08 14:32:22,964 WARN L460 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-08 14:32:22,964 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-08 14:32:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:22,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722414103] [2022-04-08 14:32:23,053 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:23,053 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-08 14:32:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:23,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716307884] [2022-04-08 14:32:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:23,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:23,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121582749] [2022-04-08 14:32:23,068 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:32:23,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:23,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:23,069 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-08 14:32:23,070 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-08 14:33:30,147 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 14:33:30,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:30,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 14:33:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:30,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:30,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {14139#true} call ULTIMATE.init(); {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {14139#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14139#true} {14139#true} #61#return; {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {14139#true} call #t~ret6 := main(); {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {14139#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {14139#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14139#true} {14139#true} #53#return; {14139#true} is VALID [2022-04-08 14:33:30,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {14139#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:30,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:30,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:30,771 INFO L272 TraceCheckUtils]: 14: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,771 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14139#true} {14177#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:30,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:30,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:30,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:30,773 INFO L272 TraceCheckUtils]: 22: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,773 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14139#true} {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:30,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:30,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:30,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:30,775 INFO L272 TraceCheckUtils]: 30: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,775 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14139#true} {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #55#return; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:30,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:33:30,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:33:30,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:33:30,776 INFO L272 TraceCheckUtils]: 38: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,777 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14139#true} {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #55#return; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:33:30,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:33:30,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:33:30,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:33:30,778 INFO L272 TraceCheckUtils]: 46: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,779 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14139#true} {14277#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:33:30,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:30,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:30,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:30,780 INFO L272 TraceCheckUtils]: 54: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,781 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14139#true} {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:30,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:30,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:30,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:30,782 INFO L272 TraceCheckUtils]: 62: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,783 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14139#true} {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:30,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:30,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:30,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:30,784 INFO L272 TraceCheckUtils]: 70: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,785 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14139#true} {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:30,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:33:30,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:33:30,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:33:30,786 INFO L272 TraceCheckUtils]: 78: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,786 INFO L290 TraceCheckUtils]: 79: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,786 INFO L290 TraceCheckUtils]: 80: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,786 INFO L290 TraceCheckUtils]: 81: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,787 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14139#true} {14377#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:33:30,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:33:30,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:33:30,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:33:30,788 INFO L272 TraceCheckUtils]: 86: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,789 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14139#true} {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:33:30,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 14:33:30,790 INFO L272 TraceCheckUtils]: 92: Hoare triple {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:33:30,790 INFO L290 TraceCheckUtils]: 93: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:33:30,790 INFO L290 TraceCheckUtils]: 94: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:33:30,790 INFO L290 TraceCheckUtils]: 95: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:33:30,790 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14139#true} {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 14:33:30,791 INFO L272 TraceCheckUtils]: 97: Hoare triple {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:30,791 INFO L290 TraceCheckUtils]: 98: Hoare triple {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:30,791 INFO L290 TraceCheckUtils]: 99: Hoare triple {14450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14140#false} is VALID [2022-04-08 14:33:30,792 INFO L290 TraceCheckUtils]: 100: Hoare triple {14140#false} assume !false; {14140#false} is VALID [2022-04-08 14:33:30,792 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-08 14:33:30,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:31,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716307884] [2022-04-08 14:33:31,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:31,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121582749] [2022-04-08 14:33:31,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121582749] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:31,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:31,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 14:33:31,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:31,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722414103] [2022-04-08 14:33:31,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722414103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:31,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:31,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 14:33:31,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793459153] [2022-04-08 14:33:31,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:31,049 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-08 14:33:31,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:31,049 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-08 14:33:31,100 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-08 14:33:31,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 14:33:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:31,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 14:33:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:33:31,101 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-08 14:33:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:32,302 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-08 14:33:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 14:33:32,302 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-08 14:33:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:32,302 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-08 14:33:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 14:33:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 14:33:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 14:33:32,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-08 14:33:32,380 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-08 14:33:32,381 INFO L225 Difference]: With dead ends: 108 [2022-04-08 14:33:32,381 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 14:33:32,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:33:32,382 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:32,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 557 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 14:33:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 14:33:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-08 14:33:32,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:32,511 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-08 14:33:32,511 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-08 14:33:32,512 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-08 14:33:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:32,513 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 14:33:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:33:32,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:32,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:32,514 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-08 14:33:32,514 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-08 14:33:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:32,516 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 14:33:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:33:32,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:32,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:32,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:32,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:32,516 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-08 14:33:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-08 14:33:32,518 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-08 14:33:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:32,519 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-08 14:33:32,519 INFO L479 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-08 14:33:32,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-08 14:33:32,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:33:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 14:33:32,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:32,797 INFO L499 BasicCegarLoop]: 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-08 14:33:32,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 14:33:32,997 WARN L460 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-08 14:33:32,998 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-08 14:33:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:32,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953633989] [2022-04-08 14:33:33,078 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:33,078 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:33,079 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-08 14:33:33,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:33,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945345372] [2022-04-08 14:33:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:33,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:33,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:33,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807082756] [2022-04-08 14:33:33,091 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:33:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:33,092 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-08 14:33:33,098 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-08 14:33:33,752 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-08 14:33:33,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:33,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 14:33:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:33,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:34,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-08 14:33:34,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15152#(<= ~counter~0 0)} {15144#true} #61#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {15152#(<= ~counter~0 0)} call #t~ret6 := main(); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {15152#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {15152#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {15152#(<= ~counter~0 0)} ~cond := #in~cond; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {15152#(<= ~counter~0 0)} assume !(0 == ~cond); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15152#(<= ~counter~0 0)} {15152#(<= ~counter~0 0)} #53#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {15152#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:34,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {15152#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:34,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {15186#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:34,263 INFO L272 TraceCheckUtils]: 14: Hoare triple {15186#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:34,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {15186#(<= ~counter~0 1)} ~cond := #in~cond; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:34,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {15186#(<= ~counter~0 1)} assume !(0 == ~cond); {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:34,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {15186#(<= ~counter~0 1)} assume true; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:34,264 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15186#(<= ~counter~0 1)} {15186#(<= ~counter~0 1)} #55#return; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:34,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {15186#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:34,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {15186#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:34,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {15211#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:34,266 INFO L272 TraceCheckUtils]: 22: Hoare triple {15211#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:34,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {15211#(<= ~counter~0 2)} ~cond := #in~cond; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:34,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {15211#(<= ~counter~0 2)} assume !(0 == ~cond); {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:34,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {15211#(<= ~counter~0 2)} assume true; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:34,267 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15211#(<= ~counter~0 2)} {15211#(<= ~counter~0 2)} #55#return; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:34,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {15211#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:34,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {15211#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:34,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {15236#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:34,268 INFO L272 TraceCheckUtils]: 30: Hoare triple {15236#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:34,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {15236#(<= ~counter~0 3)} ~cond := #in~cond; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:34,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {15236#(<= ~counter~0 3)} assume !(0 == ~cond); {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:34,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {15236#(<= ~counter~0 3)} assume true; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:34,269 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15236#(<= ~counter~0 3)} {15236#(<= ~counter~0 3)} #55#return; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:34,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {15236#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:34,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {15236#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:34,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {15261#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:34,271 INFO L272 TraceCheckUtils]: 38: Hoare triple {15261#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:34,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {15261#(<= ~counter~0 4)} ~cond := #in~cond; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:34,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {15261#(<= ~counter~0 4)} assume !(0 == ~cond); {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:34,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {15261#(<= ~counter~0 4)} assume true; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:34,272 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15261#(<= ~counter~0 4)} {15261#(<= ~counter~0 4)} #55#return; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:34,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {15261#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:34,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {15261#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:34,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {15286#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:34,274 INFO L272 TraceCheckUtils]: 46: Hoare triple {15286#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:34,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {15286#(<= ~counter~0 5)} ~cond := #in~cond; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:34,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {15286#(<= ~counter~0 5)} assume !(0 == ~cond); {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:34,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(<= ~counter~0 5)} assume true; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:34,275 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15286#(<= ~counter~0 5)} {15286#(<= ~counter~0 5)} #55#return; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:34,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {15286#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:34,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {15286#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:34,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {15311#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:34,276 INFO L272 TraceCheckUtils]: 54: Hoare triple {15311#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:34,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {15311#(<= ~counter~0 6)} ~cond := #in~cond; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:34,277 INFO L290 TraceCheckUtils]: 56: Hoare triple {15311#(<= ~counter~0 6)} assume !(0 == ~cond); {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:34,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {15311#(<= ~counter~0 6)} assume true; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:34,277 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15311#(<= ~counter~0 6)} {15311#(<= ~counter~0 6)} #55#return; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:34,278 INFO L290 TraceCheckUtils]: 59: Hoare triple {15311#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:34,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {15311#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:34,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {15336#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:34,279 INFO L272 TraceCheckUtils]: 62: Hoare triple {15336#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:34,279 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(<= ~counter~0 7)} ~cond := #in~cond; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:34,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(<= ~counter~0 7)} assume !(0 == ~cond); {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:34,280 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(<= ~counter~0 7)} assume true; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:34,280 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15336#(<= ~counter~0 7)} {15336#(<= ~counter~0 7)} #55#return; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:34,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {15336#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:34,281 INFO L290 TraceCheckUtils]: 68: Hoare triple {15336#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:34,281 INFO L290 TraceCheckUtils]: 69: Hoare triple {15361#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:34,282 INFO L272 TraceCheckUtils]: 70: Hoare triple {15361#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:34,282 INFO L290 TraceCheckUtils]: 71: Hoare triple {15361#(<= ~counter~0 8)} ~cond := #in~cond; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:34,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {15361#(<= ~counter~0 8)} assume !(0 == ~cond); {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:34,282 INFO L290 TraceCheckUtils]: 73: Hoare triple {15361#(<= ~counter~0 8)} assume true; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:34,283 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15361#(<= ~counter~0 8)} {15361#(<= ~counter~0 8)} #55#return; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:34,283 INFO L290 TraceCheckUtils]: 75: Hoare triple {15361#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:34,284 INFO L290 TraceCheckUtils]: 76: Hoare triple {15361#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:34,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {15386#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:34,284 INFO L272 TraceCheckUtils]: 78: Hoare triple {15386#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:34,284 INFO L290 TraceCheckUtils]: 79: Hoare triple {15386#(<= ~counter~0 9)} ~cond := #in~cond; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:34,285 INFO L290 TraceCheckUtils]: 80: Hoare triple {15386#(<= ~counter~0 9)} assume !(0 == ~cond); {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:34,285 INFO L290 TraceCheckUtils]: 81: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:34,285 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15386#(<= ~counter~0 9)} {15386#(<= ~counter~0 9)} #55#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:34,286 INFO L290 TraceCheckUtils]: 83: Hoare triple {15386#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:34,286 INFO L290 TraceCheckUtils]: 84: Hoare triple {15386#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:34,286 INFO L290 TraceCheckUtils]: 85: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:34,287 INFO L272 TraceCheckUtils]: 86: Hoare triple {15411#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:34,287 INFO L290 TraceCheckUtils]: 87: Hoare triple {15411#(<= ~counter~0 10)} ~cond := #in~cond; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:34,287 INFO L290 TraceCheckUtils]: 88: Hoare triple {15411#(<= ~counter~0 10)} assume !(0 == ~cond); {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:34,288 INFO L290 TraceCheckUtils]: 89: Hoare triple {15411#(<= ~counter~0 10)} assume true; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:34,288 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15411#(<= ~counter~0 10)} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:34,288 INFO L290 TraceCheckUtils]: 91: Hoare triple {15411#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:34,289 INFO L290 TraceCheckUtils]: 92: Hoare triple {15411#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15436#(<= |main_#t~post5| 10)} is VALID [2022-04-08 14:33:34,289 INFO L290 TraceCheckUtils]: 93: Hoare triple {15436#(<= |main_#t~post5| 10)} assume !(#t~post5 < 100);havoc #t~post5; {15145#false} is VALID [2022-04-08 14:33:34,289 INFO L272 TraceCheckUtils]: 94: Hoare triple {15145#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 14:33:34,289 INFO L290 TraceCheckUtils]: 95: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 14:33:34,289 INFO L290 TraceCheckUtils]: 96: Hoare triple {15145#false} assume !(0 == ~cond); {15145#false} is VALID [2022-04-08 14:33:34,289 INFO L290 TraceCheckUtils]: 97: Hoare triple {15145#false} assume true; {15145#false} is VALID [2022-04-08 14:33:34,289 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15145#false} {15145#false} #57#return; {15145#false} is VALID [2022-04-08 14:33:34,289 INFO L272 TraceCheckUtils]: 99: Hoare triple {15145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 14:33:34,290 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 14:33:34,290 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-08 14:33:34,290 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-08 14:33:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:34,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:34,846 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-08 14:33:34,846 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-08 14:33:34,846 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 14:33:34,847 INFO L272 TraceCheckUtils]: 99: Hoare triple {15145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 14:33:34,847 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15144#true} {15145#false} #57#return; {15145#false} is VALID [2022-04-08 14:33:34,847 INFO L290 TraceCheckUtils]: 97: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,847 INFO L290 TraceCheckUtils]: 96: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,847 INFO L290 TraceCheckUtils]: 95: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,847 INFO L272 TraceCheckUtils]: 94: Hoare triple {15145#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,847 INFO L290 TraceCheckUtils]: 93: Hoare triple {15494#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {15145#false} is VALID [2022-04-08 14:33:34,848 INFO L290 TraceCheckUtils]: 92: Hoare triple {15498#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15494#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:33:34,848 INFO L290 TraceCheckUtils]: 91: Hoare triple {15498#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15498#(< ~counter~0 100)} is VALID [2022-04-08 14:33:34,848 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15144#true} {15498#(< ~counter~0 100)} #55#return; {15498#(< ~counter~0 100)} is VALID [2022-04-08 14:33:34,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,849 INFO L272 TraceCheckUtils]: 86: Hoare triple {15498#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,849 INFO L290 TraceCheckUtils]: 85: Hoare triple {15498#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {15498#(< ~counter~0 100)} is VALID [2022-04-08 14:33:34,850 INFO L290 TraceCheckUtils]: 84: Hoare triple {15523#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15498#(< ~counter~0 100)} is VALID [2022-04-08 14:33:34,850 INFO L290 TraceCheckUtils]: 83: Hoare triple {15523#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15523#(< ~counter~0 99)} is VALID [2022-04-08 14:33:34,850 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15144#true} {15523#(< ~counter~0 99)} #55#return; {15523#(< ~counter~0 99)} is VALID [2022-04-08 14:33:34,850 INFO L290 TraceCheckUtils]: 81: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,850 INFO L290 TraceCheckUtils]: 80: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,851 INFO L290 TraceCheckUtils]: 79: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,851 INFO L272 TraceCheckUtils]: 78: Hoare triple {15523#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,851 INFO L290 TraceCheckUtils]: 77: Hoare triple {15523#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {15523#(< ~counter~0 99)} is VALID [2022-04-08 14:33:34,851 INFO L290 TraceCheckUtils]: 76: Hoare triple {15548#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15523#(< ~counter~0 99)} is VALID [2022-04-08 14:33:34,852 INFO L290 TraceCheckUtils]: 75: Hoare triple {15548#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15548#(< ~counter~0 98)} is VALID [2022-04-08 14:33:34,852 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15144#true} {15548#(< ~counter~0 98)} #55#return; {15548#(< ~counter~0 98)} is VALID [2022-04-08 14:33:34,852 INFO L290 TraceCheckUtils]: 73: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,852 INFO L290 TraceCheckUtils]: 72: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,852 INFO L290 TraceCheckUtils]: 71: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,852 INFO L272 TraceCheckUtils]: 70: Hoare triple {15548#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {15548#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {15548#(< ~counter~0 98)} is VALID [2022-04-08 14:33:34,853 INFO L290 TraceCheckUtils]: 68: Hoare triple {15573#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15548#(< ~counter~0 98)} is VALID [2022-04-08 14:33:34,853 INFO L290 TraceCheckUtils]: 67: Hoare triple {15573#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15573#(< ~counter~0 97)} is VALID [2022-04-08 14:33:34,854 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15144#true} {15573#(< ~counter~0 97)} #55#return; {15573#(< ~counter~0 97)} is VALID [2022-04-08 14:33:34,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,854 INFO L272 TraceCheckUtils]: 62: Hoare triple {15573#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {15573#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {15573#(< ~counter~0 97)} is VALID [2022-04-08 14:33:34,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {15598#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15573#(< ~counter~0 97)} is VALID [2022-04-08 14:33:34,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {15598#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15598#(< ~counter~0 96)} is VALID [2022-04-08 14:33:34,856 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15144#true} {15598#(< ~counter~0 96)} #55#return; {15598#(< ~counter~0 96)} is VALID [2022-04-08 14:33:34,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,856 INFO L272 TraceCheckUtils]: 54: Hoare triple {15598#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {15598#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {15598#(< ~counter~0 96)} is VALID [2022-04-08 14:33:34,857 INFO L290 TraceCheckUtils]: 52: Hoare triple {15623#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15598#(< ~counter~0 96)} is VALID [2022-04-08 14:33:34,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {15623#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15623#(< ~counter~0 95)} is VALID [2022-04-08 14:33:34,858 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15144#true} {15623#(< ~counter~0 95)} #55#return; {15623#(< ~counter~0 95)} is VALID [2022-04-08 14:33:34,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,858 INFO L272 TraceCheckUtils]: 46: Hoare triple {15623#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {15623#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {15623#(< ~counter~0 95)} is VALID [2022-04-08 14:33:34,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {15648#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15623#(< ~counter~0 95)} is VALID [2022-04-08 14:33:34,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {15648#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15648#(< ~counter~0 94)} is VALID [2022-04-08 14:33:34,859 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15144#true} {15648#(< ~counter~0 94)} #55#return; {15648#(< ~counter~0 94)} is VALID [2022-04-08 14:33:34,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,860 INFO L272 TraceCheckUtils]: 38: Hoare triple {15648#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {15648#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {15648#(< ~counter~0 94)} is VALID [2022-04-08 14:33:34,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {15673#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15648#(< ~counter~0 94)} is VALID [2022-04-08 14:33:34,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {15673#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15673#(< ~counter~0 93)} is VALID [2022-04-08 14:33:34,861 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15144#true} {15673#(< ~counter~0 93)} #55#return; {15673#(< ~counter~0 93)} is VALID [2022-04-08 14:33:34,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,861 INFO L272 TraceCheckUtils]: 30: Hoare triple {15673#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {15673#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {15673#(< ~counter~0 93)} is VALID [2022-04-08 14:33:34,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15673#(< ~counter~0 93)} is VALID [2022-04-08 14:33:34,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {15698#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15698#(< ~counter~0 92)} is VALID [2022-04-08 14:33:34,863 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15144#true} {15698#(< ~counter~0 92)} #55#return; {15698#(< ~counter~0 92)} is VALID [2022-04-08 14:33:34,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,863 INFO L272 TraceCheckUtils]: 22: Hoare triple {15698#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {15698#(< ~counter~0 92)} is VALID [2022-04-08 14:33:34,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {15723#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15698#(< ~counter~0 92)} is VALID [2022-04-08 14:33:34,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {15723#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15723#(< ~counter~0 91)} is VALID [2022-04-08 14:33:34,865 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15144#true} {15723#(< ~counter~0 91)} #55#return; {15723#(< ~counter~0 91)} is VALID [2022-04-08 14:33:34,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,865 INFO L272 TraceCheckUtils]: 14: Hoare triple {15723#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {15723#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {15723#(< ~counter~0 91)} is VALID [2022-04-08 14:33:34,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {15748#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15723#(< ~counter~0 91)} is VALID [2022-04-08 14:33:34,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {15748#(< ~counter~0 90)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15748#(< ~counter~0 90)} is VALID [2022-04-08 14:33:34,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15144#true} {15748#(< ~counter~0 90)} #53#return; {15748#(< ~counter~0 90)} is VALID [2022-04-08 14:33:34,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:33:34,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:33:34,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:33:34,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {15748#(< ~counter~0 90)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:33:34,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {15748#(< ~counter~0 90)} 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; {15748#(< ~counter~0 90)} is VALID [2022-04-08 14:33:34,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {15748#(< ~counter~0 90)} call #t~ret6 := main(); {15748#(< ~counter~0 90)} is VALID [2022-04-08 14:33:34,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15748#(< ~counter~0 90)} {15144#true} #61#return; {15748#(< ~counter~0 90)} is VALID [2022-04-08 14:33:34,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {15748#(< ~counter~0 90)} assume true; {15748#(< ~counter~0 90)} is VALID [2022-04-08 14:33:34,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15748#(< ~counter~0 90)} is VALID [2022-04-08 14:33:34,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-08 14:33:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 14:33:34,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:34,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945345372] [2022-04-08 14:33:34,871 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:34,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807082756] [2022-04-08 14:33:34,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807082756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:34,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:34,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 14:33:34,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:34,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953633989] [2022-04-08 14:33:34,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953633989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:34,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:34,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:33:34,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965391710] [2022-04-08 14:33:34,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:34,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 103 [2022-04-08 14:33:34,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:34,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:34,953 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-08 14:33:34,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:33:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:34,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:33:34,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 14:33:34,955 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:35,461 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2022-04-08 14:33:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 14:33:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 103 [2022-04-08 14:33:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-08 14:33:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-08 14:33:35,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2022-04-08 14:33:35,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:35,571 INFO L225 Difference]: With dead ends: 118 [2022-04-08 14:33:35,571 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 14:33:35,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=531, Invalid=729, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 14:33:35,572 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:35,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:33:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 14:33:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-08 14:33:35,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:35,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:35,730 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:35,731 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:35,732 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-08 14:33:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 14:33:35,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:35,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:35,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 108 states. [2022-04-08 14:33:35,733 INFO L87 Difference]: Start difference. First operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 108 states. [2022-04-08 14:33:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:35,735 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-08 14:33:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 14:33:35,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:35,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:35,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:35,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2022-04-08 14:33:35,738 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 103 [2022-04-08 14:33:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:35,738 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2022-04-08 14:33:35,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:35,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 110 transitions. [2022-04-08 14:33:36,066 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-08 14:33:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 14:33:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-08 14:33:36,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:36,067 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:36,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 14:33:36,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:36,268 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 19 times [2022-04-08 14:33:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:36,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670243927] [2022-04-08 14:33:36,379 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:36,379 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 20 times [2022-04-08 14:33:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:36,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492481326] [2022-04-08 14:33:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:36,392 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:36,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903911010] [2022-04-08 14:33:36,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:33:36,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:36,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:36,393 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:33:36,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 14:33:37,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:33:37,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:37,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 14:33:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:37,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:37,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {16475#true} call ULTIMATE.init(); {16475#true} is VALID [2022-04-08 14:33:37,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {16475#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; {16475#true} is VALID [2022-04-08 14:33:37,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16475#true} {16475#true} #61#return; {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {16475#true} call #t~ret6 := main(); {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {16475#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; {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L272 TraceCheckUtils]: 6: Hoare triple {16475#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16475#true} {16475#true} #53#return; {16475#true} is VALID [2022-04-08 14:33:37,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {16475#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:37,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {16513#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:37,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {16513#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {16513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:37,892 INFO L272 TraceCheckUtils]: 14: Hoare triple {16513#(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)); {16475#true} is VALID [2022-04-08 14:33:37,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,893 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16475#true} {16513#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {16513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:37,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {16513#(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; {16538#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:33:37,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {16538#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16538#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:33:37,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {16538#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {16538#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:33:37,894 INFO L272 TraceCheckUtils]: 22: Hoare triple {16538#(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)); {16475#true} is VALID [2022-04-08 14:33:37,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,895 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16475#true} {16538#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {16538#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:33:37,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {16538#(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; {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:33:37,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:33:37,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:33:37,896 INFO L272 TraceCheckUtils]: 30: Hoare triple {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,897 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16475#true} {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:33:37,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 14:33:37,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 14:33:37,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 14:33:37,898 INFO L272 TraceCheckUtils]: 38: Hoare triple {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,898 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16475#true} {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #55#return; {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 14:33:37,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:33:37,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:33:37,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:33:37,900 INFO L272 TraceCheckUtils]: 46: Hoare triple {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,900 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16475#true} {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:33:37,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:37,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:37,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:37,902 INFO L272 TraceCheckUtils]: 54: Hoare triple {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,902 INFO L290 TraceCheckUtils]: 55: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,902 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16475#true} {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:37,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:37,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:37,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:37,903 INFO L272 TraceCheckUtils]: 62: Hoare triple {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,904 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16475#true} {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #55#return; {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:37,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:33:37,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:33:37,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 100);havoc #t~post5; {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:33:37,905 INFO L272 TraceCheckUtils]: 70: Hoare triple {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,905 INFO L290 TraceCheckUtils]: 72: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,906 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16475#true} {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #55#return; {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:33:37,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 14:33:37,907 INFO L290 TraceCheckUtils]: 76: Hoare triple {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 14:33:37,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 14:33:37,907 INFO L272 TraceCheckUtils]: 78: Hoare triple {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,907 INFO L290 TraceCheckUtils]: 79: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,909 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16475#true} {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #55#return; {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 14:33:37,909 INFO L290 TraceCheckUtils]: 83: Hoare triple {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:33:37,909 INFO L290 TraceCheckUtils]: 84: Hoare triple {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:33:37,910 INFO L290 TraceCheckUtils]: 85: Hoare triple {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 100);havoc #t~post5; {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:33:37,910 INFO L272 TraceCheckUtils]: 86: Hoare triple {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,910 INFO L290 TraceCheckUtils]: 87: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,910 INFO L290 TraceCheckUtils]: 88: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,910 INFO L290 TraceCheckUtils]: 89: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,912 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16475#true} {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #55#return; {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:33:37,913 INFO L290 TraceCheckUtils]: 91: Hoare triple {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:33:37,913 INFO L290 TraceCheckUtils]: 92: Hoare triple {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:33:37,913 INFO L290 TraceCheckUtils]: 93: Hoare triple {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:33:37,913 INFO L272 TraceCheckUtils]: 94: Hoare triple {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,913 INFO L290 TraceCheckUtils]: 95: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,914 INFO L290 TraceCheckUtils]: 96: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,914 INFO L290 TraceCheckUtils]: 97: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,914 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16475#true} {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #55#return; {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:33:37,915 INFO L290 TraceCheckUtils]: 99: Hoare triple {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {16788#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:33:37,915 INFO L272 TraceCheckUtils]: 100: Hoare triple {16788#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16475#true} is VALID [2022-04-08 14:33:37,915 INFO L290 TraceCheckUtils]: 101: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-08 14:33:37,915 INFO L290 TraceCheckUtils]: 102: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-08 14:33:37,915 INFO L290 TraceCheckUtils]: 103: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-08 14:33:37,916 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {16475#true} {16788#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} #57#return; {16788#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:33:37,916 INFO L272 TraceCheckUtils]: 105: Hoare triple {16788#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {16807#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:37,917 INFO L290 TraceCheckUtils]: 106: Hoare triple {16807#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16811#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:37,917 INFO L290 TraceCheckUtils]: 107: Hoare triple {16811#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16476#false} is VALID [2022-04-08 14:33:37,917 INFO L290 TraceCheckUtils]: 108: Hoare triple {16476#false} assume !false; {16476#false} is VALID [2022-04-08 14:33:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 14:33:37,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492481326] [2022-04-08 14:33:38,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903911010] [2022-04-08 14:33:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903911010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:38,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:38,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 14:33:38,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670243927] [2022-04-08 14:33:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670243927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:38,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:38,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 14:33:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885654864] [2022-04-08 14:33:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 109 [2022-04-08 14:33:38,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:38,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 14:33:38,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:38,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 14:33:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:38,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 14:33:38,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:33:38,247 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 14:33:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:39,829 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-08 14:33:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:33:39,829 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 109 [2022-04-08 14:33:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 14:33:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-08 14:33:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 14:33:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-08 14:33:39,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-08 14:33:39,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:39,921 INFO L225 Difference]: With dead ends: 116 [2022-04-08 14:33:39,921 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 14:33:39,921 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:33:39,922 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:39,922 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 14:33:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 14:33:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-08 14:33:40,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:40,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:40,110 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:40,110 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:40,112 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-08 14:33:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 14:33:40,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:40,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:40,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 110 states. [2022-04-08 14:33:40,113 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 110 states. [2022-04-08 14:33:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:40,116 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-08 14:33:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 14:33:40,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:40,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:40,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:40,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2022-04-08 14:33:40,118 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 109 [2022-04-08 14:33:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:40,119 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2022-04-08 14:33:40,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 14:33:40,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 113 transitions. [2022-04-08 14:33:40,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 14:33:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 14:33:40,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:40,442 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:40,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 14:33:40,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:40,643 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 19 times [2022-04-08 14:33:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:40,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [496727339] [2022-04-08 14:33:40,741 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:40,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:40,741 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 20 times [2022-04-08 14:33:40,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:40,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835457814] [2022-04-08 14:33:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:40,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:40,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336152310] [2022-04-08 14:33:40,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:33:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:40,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:40,761 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:33:40,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 14:33:40,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:33:40,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:40,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 14:33:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:40,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:41,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {17553#true} call ULTIMATE.init(); {17553#true} is VALID [2022-04-08 14:33:41,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {17553#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; {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {17561#(<= ~counter~0 0)} assume true; {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17561#(<= ~counter~0 0)} {17553#true} #61#return; {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {17561#(<= ~counter~0 0)} call #t~ret6 := main(); {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {17561#(<= ~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; {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {17561#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {17561#(<= ~counter~0 0)} ~cond := #in~cond; {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {17561#(<= ~counter~0 0)} assume !(0 == ~cond); {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {17561#(<= ~counter~0 0)} assume true; {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17561#(<= ~counter~0 0)} {17561#(<= ~counter~0 0)} #53#return; {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {17561#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17561#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:41,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {17561#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17595#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:41,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {17595#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {17595#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:41,408 INFO L272 TraceCheckUtils]: 14: Hoare triple {17595#(<= ~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)); {17595#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:41,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {17595#(<= ~counter~0 1)} ~cond := #in~cond; {17595#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:41,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(<= ~counter~0 1)} assume !(0 == ~cond); {17595#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:41,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {17595#(<= ~counter~0 1)} assume true; {17595#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:41,409 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17595#(<= ~counter~0 1)} {17595#(<= ~counter~0 1)} #55#return; {17595#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:41,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {17595#(<= ~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; {17595#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:41,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {17595#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17620#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:41,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {17620#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {17620#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:41,411 INFO L272 TraceCheckUtils]: 22: Hoare triple {17620#(<= ~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)); {17620#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:41,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {17620#(<= ~counter~0 2)} ~cond := #in~cond; {17620#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:41,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {17620#(<= ~counter~0 2)} assume !(0 == ~cond); {17620#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:41,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {17620#(<= ~counter~0 2)} assume true; {17620#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:41,412 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17620#(<= ~counter~0 2)} {17620#(<= ~counter~0 2)} #55#return; {17620#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:41,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {17620#(<= ~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; {17620#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:41,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {17620#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17645#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:41,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {17645#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {17645#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:41,413 INFO L272 TraceCheckUtils]: 30: Hoare triple {17645#(<= ~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)); {17645#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:41,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {17645#(<= ~counter~0 3)} ~cond := #in~cond; {17645#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:41,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {17645#(<= ~counter~0 3)} assume !(0 == ~cond); {17645#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:41,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {17645#(<= ~counter~0 3)} assume true; {17645#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:41,415 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17645#(<= ~counter~0 3)} {17645#(<= ~counter~0 3)} #55#return; {17645#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:41,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {17645#(<= ~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; {17645#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:41,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {17645#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17670#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:41,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {17670#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {17670#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:41,416 INFO L272 TraceCheckUtils]: 38: Hoare triple {17670#(<= ~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)); {17670#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:41,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {17670#(<= ~counter~0 4)} ~cond := #in~cond; {17670#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:41,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {17670#(<= ~counter~0 4)} assume !(0 == ~cond); {17670#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:41,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {17670#(<= ~counter~0 4)} assume true; {17670#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:41,418 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17670#(<= ~counter~0 4)} {17670#(<= ~counter~0 4)} #55#return; {17670#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:41,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {17670#(<= ~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; {17670#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:41,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {17670#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17695#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:41,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {17695#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {17695#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:41,419 INFO L272 TraceCheckUtils]: 46: Hoare triple {17695#(<= ~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)); {17695#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:41,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {17695#(<= ~counter~0 5)} ~cond := #in~cond; {17695#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:41,420 INFO L290 TraceCheckUtils]: 48: Hoare triple {17695#(<= ~counter~0 5)} assume !(0 == ~cond); {17695#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:41,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {17695#(<= ~counter~0 5)} assume true; {17695#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:41,420 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17695#(<= ~counter~0 5)} {17695#(<= ~counter~0 5)} #55#return; {17695#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:41,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {17695#(<= ~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; {17695#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:41,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {17695#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17720#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:41,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {17720#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {17720#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:41,422 INFO L272 TraceCheckUtils]: 54: Hoare triple {17720#(<= ~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)); {17720#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:41,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {17720#(<= ~counter~0 6)} ~cond := #in~cond; {17720#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:41,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {17720#(<= ~counter~0 6)} assume !(0 == ~cond); {17720#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:41,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {17720#(<= ~counter~0 6)} assume true; {17720#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:41,423 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17720#(<= ~counter~0 6)} {17720#(<= ~counter~0 6)} #55#return; {17720#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:41,423 INFO L290 TraceCheckUtils]: 59: Hoare triple {17720#(<= ~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; {17720#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:41,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {17720#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17745#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:41,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {17745#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {17745#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:41,424 INFO L272 TraceCheckUtils]: 62: Hoare triple {17745#(<= ~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)); {17745#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:41,425 INFO L290 TraceCheckUtils]: 63: Hoare triple {17745#(<= ~counter~0 7)} ~cond := #in~cond; {17745#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:41,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {17745#(<= ~counter~0 7)} assume !(0 == ~cond); {17745#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:41,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {17745#(<= ~counter~0 7)} assume true; {17745#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:41,426 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17745#(<= ~counter~0 7)} {17745#(<= ~counter~0 7)} #55#return; {17745#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:41,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {17745#(<= ~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; {17745#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:41,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {17745#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17770#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:41,427 INFO L290 TraceCheckUtils]: 69: Hoare triple {17770#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {17770#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:41,427 INFO L272 TraceCheckUtils]: 70: Hoare triple {17770#(<= ~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)); {17770#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:41,428 INFO L290 TraceCheckUtils]: 71: Hoare triple {17770#(<= ~counter~0 8)} ~cond := #in~cond; {17770#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:41,428 INFO L290 TraceCheckUtils]: 72: Hoare triple {17770#(<= ~counter~0 8)} assume !(0 == ~cond); {17770#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:41,428 INFO L290 TraceCheckUtils]: 73: Hoare triple {17770#(<= ~counter~0 8)} assume true; {17770#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:41,428 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17770#(<= ~counter~0 8)} {17770#(<= ~counter~0 8)} #55#return; {17770#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:41,429 INFO L290 TraceCheckUtils]: 75: Hoare triple {17770#(<= ~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; {17770#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:41,430 INFO L290 TraceCheckUtils]: 76: Hoare triple {17770#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17795#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:41,430 INFO L290 TraceCheckUtils]: 77: Hoare triple {17795#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {17795#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:41,430 INFO L272 TraceCheckUtils]: 78: Hoare triple {17795#(<= ~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)); {17795#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:41,431 INFO L290 TraceCheckUtils]: 79: Hoare triple {17795#(<= ~counter~0 9)} ~cond := #in~cond; {17795#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:41,431 INFO L290 TraceCheckUtils]: 80: Hoare triple {17795#(<= ~counter~0 9)} assume !(0 == ~cond); {17795#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:41,431 INFO L290 TraceCheckUtils]: 81: Hoare triple {17795#(<= ~counter~0 9)} assume true; {17795#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:41,432 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17795#(<= ~counter~0 9)} {17795#(<= ~counter~0 9)} #55#return; {17795#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:41,432 INFO L290 TraceCheckUtils]: 83: Hoare triple {17795#(<= ~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; {17795#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:41,436 INFO L290 TraceCheckUtils]: 84: Hoare triple {17795#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17820#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:41,436 INFO L290 TraceCheckUtils]: 85: Hoare triple {17820#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {17820#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:41,437 INFO L272 TraceCheckUtils]: 86: Hoare triple {17820#(<= ~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)); {17820#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:41,437 INFO L290 TraceCheckUtils]: 87: Hoare triple {17820#(<= ~counter~0 10)} ~cond := #in~cond; {17820#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:41,437 INFO L290 TraceCheckUtils]: 88: Hoare triple {17820#(<= ~counter~0 10)} assume !(0 == ~cond); {17820#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:41,437 INFO L290 TraceCheckUtils]: 89: Hoare triple {17820#(<= ~counter~0 10)} assume true; {17820#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:41,438 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17820#(<= ~counter~0 10)} {17820#(<= ~counter~0 10)} #55#return; {17820#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:41,438 INFO L290 TraceCheckUtils]: 91: Hoare triple {17820#(<= ~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; {17820#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:41,439 INFO L290 TraceCheckUtils]: 92: Hoare triple {17820#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17845#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:41,439 INFO L290 TraceCheckUtils]: 93: Hoare triple {17845#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {17845#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:41,439 INFO L272 TraceCheckUtils]: 94: Hoare triple {17845#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17845#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:41,440 INFO L290 TraceCheckUtils]: 95: Hoare triple {17845#(<= ~counter~0 11)} ~cond := #in~cond; {17845#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:41,440 INFO L290 TraceCheckUtils]: 96: Hoare triple {17845#(<= ~counter~0 11)} assume !(0 == ~cond); {17845#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:41,440 INFO L290 TraceCheckUtils]: 97: Hoare triple {17845#(<= ~counter~0 11)} assume true; {17845#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:41,441 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17845#(<= ~counter~0 11)} {17845#(<= ~counter~0 11)} #55#return; {17845#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:41,441 INFO L290 TraceCheckUtils]: 99: Hoare triple {17845#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17845#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:41,441 INFO L290 TraceCheckUtils]: 100: Hoare triple {17845#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17870#(<= |main_#t~post5| 11)} is VALID [2022-04-08 14:33:41,442 INFO L290 TraceCheckUtils]: 101: Hoare triple {17870#(<= |main_#t~post5| 11)} assume !(#t~post5 < 100);havoc #t~post5; {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L272 TraceCheckUtils]: 102: Hoare triple {17554#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)); {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L290 TraceCheckUtils]: 103: Hoare triple {17554#false} ~cond := #in~cond; {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L290 TraceCheckUtils]: 104: Hoare triple {17554#false} assume !(0 == ~cond); {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L290 TraceCheckUtils]: 105: Hoare triple {17554#false} assume true; {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17554#false} {17554#false} #57#return; {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L272 TraceCheckUtils]: 107: Hoare triple {17554#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L290 TraceCheckUtils]: 108: Hoare triple {17554#false} ~cond := #in~cond; {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L290 TraceCheckUtils]: 109: Hoare triple {17554#false} assume 0 == ~cond; {17554#false} is VALID [2022-04-08 14:33:41,442 INFO L290 TraceCheckUtils]: 110: Hoare triple {17554#false} assume !false; {17554#false} is VALID [2022-04-08 14:33:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:41,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:42,063 INFO L290 TraceCheckUtils]: 110: Hoare triple {17554#false} assume !false; {17554#false} is VALID [2022-04-08 14:33:42,063 INFO L290 TraceCheckUtils]: 109: Hoare triple {17554#false} assume 0 == ~cond; {17554#false} is VALID [2022-04-08 14:33:42,063 INFO L290 TraceCheckUtils]: 108: Hoare triple {17554#false} ~cond := #in~cond; {17554#false} is VALID [2022-04-08 14:33:42,063 INFO L272 TraceCheckUtils]: 107: Hoare triple {17554#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17554#false} is VALID [2022-04-08 14:33:42,063 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17553#true} {17554#false} #57#return; {17554#false} is VALID [2022-04-08 14:33:42,063 INFO L290 TraceCheckUtils]: 105: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,063 INFO L290 TraceCheckUtils]: 104: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,063 INFO L290 TraceCheckUtils]: 103: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,063 INFO L272 TraceCheckUtils]: 102: Hoare triple {17554#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)); {17553#true} is VALID [2022-04-08 14:33:42,064 INFO L290 TraceCheckUtils]: 101: Hoare triple {17928#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {17554#false} is VALID [2022-04-08 14:33:42,064 INFO L290 TraceCheckUtils]: 100: Hoare triple {17932#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17928#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:33:42,065 INFO L290 TraceCheckUtils]: 99: Hoare triple {17932#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17932#(< ~counter~0 100)} is VALID [2022-04-08 14:33:42,065 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17553#true} {17932#(< ~counter~0 100)} #55#return; {17932#(< ~counter~0 100)} is VALID [2022-04-08 14:33:42,065 INFO L290 TraceCheckUtils]: 97: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,065 INFO L290 TraceCheckUtils]: 96: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,065 INFO L290 TraceCheckUtils]: 95: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,065 INFO L272 TraceCheckUtils]: 94: Hoare triple {17932#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,066 INFO L290 TraceCheckUtils]: 93: Hoare triple {17932#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {17932#(< ~counter~0 100)} is VALID [2022-04-08 14:33:42,067 INFO L290 TraceCheckUtils]: 92: Hoare triple {17957#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17932#(< ~counter~0 100)} is VALID [2022-04-08 14:33:42,067 INFO L290 TraceCheckUtils]: 91: Hoare triple {17957#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17957#(< ~counter~0 99)} is VALID [2022-04-08 14:33:42,067 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17553#true} {17957#(< ~counter~0 99)} #55#return; {17957#(< ~counter~0 99)} is VALID [2022-04-08 14:33:42,067 INFO L290 TraceCheckUtils]: 89: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,067 INFO L290 TraceCheckUtils]: 88: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,067 INFO L290 TraceCheckUtils]: 87: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,068 INFO L272 TraceCheckUtils]: 86: Hoare triple {17957#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,068 INFO L290 TraceCheckUtils]: 85: Hoare triple {17957#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {17957#(< ~counter~0 99)} is VALID [2022-04-08 14:33:42,068 INFO L290 TraceCheckUtils]: 84: Hoare triple {17982#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17957#(< ~counter~0 99)} is VALID [2022-04-08 14:33:42,069 INFO L290 TraceCheckUtils]: 83: Hoare triple {17982#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17982#(< ~counter~0 98)} is VALID [2022-04-08 14:33:42,069 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17553#true} {17982#(< ~counter~0 98)} #55#return; {17982#(< ~counter~0 98)} is VALID [2022-04-08 14:33:42,069 INFO L290 TraceCheckUtils]: 81: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,069 INFO L290 TraceCheckUtils]: 80: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,069 INFO L290 TraceCheckUtils]: 79: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,069 INFO L272 TraceCheckUtils]: 78: Hoare triple {17982#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,070 INFO L290 TraceCheckUtils]: 77: Hoare triple {17982#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {17982#(< ~counter~0 98)} is VALID [2022-04-08 14:33:42,070 INFO L290 TraceCheckUtils]: 76: Hoare triple {18007#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17982#(< ~counter~0 98)} is VALID [2022-04-08 14:33:42,071 INFO L290 TraceCheckUtils]: 75: Hoare triple {18007#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18007#(< ~counter~0 97)} is VALID [2022-04-08 14:33:42,071 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17553#true} {18007#(< ~counter~0 97)} #55#return; {18007#(< ~counter~0 97)} is VALID [2022-04-08 14:33:42,071 INFO L290 TraceCheckUtils]: 73: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,071 INFO L290 TraceCheckUtils]: 71: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,071 INFO L272 TraceCheckUtils]: 70: Hoare triple {18007#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {18007#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {18007#(< ~counter~0 97)} is VALID [2022-04-08 14:33:42,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {18032#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18007#(< ~counter~0 97)} is VALID [2022-04-08 14:33:42,072 INFO L290 TraceCheckUtils]: 67: Hoare triple {18032#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18032#(< ~counter~0 96)} is VALID [2022-04-08 14:33:42,073 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17553#true} {18032#(< ~counter~0 96)} #55#return; {18032#(< ~counter~0 96)} is VALID [2022-04-08 14:33:42,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,073 INFO L272 TraceCheckUtils]: 62: Hoare triple {18032#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {18032#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {18032#(< ~counter~0 96)} is VALID [2022-04-08 14:33:42,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {18057#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18032#(< ~counter~0 96)} is VALID [2022-04-08 14:33:42,074 INFO L290 TraceCheckUtils]: 59: Hoare triple {18057#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18057#(< ~counter~0 95)} is VALID [2022-04-08 14:33:42,075 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17553#true} {18057#(< ~counter~0 95)} #55#return; {18057#(< ~counter~0 95)} is VALID [2022-04-08 14:33:42,075 INFO L290 TraceCheckUtils]: 57: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,075 INFO L290 TraceCheckUtils]: 56: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,075 INFO L290 TraceCheckUtils]: 55: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,075 INFO L272 TraceCheckUtils]: 54: Hoare triple {18057#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {18057#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {18057#(< ~counter~0 95)} is VALID [2022-04-08 14:33:42,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {18082#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18057#(< ~counter~0 95)} is VALID [2022-04-08 14:33:42,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {18082#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18082#(< ~counter~0 94)} is VALID [2022-04-08 14:33:42,076 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17553#true} {18082#(< ~counter~0 94)} #55#return; {18082#(< ~counter~0 94)} is VALID [2022-04-08 14:33:42,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,077 INFO L272 TraceCheckUtils]: 46: Hoare triple {18082#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {18082#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {18082#(< ~counter~0 94)} is VALID [2022-04-08 14:33:42,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {18107#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18082#(< ~counter~0 94)} is VALID [2022-04-08 14:33:42,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {18107#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18107#(< ~counter~0 93)} is VALID [2022-04-08 14:33:42,078 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17553#true} {18107#(< ~counter~0 93)} #55#return; {18107#(< ~counter~0 93)} is VALID [2022-04-08 14:33:42,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,078 INFO L272 TraceCheckUtils]: 38: Hoare triple {18107#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {18107#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {18107#(< ~counter~0 93)} is VALID [2022-04-08 14:33:42,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {18132#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18107#(< ~counter~0 93)} is VALID [2022-04-08 14:33:42,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {18132#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18132#(< ~counter~0 92)} is VALID [2022-04-08 14:33:42,080 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17553#true} {18132#(< ~counter~0 92)} #55#return; {18132#(< ~counter~0 92)} is VALID [2022-04-08 14:33:42,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,080 INFO L272 TraceCheckUtils]: 30: Hoare triple {18132#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {18132#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {18132#(< ~counter~0 92)} is VALID [2022-04-08 14:33:42,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {18157#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18132#(< ~counter~0 92)} is VALID [2022-04-08 14:33:42,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {18157#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18157#(< ~counter~0 91)} is VALID [2022-04-08 14:33:42,082 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17553#true} {18157#(< ~counter~0 91)} #55#return; {18157#(< ~counter~0 91)} is VALID [2022-04-08 14:33:42,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,082 INFO L272 TraceCheckUtils]: 22: Hoare triple {18157#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {18157#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {18157#(< ~counter~0 91)} is VALID [2022-04-08 14:33:42,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {18182#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18157#(< ~counter~0 91)} is VALID [2022-04-08 14:33:42,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {18182#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18182#(< ~counter~0 90)} is VALID [2022-04-08 14:33:42,083 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17553#true} {18182#(< ~counter~0 90)} #55#return; {18182#(< ~counter~0 90)} is VALID [2022-04-08 14:33:42,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,084 INFO L272 TraceCheckUtils]: 14: Hoare triple {18182#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {18182#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {18182#(< ~counter~0 90)} is VALID [2022-04-08 14:33:42,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {18207#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18182#(< ~counter~0 90)} is VALID [2022-04-08 14:33:42,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {18207#(< ~counter~0 89)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {18207#(< ~counter~0 89)} is VALID [2022-04-08 14:33:42,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17553#true} {18207#(< ~counter~0 89)} #53#return; {18207#(< ~counter~0 89)} is VALID [2022-04-08 14:33:42,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-08 14:33:42,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-08 14:33:42,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-08 14:33:42,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {18207#(< ~counter~0 89)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17553#true} is VALID [2022-04-08 14:33:42,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {18207#(< ~counter~0 89)} 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; {18207#(< ~counter~0 89)} is VALID [2022-04-08 14:33:42,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {18207#(< ~counter~0 89)} call #t~ret6 := main(); {18207#(< ~counter~0 89)} is VALID [2022-04-08 14:33:42,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18207#(< ~counter~0 89)} {17553#true} #61#return; {18207#(< ~counter~0 89)} is VALID [2022-04-08 14:33:42,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {18207#(< ~counter~0 89)} assume true; {18207#(< ~counter~0 89)} is VALID [2022-04-08 14:33:42,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {17553#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; {18207#(< ~counter~0 89)} is VALID [2022-04-08 14:33:42,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {17553#true} call ULTIMATE.init(); {17553#true} is VALID [2022-04-08 14:33:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 14:33:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:42,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835457814] [2022-04-08 14:33:42,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:42,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336152310] [2022-04-08 14:33:42,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336152310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:42,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:42,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 14:33:42,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:42,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [496727339] [2022-04-08 14:33:42,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [496727339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:42,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:42,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 14:33:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010960522] [2022-04-08 14:33:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:42,089 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 111 [2022-04-08 14:33:42,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:42,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:42,168 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-08 14:33:42,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 14:33:42,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:42,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 14:33:42,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 14:33:42,169 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:42,630 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2022-04-08 14:33:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 14:33:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 111 [2022-04-08 14:33:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-08 14:33:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-08 14:33:42,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 126 transitions. [2022-04-08 14:33:42,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:42,752 INFO L225 Difference]: With dead ends: 126 [2022-04-08 14:33:42,752 INFO L226 Difference]: Without dead ends: 116 [2022-04-08 14:33:42,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=627, Invalid=855, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 14:33:42,753 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:42,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:33:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-08 14:33:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-08 14:33:42,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:42,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:42,954 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:42,954 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:42,956 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-08 14:33:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 14:33:42,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:42,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:42,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 116 states. [2022-04-08 14:33:42,957 INFO L87 Difference]: Start difference. First operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 116 states. [2022-04-08 14:33:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:42,959 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-08 14:33:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 14:33:42,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:42,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:42,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:42,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-04-08 14:33:42,961 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 111 [2022-04-08 14:33:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:42,962 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-04-08 14:33:42,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:33:42,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 118 transitions. [2022-04-08 14:33:43,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 14:33:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 14:33:43,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:43,218 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:43,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-08 14:33:43,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 14:33:43,423 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 21 times [2022-04-08 14:33:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464344994] [2022-04-08 14:33:43,526 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:43,526 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 22 times [2022-04-08 14:33:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:43,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746766014] [2022-04-08 14:33:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:43,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:43,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456500284] [2022-04-08 14:33:43,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:43,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:43,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:43,547 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:33:43,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 14:33:43,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:43,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:43,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 14:33:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:43,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:44,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {18984#true} call ULTIMATE.init(); {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {18984#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; {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18984#true} {18984#true} #61#return; {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {18984#true} call #t~ret6 := main(); {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {18984#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; {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {18984#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18984#true} {18984#true} #53#return; {18984#true} is VALID [2022-04-08 14:33:44,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {18984#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19022#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:44,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {19022#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19022#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:44,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {19022#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {19022#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:44,218 INFO L272 TraceCheckUtils]: 14: Hoare triple {19022#(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)); {18984#true} is VALID [2022-04-08 14:33:44,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,219 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18984#true} {19022#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {19022#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:44,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {19022#(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; {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:44,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:44,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:44,220 INFO L272 TraceCheckUtils]: 22: Hoare triple {19047#(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)); {18984#true} is VALID [2022-04-08 14:33:44,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,221 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18984#true} {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:44,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {19047#(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; {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:44,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:44,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:44,222 INFO L272 TraceCheckUtils]: 30: Hoare triple {19072#(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)); {18984#true} is VALID [2022-04-08 14:33:44,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,223 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18984#true} {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:44,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {19072#(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; {19097#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:33:44,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {19097#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19097#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:33:44,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {19097#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {19097#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:33:44,224 INFO L272 TraceCheckUtils]: 38: Hoare triple {19097#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,224 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18984#true} {19097#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {19097#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:33:44,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {19097#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:44,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:44,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:44,226 INFO L272 TraceCheckUtils]: 46: Hoare triple {19122#(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)); {18984#true} is VALID [2022-04-08 14:33:44,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,226 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18984#true} {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:44,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {19122#(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; {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:44,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:44,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:44,228 INFO L272 TraceCheckUtils]: 54: Hoare triple {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,228 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18984#true} {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:44,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:44,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:44,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:44,229 INFO L272 TraceCheckUtils]: 62: Hoare triple {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,229 INFO L290 TraceCheckUtils]: 64: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,230 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18984#true} {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:44,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:44,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:44,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:44,231 INFO L272 TraceCheckUtils]: 70: Hoare triple {19197#(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)); {18984#true} is VALID [2022-04-08 14:33:44,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,231 INFO L290 TraceCheckUtils]: 73: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,232 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18984#true} {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:44,232 INFO L290 TraceCheckUtils]: 75: Hoare triple {19197#(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; {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:33:44,233 INFO L290 TraceCheckUtils]: 76: Hoare triple {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:33:44,233 INFO L290 TraceCheckUtils]: 77: Hoare triple {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 100);havoc #t~post5; {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:33:44,233 INFO L272 TraceCheckUtils]: 78: Hoare triple {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,233 INFO L290 TraceCheckUtils]: 79: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,233 INFO L290 TraceCheckUtils]: 80: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,233 INFO L290 TraceCheckUtils]: 81: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,234 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18984#true} {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #55#return; {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:33:44,234 INFO L290 TraceCheckUtils]: 83: Hoare triple {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19247#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:33:44,234 INFO L290 TraceCheckUtils]: 84: Hoare triple {19247#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19247#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:33:44,235 INFO L290 TraceCheckUtils]: 85: Hoare triple {19247#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {19247#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:33:44,235 INFO L272 TraceCheckUtils]: 86: Hoare triple {19247#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,235 INFO L290 TraceCheckUtils]: 87: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,235 INFO L290 TraceCheckUtils]: 89: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,235 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18984#true} {19247#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {19247#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:33:44,236 INFO L290 TraceCheckUtils]: 91: Hoare triple {19247#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 14:33:44,236 INFO L290 TraceCheckUtils]: 92: Hoare triple {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 14:33:44,237 INFO L290 TraceCheckUtils]: 93: Hoare triple {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 14:33:44,237 INFO L272 TraceCheckUtils]: 94: Hoare triple {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,237 INFO L290 TraceCheckUtils]: 95: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,237 INFO L290 TraceCheckUtils]: 96: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,237 INFO L290 TraceCheckUtils]: 97: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,237 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {18984#true} {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #55#return; {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 14:33:44,238 INFO L290 TraceCheckUtils]: 99: Hoare triple {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 14:33:44,238 INFO L290 TraceCheckUtils]: 100: Hoare triple {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 14:33:44,238 INFO L290 TraceCheckUtils]: 101: Hoare triple {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !!(#t~post5 < 100);havoc #t~post5; {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 14:33:44,239 INFO L272 TraceCheckUtils]: 102: Hoare triple {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,239 INFO L290 TraceCheckUtils]: 103: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,239 INFO L290 TraceCheckUtils]: 104: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,239 INFO L290 TraceCheckUtils]: 105: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,239 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18984#true} {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #55#return; {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 14:33:44,240 INFO L290 TraceCheckUtils]: 107: Hoare triple {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {19322#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-08 14:33:44,240 INFO L272 TraceCheckUtils]: 108: Hoare triple {19322#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18984#true} is VALID [2022-04-08 14:33:44,240 INFO L290 TraceCheckUtils]: 109: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-08 14:33:44,240 INFO L290 TraceCheckUtils]: 110: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-08 14:33:44,240 INFO L290 TraceCheckUtils]: 111: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-08 14:33:44,241 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {18984#true} {19322#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} #57#return; {19322#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-08 14:33:44,241 INFO L272 TraceCheckUtils]: 113: Hoare triple {19322#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {19341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:44,241 INFO L290 TraceCheckUtils]: 114: Hoare triple {19341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:44,242 INFO L290 TraceCheckUtils]: 115: Hoare triple {19345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18985#false} is VALID [2022-04-08 14:33:44,242 INFO L290 TraceCheckUtils]: 116: Hoare triple {18985#false} assume !false; {18985#false} is VALID [2022-04-08 14:33:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 14:33:44,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:44,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:44,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746766014] [2022-04-08 14:33:44,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:44,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456500284] [2022-04-08 14:33:44,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456500284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:44,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:44,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 14:33:44,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:44,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464344994] [2022-04-08 14:33:44,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464344994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:44,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:44,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 14:33:44,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762558381] [2022-04-08 14:33:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:44,544 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-08 14:33:44,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:44,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:33:44,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:44,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 14:33:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 14:33:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:33:44,607 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:33:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:46,235 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-08 14:33:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 14:33:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-08 14:33:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:33:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-08 14:33:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:33:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-08 14:33:46,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-08 14:33:46,331 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-08 14:33:46,333 INFO L225 Difference]: With dead ends: 124 [2022-04-08 14:33:46,333 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 14:33:46,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:33:46,334 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:46,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 701 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 14:33:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 14:33:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-08 14:33:46,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:46,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:46,541 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:46,542 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:46,544 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-08 14:33:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 14:33:46,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:46,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:46,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-08 14:33:46,545 INFO L87 Difference]: Start difference. First operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-08 14:33:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:46,546 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-08 14:33:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 14:33:46,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:46,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:46,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:46,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-08 14:33:46,549 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 117 [2022-04-08 14:33:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:46,549 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-08 14:33:46,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:33:46,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-08 14:33:46,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 14:33:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 14:33:46,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:46,806 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:46,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 14:33:47,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 14:33:47,006 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 21 times [2022-04-08 14:33:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:47,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59042194] [2022-04-08 14:33:47,111 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:47,111 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 22 times [2022-04-08 14:33:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:47,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205401351] [2022-04-08 14:33:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:47,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:47,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159715472] [2022-04-08 14:33:47,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:47,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:47,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:47,137 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:33:47,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 14:33:47,217 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:47,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:47,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 14:33:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:47,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:47,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2022-04-08 14:33:47,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {20135#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; {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {20143#(<= ~counter~0 0)} assume true; {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20143#(<= ~counter~0 0)} {20135#true} #61#return; {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {20143#(<= ~counter~0 0)} call #t~ret6 := main(); {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {20143#(<= ~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; {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {20143#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {20143#(<= ~counter~0 0)} ~cond := #in~cond; {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {20143#(<= ~counter~0 0)} assume !(0 == ~cond); {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {20143#(<= ~counter~0 0)} assume true; {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20143#(<= ~counter~0 0)} {20143#(<= ~counter~0 0)} #53#return; {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {20143#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20143#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:47,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {20143#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20177#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:47,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {20177#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {20177#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:47,949 INFO L272 TraceCheckUtils]: 14: Hoare triple {20177#(<= ~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)); {20177#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:47,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {20177#(<= ~counter~0 1)} ~cond := #in~cond; {20177#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:47,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {20177#(<= ~counter~0 1)} assume !(0 == ~cond); {20177#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:47,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {20177#(<= ~counter~0 1)} assume true; {20177#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:47,950 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20177#(<= ~counter~0 1)} {20177#(<= ~counter~0 1)} #55#return; {20177#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:47,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {20177#(<= ~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; {20177#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:47,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {20177#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20202#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:47,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {20202#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {20202#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:47,952 INFO L272 TraceCheckUtils]: 22: Hoare triple {20202#(<= ~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)); {20202#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:47,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {20202#(<= ~counter~0 2)} ~cond := #in~cond; {20202#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:47,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {20202#(<= ~counter~0 2)} assume !(0 == ~cond); {20202#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:47,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {20202#(<= ~counter~0 2)} assume true; {20202#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:47,953 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20202#(<= ~counter~0 2)} {20202#(<= ~counter~0 2)} #55#return; {20202#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:47,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {20202#(<= ~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; {20202#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:47,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {20202#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20227#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:47,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {20227#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {20227#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:47,954 INFO L272 TraceCheckUtils]: 30: Hoare triple {20227#(<= ~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)); {20227#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:47,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {20227#(<= ~counter~0 3)} ~cond := #in~cond; {20227#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:47,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {20227#(<= ~counter~0 3)} assume !(0 == ~cond); {20227#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:47,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {20227#(<= ~counter~0 3)} assume true; {20227#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:47,956 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20227#(<= ~counter~0 3)} {20227#(<= ~counter~0 3)} #55#return; {20227#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:47,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {20227#(<= ~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; {20227#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:47,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {20227#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20252#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:47,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {20252#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {20252#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:47,957 INFO L272 TraceCheckUtils]: 38: Hoare triple {20252#(<= ~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)); {20252#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:47,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {20252#(<= ~counter~0 4)} ~cond := #in~cond; {20252#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:47,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {20252#(<= ~counter~0 4)} assume !(0 == ~cond); {20252#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:47,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {20252#(<= ~counter~0 4)} assume true; {20252#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:47,958 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20252#(<= ~counter~0 4)} {20252#(<= ~counter~0 4)} #55#return; {20252#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:47,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {20252#(<= ~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; {20252#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:47,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {20252#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20277#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:47,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {20277#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {20277#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:47,960 INFO L272 TraceCheckUtils]: 46: Hoare triple {20277#(<= ~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)); {20277#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:47,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {20277#(<= ~counter~0 5)} ~cond := #in~cond; {20277#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:47,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {20277#(<= ~counter~0 5)} assume !(0 == ~cond); {20277#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:47,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {20277#(<= ~counter~0 5)} assume true; {20277#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:47,961 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20277#(<= ~counter~0 5)} {20277#(<= ~counter~0 5)} #55#return; {20277#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:47,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {20277#(<= ~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; {20277#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:47,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {20277#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20302#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:47,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {20302#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {20302#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:47,962 INFO L272 TraceCheckUtils]: 54: Hoare triple {20302#(<= ~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)); {20302#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:47,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {20302#(<= ~counter~0 6)} ~cond := #in~cond; {20302#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:47,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {20302#(<= ~counter~0 6)} assume !(0 == ~cond); {20302#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:47,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {20302#(<= ~counter~0 6)} assume true; {20302#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:47,964 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20302#(<= ~counter~0 6)} {20302#(<= ~counter~0 6)} #55#return; {20302#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:47,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {20302#(<= ~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; {20302#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:47,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {20302#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20327#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:47,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {20327#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {20327#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:47,965 INFO L272 TraceCheckUtils]: 62: Hoare triple {20327#(<= ~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)); {20327#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:47,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {20327#(<= ~counter~0 7)} ~cond := #in~cond; {20327#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:47,966 INFO L290 TraceCheckUtils]: 64: Hoare triple {20327#(<= ~counter~0 7)} assume !(0 == ~cond); {20327#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:47,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {20327#(<= ~counter~0 7)} assume true; {20327#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:47,966 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20327#(<= ~counter~0 7)} {20327#(<= ~counter~0 7)} #55#return; {20327#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:47,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {20327#(<= ~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; {20327#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:47,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {20327#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20352#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:47,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {20352#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {20352#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:47,968 INFO L272 TraceCheckUtils]: 70: Hoare triple {20352#(<= ~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)); {20352#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:47,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {20352#(<= ~counter~0 8)} ~cond := #in~cond; {20352#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:47,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {20352#(<= ~counter~0 8)} assume !(0 == ~cond); {20352#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:47,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {20352#(<= ~counter~0 8)} assume true; {20352#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:47,969 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20352#(<= ~counter~0 8)} {20352#(<= ~counter~0 8)} #55#return; {20352#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:47,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {20352#(<= ~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; {20352#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:47,970 INFO L290 TraceCheckUtils]: 76: Hoare triple {20352#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20377#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:47,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {20377#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {20377#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:47,971 INFO L272 TraceCheckUtils]: 78: Hoare triple {20377#(<= ~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)); {20377#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:47,971 INFO L290 TraceCheckUtils]: 79: Hoare triple {20377#(<= ~counter~0 9)} ~cond := #in~cond; {20377#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:47,971 INFO L290 TraceCheckUtils]: 80: Hoare triple {20377#(<= ~counter~0 9)} assume !(0 == ~cond); {20377#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:47,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {20377#(<= ~counter~0 9)} assume true; {20377#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:47,972 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20377#(<= ~counter~0 9)} {20377#(<= ~counter~0 9)} #55#return; {20377#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:47,972 INFO L290 TraceCheckUtils]: 83: Hoare triple {20377#(<= ~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; {20377#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:47,973 INFO L290 TraceCheckUtils]: 84: Hoare triple {20377#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20402#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:47,973 INFO L290 TraceCheckUtils]: 85: Hoare triple {20402#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {20402#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:47,973 INFO L272 TraceCheckUtils]: 86: Hoare triple {20402#(<= ~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)); {20402#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:47,974 INFO L290 TraceCheckUtils]: 87: Hoare triple {20402#(<= ~counter~0 10)} ~cond := #in~cond; {20402#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:47,974 INFO L290 TraceCheckUtils]: 88: Hoare triple {20402#(<= ~counter~0 10)} assume !(0 == ~cond); {20402#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:47,974 INFO L290 TraceCheckUtils]: 89: Hoare triple {20402#(<= ~counter~0 10)} assume true; {20402#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:47,975 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20402#(<= ~counter~0 10)} {20402#(<= ~counter~0 10)} #55#return; {20402#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:47,975 INFO L290 TraceCheckUtils]: 91: Hoare triple {20402#(<= ~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; {20402#(<= ~counter~0 10)} is VALID [2022-04-08 14:33:47,975 INFO L290 TraceCheckUtils]: 92: Hoare triple {20402#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20427#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:47,976 INFO L290 TraceCheckUtils]: 93: Hoare triple {20427#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {20427#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:47,976 INFO L272 TraceCheckUtils]: 94: Hoare triple {20427#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20427#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:47,976 INFO L290 TraceCheckUtils]: 95: Hoare triple {20427#(<= ~counter~0 11)} ~cond := #in~cond; {20427#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:47,977 INFO L290 TraceCheckUtils]: 96: Hoare triple {20427#(<= ~counter~0 11)} assume !(0 == ~cond); {20427#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:47,977 INFO L290 TraceCheckUtils]: 97: Hoare triple {20427#(<= ~counter~0 11)} assume true; {20427#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:47,977 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20427#(<= ~counter~0 11)} {20427#(<= ~counter~0 11)} #55#return; {20427#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:47,978 INFO L290 TraceCheckUtils]: 99: Hoare triple {20427#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20427#(<= ~counter~0 11)} is VALID [2022-04-08 14:33:47,978 INFO L290 TraceCheckUtils]: 100: Hoare triple {20427#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20452#(<= ~counter~0 12)} is VALID [2022-04-08 14:33:47,978 INFO L290 TraceCheckUtils]: 101: Hoare triple {20452#(<= ~counter~0 12)} assume !!(#t~post5 < 100);havoc #t~post5; {20452#(<= ~counter~0 12)} is VALID [2022-04-08 14:33:47,979 INFO L272 TraceCheckUtils]: 102: Hoare triple {20452#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20452#(<= ~counter~0 12)} is VALID [2022-04-08 14:33:47,979 INFO L290 TraceCheckUtils]: 103: Hoare triple {20452#(<= ~counter~0 12)} ~cond := #in~cond; {20452#(<= ~counter~0 12)} is VALID [2022-04-08 14:33:47,979 INFO L290 TraceCheckUtils]: 104: Hoare triple {20452#(<= ~counter~0 12)} assume !(0 == ~cond); {20452#(<= ~counter~0 12)} is VALID [2022-04-08 14:33:47,980 INFO L290 TraceCheckUtils]: 105: Hoare triple {20452#(<= ~counter~0 12)} assume true; {20452#(<= ~counter~0 12)} is VALID [2022-04-08 14:33:47,980 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20452#(<= ~counter~0 12)} {20452#(<= ~counter~0 12)} #55#return; {20452#(<= ~counter~0 12)} is VALID [2022-04-08 14:33:47,980 INFO L290 TraceCheckUtils]: 107: Hoare triple {20452#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20452#(<= ~counter~0 12)} is VALID [2022-04-08 14:33:47,981 INFO L290 TraceCheckUtils]: 108: Hoare triple {20452#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20477#(<= |main_#t~post5| 12)} is VALID [2022-04-08 14:33:47,981 INFO L290 TraceCheckUtils]: 109: Hoare triple {20477#(<= |main_#t~post5| 12)} assume !(#t~post5 < 100);havoc #t~post5; {20136#false} is VALID [2022-04-08 14:33:47,981 INFO L272 TraceCheckUtils]: 110: Hoare triple {20136#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)); {20136#false} is VALID [2022-04-08 14:33:47,981 INFO L290 TraceCheckUtils]: 111: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2022-04-08 14:33:47,981 INFO L290 TraceCheckUtils]: 112: Hoare triple {20136#false} assume !(0 == ~cond); {20136#false} is VALID [2022-04-08 14:33:47,981 INFO L290 TraceCheckUtils]: 113: Hoare triple {20136#false} assume true; {20136#false} is VALID [2022-04-08 14:33:47,981 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20136#false} {20136#false} #57#return; {20136#false} is VALID [2022-04-08 14:33:47,982 INFO L272 TraceCheckUtils]: 115: Hoare triple {20136#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20136#false} is VALID [2022-04-08 14:33:47,982 INFO L290 TraceCheckUtils]: 116: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2022-04-08 14:33:47,982 INFO L290 TraceCheckUtils]: 117: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2022-04-08 14:33:47,982 INFO L290 TraceCheckUtils]: 118: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2022-04-08 14:33:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:47,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:48,679 INFO L290 TraceCheckUtils]: 118: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2022-04-08 14:33:48,679 INFO L290 TraceCheckUtils]: 117: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2022-04-08 14:33:48,679 INFO L290 TraceCheckUtils]: 116: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2022-04-08 14:33:48,679 INFO L272 TraceCheckUtils]: 115: Hoare triple {20136#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20136#false} is VALID [2022-04-08 14:33:48,679 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20135#true} {20136#false} #57#return; {20136#false} is VALID [2022-04-08 14:33:48,680 INFO L290 TraceCheckUtils]: 113: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,680 INFO L290 TraceCheckUtils]: 112: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,680 INFO L290 TraceCheckUtils]: 111: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,680 INFO L272 TraceCheckUtils]: 110: Hoare triple {20136#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)); {20135#true} is VALID [2022-04-08 14:33:48,680 INFO L290 TraceCheckUtils]: 109: Hoare triple {20535#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {20136#false} is VALID [2022-04-08 14:33:48,681 INFO L290 TraceCheckUtils]: 108: Hoare triple {20539#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20535#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:33:48,681 INFO L290 TraceCheckUtils]: 107: Hoare triple {20539#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20539#(< ~counter~0 100)} is VALID [2022-04-08 14:33:48,682 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20135#true} {20539#(< ~counter~0 100)} #55#return; {20539#(< ~counter~0 100)} is VALID [2022-04-08 14:33:48,682 INFO L290 TraceCheckUtils]: 105: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,682 INFO L290 TraceCheckUtils]: 104: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,682 INFO L290 TraceCheckUtils]: 103: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,682 INFO L272 TraceCheckUtils]: 102: Hoare triple {20539#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,683 INFO L290 TraceCheckUtils]: 101: Hoare triple {20539#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {20539#(< ~counter~0 100)} is VALID [2022-04-08 14:33:48,684 INFO L290 TraceCheckUtils]: 100: Hoare triple {20564#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20539#(< ~counter~0 100)} is VALID [2022-04-08 14:33:48,684 INFO L290 TraceCheckUtils]: 99: Hoare triple {20564#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20564#(< ~counter~0 99)} is VALID [2022-04-08 14:33:48,685 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20135#true} {20564#(< ~counter~0 99)} #55#return; {20564#(< ~counter~0 99)} is VALID [2022-04-08 14:33:48,685 INFO L290 TraceCheckUtils]: 97: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,685 INFO L290 TraceCheckUtils]: 96: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,685 INFO L290 TraceCheckUtils]: 95: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,685 INFO L272 TraceCheckUtils]: 94: Hoare triple {20564#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,686 INFO L290 TraceCheckUtils]: 93: Hoare triple {20564#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {20564#(< ~counter~0 99)} is VALID [2022-04-08 14:33:48,686 INFO L290 TraceCheckUtils]: 92: Hoare triple {20589#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20564#(< ~counter~0 99)} is VALID [2022-04-08 14:33:48,687 INFO L290 TraceCheckUtils]: 91: Hoare triple {20589#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20589#(< ~counter~0 98)} is VALID [2022-04-08 14:33:48,687 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20135#true} {20589#(< ~counter~0 98)} #55#return; {20589#(< ~counter~0 98)} is VALID [2022-04-08 14:33:48,687 INFO L290 TraceCheckUtils]: 89: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,688 INFO L290 TraceCheckUtils]: 88: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,688 INFO L290 TraceCheckUtils]: 87: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,688 INFO L272 TraceCheckUtils]: 86: Hoare triple {20589#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,688 INFO L290 TraceCheckUtils]: 85: Hoare triple {20589#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {20589#(< ~counter~0 98)} is VALID [2022-04-08 14:33:48,688 INFO L290 TraceCheckUtils]: 84: Hoare triple {20614#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20589#(< ~counter~0 98)} is VALID [2022-04-08 14:33:48,689 INFO L290 TraceCheckUtils]: 83: Hoare triple {20614#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20614#(< ~counter~0 97)} is VALID [2022-04-08 14:33:48,689 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20135#true} {20614#(< ~counter~0 97)} #55#return; {20614#(< ~counter~0 97)} is VALID [2022-04-08 14:33:48,689 INFO L290 TraceCheckUtils]: 81: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,689 INFO L290 TraceCheckUtils]: 79: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,689 INFO L272 TraceCheckUtils]: 78: Hoare triple {20614#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,690 INFO L290 TraceCheckUtils]: 77: Hoare triple {20614#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {20614#(< ~counter~0 97)} is VALID [2022-04-08 14:33:48,690 INFO L290 TraceCheckUtils]: 76: Hoare triple {20639#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20614#(< ~counter~0 97)} is VALID [2022-04-08 14:33:48,691 INFO L290 TraceCheckUtils]: 75: Hoare triple {20639#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20639#(< ~counter~0 96)} is VALID [2022-04-08 14:33:48,691 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20135#true} {20639#(< ~counter~0 96)} #55#return; {20639#(< ~counter~0 96)} is VALID [2022-04-08 14:33:48,691 INFO L290 TraceCheckUtils]: 73: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,692 INFO L290 TraceCheckUtils]: 72: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,692 INFO L290 TraceCheckUtils]: 71: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,692 INFO L272 TraceCheckUtils]: 70: Hoare triple {20639#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,692 INFO L290 TraceCheckUtils]: 69: Hoare triple {20639#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {20639#(< ~counter~0 96)} is VALID [2022-04-08 14:33:48,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {20664#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20639#(< ~counter~0 96)} is VALID [2022-04-08 14:33:48,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {20664#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20664#(< ~counter~0 95)} is VALID [2022-04-08 14:33:48,694 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20135#true} {20664#(< ~counter~0 95)} #55#return; {20664#(< ~counter~0 95)} is VALID [2022-04-08 14:33:48,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,694 INFO L272 TraceCheckUtils]: 62: Hoare triple {20664#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {20664#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {20664#(< ~counter~0 95)} is VALID [2022-04-08 14:33:48,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {20689#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20664#(< ~counter~0 95)} is VALID [2022-04-08 14:33:48,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {20689#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20689#(< ~counter~0 94)} is VALID [2022-04-08 14:33:48,696 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20135#true} {20689#(< ~counter~0 94)} #55#return; {20689#(< ~counter~0 94)} is VALID [2022-04-08 14:33:48,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,696 INFO L272 TraceCheckUtils]: 54: Hoare triple {20689#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {20689#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {20689#(< ~counter~0 94)} is VALID [2022-04-08 14:33:48,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {20714#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20689#(< ~counter~0 94)} is VALID [2022-04-08 14:33:48,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {20714#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20714#(< ~counter~0 93)} is VALID [2022-04-08 14:33:48,698 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20135#true} {20714#(< ~counter~0 93)} #55#return; {20714#(< ~counter~0 93)} is VALID [2022-04-08 14:33:48,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,699 INFO L272 TraceCheckUtils]: 46: Hoare triple {20714#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {20714#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {20714#(< ~counter~0 93)} is VALID [2022-04-08 14:33:48,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {20739#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20714#(< ~counter~0 93)} is VALID [2022-04-08 14:33:48,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {20739#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20739#(< ~counter~0 92)} is VALID [2022-04-08 14:33:48,700 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20135#true} {20739#(< ~counter~0 92)} #55#return; {20739#(< ~counter~0 92)} is VALID [2022-04-08 14:33:48,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,701 INFO L272 TraceCheckUtils]: 38: Hoare triple {20739#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {20739#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {20739#(< ~counter~0 92)} is VALID [2022-04-08 14:33:48,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {20764#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20739#(< ~counter~0 92)} is VALID [2022-04-08 14:33:48,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {20764#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20764#(< ~counter~0 91)} is VALID [2022-04-08 14:33:48,702 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20135#true} {20764#(< ~counter~0 91)} #55#return; {20764#(< ~counter~0 91)} is VALID [2022-04-08 14:33:48,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,702 INFO L272 TraceCheckUtils]: 30: Hoare triple {20764#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {20764#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {20764#(< ~counter~0 91)} is VALID [2022-04-08 14:33:48,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {20789#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20764#(< ~counter~0 91)} is VALID [2022-04-08 14:33:48,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {20789#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20789#(< ~counter~0 90)} is VALID [2022-04-08 14:33:48,704 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20135#true} {20789#(< ~counter~0 90)} #55#return; {20789#(< ~counter~0 90)} is VALID [2022-04-08 14:33:48,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,704 INFO L272 TraceCheckUtils]: 22: Hoare triple {20789#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {20789#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {20789#(< ~counter~0 90)} is VALID [2022-04-08 14:33:48,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {20814#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20789#(< ~counter~0 90)} is VALID [2022-04-08 14:33:48,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {20814#(< ~counter~0 89)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20814#(< ~counter~0 89)} is VALID [2022-04-08 14:33:48,706 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20135#true} {20814#(< ~counter~0 89)} #55#return; {20814#(< ~counter~0 89)} is VALID [2022-04-08 14:33:48,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,706 INFO L272 TraceCheckUtils]: 14: Hoare triple {20814#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {20814#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {20814#(< ~counter~0 89)} is VALID [2022-04-08 14:33:48,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {20839#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20814#(< ~counter~0 89)} is VALID [2022-04-08 14:33:48,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {20839#(< ~counter~0 88)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20839#(< ~counter~0 88)} is VALID [2022-04-08 14:33:48,708 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20135#true} {20839#(< ~counter~0 88)} #53#return; {20839#(< ~counter~0 88)} is VALID [2022-04-08 14:33:48,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-08 14:33:48,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-08 14:33:48,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-08 14:33:48,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {20839#(< ~counter~0 88)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20135#true} is VALID [2022-04-08 14:33:48,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {20839#(< ~counter~0 88)} 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; {20839#(< ~counter~0 88)} is VALID [2022-04-08 14:33:48,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {20839#(< ~counter~0 88)} call #t~ret6 := main(); {20839#(< ~counter~0 88)} is VALID [2022-04-08 14:33:48,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20839#(< ~counter~0 88)} {20135#true} #61#return; {20839#(< ~counter~0 88)} is VALID [2022-04-08 14:33:48,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {20839#(< ~counter~0 88)} assume true; {20839#(< ~counter~0 88)} is VALID [2022-04-08 14:33:48,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {20135#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; {20839#(< ~counter~0 88)} is VALID [2022-04-08 14:33:48,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2022-04-08 14:33:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 26 proven. 288 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 14:33:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:48,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205401351] [2022-04-08 14:33:48,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:48,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159715472] [2022-04-08 14:33:48,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159715472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:48,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:48,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 14:33:48,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:48,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59042194] [2022-04-08 14:33:48,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59042194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:48,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:48,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 14:33:48,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185625330] [2022-04-08 14:33:48,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:48,712 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 119 [2022-04-08 14:33:48,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:48,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:48,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:48,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 14:33:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 14:33:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 14:33:48,803 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:49,273 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-04-08 14:33:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 14:33:49,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 119 [2022-04-08 14:33:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-08 14:33:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-08 14:33:49,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 134 transitions. [2022-04-08 14:33:49,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:49,403 INFO L225 Difference]: With dead ends: 134 [2022-04-08 14:33:49,404 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 14:33:49,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=731, Invalid=991, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 14:33:49,405 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:49,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:33:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 14:33:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-08 14:33:49,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:49,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:49,618 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:49,618 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:49,620 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-08 14:33:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 14:33:49,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:49,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:49,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 124 states. [2022-04-08 14:33:49,621 INFO L87 Difference]: Start difference. First operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 124 states. [2022-04-08 14:33:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:49,637 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-08 14:33:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 14:33:49,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:49,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:49,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:49,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2022-04-08 14:33:49,640 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 119 [2022-04-08 14:33:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:49,640 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2022-04-08 14:33:49,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:33:49,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 126 transitions. [2022-04-08 14:33:49,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 14:33:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-08 14:33:49,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:49,941 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:49,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 14:33:50,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 14:33:50,141 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 23 times [2022-04-08 14:33:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:50,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1110062958] [2022-04-08 14:33:50,244 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:50,244 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 24 times [2022-04-08 14:33:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:50,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570732973] [2022-04-08 14:33:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:50,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:50,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707699127] [2022-04-08 14:33:50,263 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:33:50,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:50,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:50,265 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:33:50,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 14:33:53,567 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 14:33:53,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:53,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 14:33:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:53,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:54,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {21666#true} call ULTIMATE.init(); {21666#true} is VALID [2022-04-08 14:33:54,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {21666#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; {21666#true} is VALID [2022-04-08 14:33:54,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21666#true} {21666#true} #61#return; {21666#true} is VALID [2022-04-08 14:33:54,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {21666#true} call #t~ret6 := main(); {21666#true} is VALID [2022-04-08 14:33:54,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {21666#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; {21666#true} is VALID [2022-04-08 14:33:54,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {21666#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {21666#true} is VALID [2022-04-08 14:33:54,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,470 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21666#true} {21666#true} #53#return; {21666#true} is VALID [2022-04-08 14:33:54,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {21666#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:54,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {21704#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:54,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {21704#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {21704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:54,472 INFO L272 TraceCheckUtils]: 14: Hoare triple {21704#(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)); {21666#true} is VALID [2022-04-08 14:33:54,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,473 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21666#true} {21704#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {21704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:54,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {21704#(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; {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:54,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:54,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:54,474 INFO L272 TraceCheckUtils]: 22: Hoare triple {21729#(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)); {21666#true} is VALID [2022-04-08 14:33:54,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,475 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21666#true} {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:54,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {21729#(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; {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:33:54,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:33:54,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 100);havoc #t~post5; {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:33:54,479 INFO L272 TraceCheckUtils]: 30: Hoare triple {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~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)); {21666#true} is VALID [2022-04-08 14:33:54,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,480 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21666#true} {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:33:54,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~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; {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:33:54,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:33:54,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(#t~post5 < 100);havoc #t~post5; {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:33:54,483 INFO L272 TraceCheckUtils]: 38: Hoare triple {21779#(and (= (+ (- 2) main_~c~0) 1) (= 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)); {21666#true} is VALID [2022-04-08 14:33:54,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,484 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21666#true} {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #55#return; {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:33:54,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {21779#(and (= (+ (- 2) main_~c~0) 1) (= 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; {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} is VALID [2022-04-08 14:33:54,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} is VALID [2022-04-08 14:33:54,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} is VALID [2022-04-08 14:33:54,486 INFO L272 TraceCheckUtils]: 46: Hoare triple {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21666#true} is VALID [2022-04-08 14:33:54,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,487 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21666#true} {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} #55#return; {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} is VALID [2022-04-08 14:33:54,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:33:54,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:33:54,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:33:54,488 INFO L272 TraceCheckUtils]: 54: Hoare triple {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 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)); {21666#true} is VALID [2022-04-08 14:33:54,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,489 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21666#true} {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} #55#return; {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:33:54,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 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; {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:33:54,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:33:54,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:33:54,491 INFO L272 TraceCheckUtils]: 62: Hoare triple {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 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)); {21666#true} is VALID [2022-04-08 14:33:54,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,491 INFO L290 TraceCheckUtils]: 65: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,492 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21666#true} {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} #55#return; {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:33:54,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 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; {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 14:33:54,494 INFO L290 TraceCheckUtils]: 68: Hoare triple {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 14:33:54,494 INFO L290 TraceCheckUtils]: 69: Hoare triple {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 14:33:54,494 INFO L272 TraceCheckUtils]: 70: Hoare triple {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21666#true} is VALID [2022-04-08 14:33:54,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,495 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21666#true} {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} #55#return; {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 14:33:54,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} is VALID [2022-04-08 14:33:54,497 INFO L290 TraceCheckUtils]: 76: Hoare triple {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} is VALID [2022-04-08 14:33:54,497 INFO L290 TraceCheckUtils]: 77: Hoare triple {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} is VALID [2022-04-08 14:33:54,497 INFO L272 TraceCheckUtils]: 78: Hoare triple {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= 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)); {21666#true} is VALID [2022-04-08 14:33:54,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,498 INFO L290 TraceCheckUtils]: 81: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,498 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21666#true} {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} #55#return; {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} is VALID [2022-04-08 14:33:54,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= 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; {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 14:33:54,499 INFO L290 TraceCheckUtils]: 84: Hoare triple {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 14:33:54,500 INFO L290 TraceCheckUtils]: 85: Hoare triple {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 14:33:54,500 INFO L272 TraceCheckUtils]: 86: Hoare triple {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 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)); {21666#true} is VALID [2022-04-08 14:33:54,500 INFO L290 TraceCheckUtils]: 87: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,500 INFO L290 TraceCheckUtils]: 88: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,500 INFO L290 TraceCheckUtils]: 89: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,501 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {21666#true} {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} #55#return; {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 14:33:54,501 INFO L290 TraceCheckUtils]: 91: Hoare triple {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 14:33:54,502 INFO L290 TraceCheckUtils]: 92: Hoare triple {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 14:33:54,502 INFO L290 TraceCheckUtils]: 93: Hoare triple {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} assume !!(#t~post5 < 100);havoc #t~post5; {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 14:33:54,502 INFO L272 TraceCheckUtils]: 94: Hoare triple {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) 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)); {21666#true} is VALID [2022-04-08 14:33:54,502 INFO L290 TraceCheckUtils]: 95: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,503 INFO L290 TraceCheckUtils]: 97: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,503 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21666#true} {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} #55#return; {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 14:33:54,504 INFO L290 TraceCheckUtils]: 99: Hoare triple {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} is VALID [2022-04-08 14:33:54,504 INFO L290 TraceCheckUtils]: 100: Hoare triple {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} is VALID [2022-04-08 14:33:54,505 INFO L290 TraceCheckUtils]: 101: Hoare triple {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} assume !!(#t~post5 < 100);havoc #t~post5; {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} is VALID [2022-04-08 14:33:54,505 INFO L272 TraceCheckUtils]: 102: Hoare triple {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21666#true} is VALID [2022-04-08 14:33:54,505 INFO L290 TraceCheckUtils]: 103: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,505 INFO L290 TraceCheckUtils]: 104: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,505 INFO L290 TraceCheckUtils]: 105: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,506 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {21666#true} {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} #55#return; {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} is VALID [2022-04-08 14:33:54,506 INFO L290 TraceCheckUtils]: 107: Hoare triple {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 14:33:54,507 INFO L290 TraceCheckUtils]: 108: Hoare triple {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 14:33:54,507 INFO L290 TraceCheckUtils]: 109: Hoare triple {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 14:33:54,507 INFO L272 TraceCheckUtils]: 110: Hoare triple {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21666#true} is VALID [2022-04-08 14:33:54,507 INFO L290 TraceCheckUtils]: 111: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,507 INFO L290 TraceCheckUtils]: 112: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,507 INFO L290 TraceCheckUtils]: 113: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,508 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {21666#true} {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #55#return; {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 14:33:54,508 INFO L290 TraceCheckUtils]: 115: Hoare triple {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {22029#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 14:33:54,508 INFO L272 TraceCheckUtils]: 116: Hoare triple {22029#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21666#true} is VALID [2022-04-08 14:33:54,508 INFO L290 TraceCheckUtils]: 117: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-08 14:33:54,509 INFO L290 TraceCheckUtils]: 118: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-08 14:33:54,509 INFO L290 TraceCheckUtils]: 119: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-08 14:33:54,509 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {21666#true} {22029#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} #57#return; {22029#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 14:33:54,510 INFO L272 TraceCheckUtils]: 121: Hoare triple {22029#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {22048#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:54,510 INFO L290 TraceCheckUtils]: 122: Hoare triple {22048#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22052#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:54,510 INFO L290 TraceCheckUtils]: 123: Hoare triple {22052#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21667#false} is VALID [2022-04-08 14:33:54,510 INFO L290 TraceCheckUtils]: 124: Hoare triple {21667#false} assume !false; {21667#false} is VALID [2022-04-08 14:33:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 28 proven. 312 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 14:33:54,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:55,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570732973] [2022-04-08 14:33:55,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:55,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707699127] [2022-04-08 14:33:55,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707699127] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:55,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:55,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 14:33:55,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:55,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1110062958] [2022-04-08 14:33:55,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1110062958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:55,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:55,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 14:33:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272148823] [2022-04-08 14:33:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:55,906 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 125 [2022-04-08 14:33:55,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:55,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 14:33:55,999 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-08 14:33:55,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 14:33:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:56,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 14:33:56,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2022-04-08 14:33:56,000 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 14:33:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:58,152 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-04-08 14:33:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:33:58,152 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 125 [2022-04-08 14:33:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 14:33:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-08 14:33:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 14:33:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-08 14:33:58,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 99 transitions. [2022-04-08 14:33:58,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:58,261 INFO L225 Difference]: With dead ends: 132 [2022-04-08 14:33:58,261 INFO L226 Difference]: Without dead ends: 126 [2022-04-08 14:33:58,261 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 14:33:58,262 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:58,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 769 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 14:33:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-08 14:33:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-04-08 14:33:58,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:58,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:33:58,512 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:33:58,512 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:33:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:58,516 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-08 14:33:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-08 14:33:58,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:58,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:58,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 126 states. [2022-04-08 14:33:58,518 INFO L87 Difference]: Start difference. First operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 126 states. [2022-04-08 14:33:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:58,520 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-08 14:33:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-08 14:33:58,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:58,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:58,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:58,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:33:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2022-04-08 14:33:58,524 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 125 [2022-04-08 14:33:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:58,524 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2022-04-08 14:33:58,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 14:33:58,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 129 transitions. [2022-04-08 14:34:00,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 128 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-08 14:34:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 14:34:00,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:00,747 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:00,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:00,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 14:34:00,948 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 23 times [2022-04-08 14:34:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:00,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [232509426] [2022-04-08 14:34:01,028 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:01,029 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 24 times [2022-04-08 14:34:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:01,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084053195] [2022-04-08 14:34:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:01,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:01,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557118447] [2022-04-08 14:34:01,043 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:34:01,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:01,044 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:01,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 14:34:03,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-08 14:34:03,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:03,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 14:34:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:03,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:04,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {23140#true} call ULTIMATE.init(); {23140#true} is VALID [2022-04-08 14:34:04,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {23140#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; {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {23148#(<= ~counter~0 0)} assume true; {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23148#(<= ~counter~0 0)} {23140#true} #61#return; {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {23148#(<= ~counter~0 0)} call #t~ret6 := main(); {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {23148#(<= ~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; {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,604 INFO L272 TraceCheckUtils]: 6: Hoare triple {23148#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {23148#(<= ~counter~0 0)} ~cond := #in~cond; {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {23148#(<= ~counter~0 0)} assume !(0 == ~cond); {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {23148#(<= ~counter~0 0)} assume true; {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23148#(<= ~counter~0 0)} {23148#(<= ~counter~0 0)} #53#return; {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {23148#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23148#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:04,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {23148#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23182#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:04,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {23182#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {23182#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:04,608 INFO L272 TraceCheckUtils]: 14: Hoare triple {23182#(<= ~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)); {23182#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:04,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {23182#(<= ~counter~0 1)} ~cond := #in~cond; {23182#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:04,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {23182#(<= ~counter~0 1)} assume !(0 == ~cond); {23182#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:04,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {23182#(<= ~counter~0 1)} assume true; {23182#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:04,609 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23182#(<= ~counter~0 1)} {23182#(<= ~counter~0 1)} #55#return; {23182#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:04,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {23182#(<= ~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; {23182#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:04,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {23182#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23207#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:04,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {23207#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {23207#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:04,611 INFO L272 TraceCheckUtils]: 22: Hoare triple {23207#(<= ~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)); {23207#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:04,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {23207#(<= ~counter~0 2)} ~cond := #in~cond; {23207#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:04,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {23207#(<= ~counter~0 2)} assume !(0 == ~cond); {23207#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:04,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {23207#(<= ~counter~0 2)} assume true; {23207#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:04,613 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23207#(<= ~counter~0 2)} {23207#(<= ~counter~0 2)} #55#return; {23207#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:04,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {23207#(<= ~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; {23207#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:04,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {23207#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23232#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:04,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {23232#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {23232#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:04,614 INFO L272 TraceCheckUtils]: 30: Hoare triple {23232#(<= ~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)); {23232#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:04,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {23232#(<= ~counter~0 3)} ~cond := #in~cond; {23232#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:04,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {23232#(<= ~counter~0 3)} assume !(0 == ~cond); {23232#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:04,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {23232#(<= ~counter~0 3)} assume true; {23232#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:04,616 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23232#(<= ~counter~0 3)} {23232#(<= ~counter~0 3)} #55#return; {23232#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:04,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {23232#(<= ~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; {23232#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:04,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {23232#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23257#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:04,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {23257#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {23257#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:04,618 INFO L272 TraceCheckUtils]: 38: Hoare triple {23257#(<= ~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)); {23257#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:04,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {23257#(<= ~counter~0 4)} ~cond := #in~cond; {23257#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:04,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {23257#(<= ~counter~0 4)} assume !(0 == ~cond); {23257#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:04,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {23257#(<= ~counter~0 4)} assume true; {23257#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:04,619 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23257#(<= ~counter~0 4)} {23257#(<= ~counter~0 4)} #55#return; {23257#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:04,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {23257#(<= ~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; {23257#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:04,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {23257#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23282#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:04,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {23282#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {23282#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:04,621 INFO L272 TraceCheckUtils]: 46: Hoare triple {23282#(<= ~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)); {23282#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:04,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {23282#(<= ~counter~0 5)} ~cond := #in~cond; {23282#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:04,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {23282#(<= ~counter~0 5)} assume !(0 == ~cond); {23282#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:04,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {23282#(<= ~counter~0 5)} assume true; {23282#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:04,622 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23282#(<= ~counter~0 5)} {23282#(<= ~counter~0 5)} #55#return; {23282#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:04,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {23282#(<= ~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; {23282#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:04,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {23282#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23307#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:04,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {23307#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {23307#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:04,624 INFO L272 TraceCheckUtils]: 54: Hoare triple {23307#(<= ~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)); {23307#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:04,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {23307#(<= ~counter~0 6)} ~cond := #in~cond; {23307#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:04,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {23307#(<= ~counter~0 6)} assume !(0 == ~cond); {23307#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:04,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {23307#(<= ~counter~0 6)} assume true; {23307#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:04,625 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23307#(<= ~counter~0 6)} {23307#(<= ~counter~0 6)} #55#return; {23307#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:04,626 INFO L290 TraceCheckUtils]: 59: Hoare triple {23307#(<= ~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; {23307#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:04,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {23307#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23332#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:04,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {23332#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {23332#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:04,627 INFO L272 TraceCheckUtils]: 62: Hoare triple {23332#(<= ~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)); {23332#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:04,627 INFO L290 TraceCheckUtils]: 63: Hoare triple {23332#(<= ~counter~0 7)} ~cond := #in~cond; {23332#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:04,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {23332#(<= ~counter~0 7)} assume !(0 == ~cond); {23332#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:04,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {23332#(<= ~counter~0 7)} assume true; {23332#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:04,629 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23332#(<= ~counter~0 7)} {23332#(<= ~counter~0 7)} #55#return; {23332#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:04,629 INFO L290 TraceCheckUtils]: 67: Hoare triple {23332#(<= ~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; {23332#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:04,630 INFO L290 TraceCheckUtils]: 68: Hoare triple {23332#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23357#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:04,630 INFO L290 TraceCheckUtils]: 69: Hoare triple {23357#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {23357#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:04,630 INFO L272 TraceCheckUtils]: 70: Hoare triple {23357#(<= ~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)); {23357#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:04,631 INFO L290 TraceCheckUtils]: 71: Hoare triple {23357#(<= ~counter~0 8)} ~cond := #in~cond; {23357#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:04,631 INFO L290 TraceCheckUtils]: 72: Hoare triple {23357#(<= ~counter~0 8)} assume !(0 == ~cond); {23357#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:04,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {23357#(<= ~counter~0 8)} assume true; {23357#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:04,632 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23357#(<= ~counter~0 8)} {23357#(<= ~counter~0 8)} #55#return; {23357#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:04,632 INFO L290 TraceCheckUtils]: 75: Hoare triple {23357#(<= ~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; {23357#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:04,633 INFO L290 TraceCheckUtils]: 76: Hoare triple {23357#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23382#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:04,633 INFO L290 TraceCheckUtils]: 77: Hoare triple {23382#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {23382#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:04,634 INFO L272 TraceCheckUtils]: 78: Hoare triple {23382#(<= ~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)); {23382#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:04,634 INFO L290 TraceCheckUtils]: 79: Hoare triple {23382#(<= ~counter~0 9)} ~cond := #in~cond; {23382#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:04,634 INFO L290 TraceCheckUtils]: 80: Hoare triple {23382#(<= ~counter~0 9)} assume !(0 == ~cond); {23382#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:04,635 INFO L290 TraceCheckUtils]: 81: Hoare triple {23382#(<= ~counter~0 9)} assume true; {23382#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:04,635 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23382#(<= ~counter~0 9)} {23382#(<= ~counter~0 9)} #55#return; {23382#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:04,635 INFO L290 TraceCheckUtils]: 83: Hoare triple {23382#(<= ~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; {23382#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:04,636 INFO L290 TraceCheckUtils]: 84: Hoare triple {23382#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23407#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:04,636 INFO L290 TraceCheckUtils]: 85: Hoare triple {23407#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {23407#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:04,637 INFO L272 TraceCheckUtils]: 86: Hoare triple {23407#(<= ~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)); {23407#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:04,637 INFO L290 TraceCheckUtils]: 87: Hoare triple {23407#(<= ~counter~0 10)} ~cond := #in~cond; {23407#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:04,637 INFO L290 TraceCheckUtils]: 88: Hoare triple {23407#(<= ~counter~0 10)} assume !(0 == ~cond); {23407#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:04,638 INFO L290 TraceCheckUtils]: 89: Hoare triple {23407#(<= ~counter~0 10)} assume true; {23407#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:04,638 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23407#(<= ~counter~0 10)} {23407#(<= ~counter~0 10)} #55#return; {23407#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:04,639 INFO L290 TraceCheckUtils]: 91: Hoare triple {23407#(<= ~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; {23407#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:04,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {23407#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23432#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:04,640 INFO L290 TraceCheckUtils]: 93: Hoare triple {23432#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {23432#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:04,640 INFO L272 TraceCheckUtils]: 94: Hoare triple {23432#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23432#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:04,640 INFO L290 TraceCheckUtils]: 95: Hoare triple {23432#(<= ~counter~0 11)} ~cond := #in~cond; {23432#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:04,641 INFO L290 TraceCheckUtils]: 96: Hoare triple {23432#(<= ~counter~0 11)} assume !(0 == ~cond); {23432#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:04,641 INFO L290 TraceCheckUtils]: 97: Hoare triple {23432#(<= ~counter~0 11)} assume true; {23432#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:04,642 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23432#(<= ~counter~0 11)} {23432#(<= ~counter~0 11)} #55#return; {23432#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:04,642 INFO L290 TraceCheckUtils]: 99: Hoare triple {23432#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23432#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:04,643 INFO L290 TraceCheckUtils]: 100: Hoare triple {23432#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23457#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:04,643 INFO L290 TraceCheckUtils]: 101: Hoare triple {23457#(<= ~counter~0 12)} assume !!(#t~post5 < 100);havoc #t~post5; {23457#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:04,644 INFO L272 TraceCheckUtils]: 102: Hoare triple {23457#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23457#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:04,644 INFO L290 TraceCheckUtils]: 103: Hoare triple {23457#(<= ~counter~0 12)} ~cond := #in~cond; {23457#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:04,644 INFO L290 TraceCheckUtils]: 104: Hoare triple {23457#(<= ~counter~0 12)} assume !(0 == ~cond); {23457#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:04,645 INFO L290 TraceCheckUtils]: 105: Hoare triple {23457#(<= ~counter~0 12)} assume true; {23457#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:04,645 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23457#(<= ~counter~0 12)} {23457#(<= ~counter~0 12)} #55#return; {23457#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:04,646 INFO L290 TraceCheckUtils]: 107: Hoare triple {23457#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23457#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:04,647 INFO L290 TraceCheckUtils]: 108: Hoare triple {23457#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23482#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:04,647 INFO L290 TraceCheckUtils]: 109: Hoare triple {23482#(<= ~counter~0 13)} assume !!(#t~post5 < 100);havoc #t~post5; {23482#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:04,648 INFO L272 TraceCheckUtils]: 110: Hoare triple {23482#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23482#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:04,648 INFO L290 TraceCheckUtils]: 111: Hoare triple {23482#(<= ~counter~0 13)} ~cond := #in~cond; {23482#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:04,648 INFO L290 TraceCheckUtils]: 112: Hoare triple {23482#(<= ~counter~0 13)} assume !(0 == ~cond); {23482#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:04,649 INFO L290 TraceCheckUtils]: 113: Hoare triple {23482#(<= ~counter~0 13)} assume true; {23482#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:04,649 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23482#(<= ~counter~0 13)} {23482#(<= ~counter~0 13)} #55#return; {23482#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:04,650 INFO L290 TraceCheckUtils]: 115: Hoare triple {23482#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23482#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:04,650 INFO L290 TraceCheckUtils]: 116: Hoare triple {23482#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23507#(<= |main_#t~post5| 13)} is VALID [2022-04-08 14:34:04,651 INFO L290 TraceCheckUtils]: 117: Hoare triple {23507#(<= |main_#t~post5| 13)} assume !(#t~post5 < 100);havoc #t~post5; {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L272 TraceCheckUtils]: 118: Hoare triple {23141#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)); {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L290 TraceCheckUtils]: 119: Hoare triple {23141#false} ~cond := #in~cond; {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L290 TraceCheckUtils]: 120: Hoare triple {23141#false} assume !(0 == ~cond); {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L290 TraceCheckUtils]: 121: Hoare triple {23141#false} assume true; {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23141#false} {23141#false} #57#return; {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L272 TraceCheckUtils]: 123: Hoare triple {23141#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L290 TraceCheckUtils]: 124: Hoare triple {23141#false} ~cond := #in~cond; {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L290 TraceCheckUtils]: 125: Hoare triple {23141#false} assume 0 == ~cond; {23141#false} is VALID [2022-04-08 14:34:04,651 INFO L290 TraceCheckUtils]: 126: Hoare triple {23141#false} assume !false; {23141#false} is VALID [2022-04-08 14:34:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:04,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:05,530 INFO L290 TraceCheckUtils]: 126: Hoare triple {23141#false} assume !false; {23141#false} is VALID [2022-04-08 14:34:05,530 INFO L290 TraceCheckUtils]: 125: Hoare triple {23141#false} assume 0 == ~cond; {23141#false} is VALID [2022-04-08 14:34:05,530 INFO L290 TraceCheckUtils]: 124: Hoare triple {23141#false} ~cond := #in~cond; {23141#false} is VALID [2022-04-08 14:34:05,530 INFO L272 TraceCheckUtils]: 123: Hoare triple {23141#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {23141#false} is VALID [2022-04-08 14:34:05,530 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23140#true} {23141#false} #57#return; {23141#false} is VALID [2022-04-08 14:34:05,530 INFO L290 TraceCheckUtils]: 121: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,530 INFO L290 TraceCheckUtils]: 120: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,531 INFO L290 TraceCheckUtils]: 119: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,531 INFO L272 TraceCheckUtils]: 118: Hoare triple {23141#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)); {23140#true} is VALID [2022-04-08 14:34:05,531 INFO L290 TraceCheckUtils]: 117: Hoare triple {23565#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {23141#false} is VALID [2022-04-08 14:34:05,531 INFO L290 TraceCheckUtils]: 116: Hoare triple {23569#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23565#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:34:05,532 INFO L290 TraceCheckUtils]: 115: Hoare triple {23569#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23569#(< ~counter~0 100)} is VALID [2022-04-08 14:34:05,532 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23140#true} {23569#(< ~counter~0 100)} #55#return; {23569#(< ~counter~0 100)} is VALID [2022-04-08 14:34:05,532 INFO L290 TraceCheckUtils]: 113: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,532 INFO L290 TraceCheckUtils]: 112: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,532 INFO L290 TraceCheckUtils]: 111: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,532 INFO L272 TraceCheckUtils]: 110: Hoare triple {23569#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,532 INFO L290 TraceCheckUtils]: 109: Hoare triple {23569#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {23569#(< ~counter~0 100)} is VALID [2022-04-08 14:34:05,534 INFO L290 TraceCheckUtils]: 108: Hoare triple {23594#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23569#(< ~counter~0 100)} is VALID [2022-04-08 14:34:05,534 INFO L290 TraceCheckUtils]: 107: Hoare triple {23594#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23594#(< ~counter~0 99)} is VALID [2022-04-08 14:34:05,534 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23140#true} {23594#(< ~counter~0 99)} #55#return; {23594#(< ~counter~0 99)} is VALID [2022-04-08 14:34:05,534 INFO L290 TraceCheckUtils]: 105: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,534 INFO L290 TraceCheckUtils]: 104: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,535 INFO L290 TraceCheckUtils]: 103: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,535 INFO L272 TraceCheckUtils]: 102: Hoare triple {23594#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,535 INFO L290 TraceCheckUtils]: 101: Hoare triple {23594#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {23594#(< ~counter~0 99)} is VALID [2022-04-08 14:34:05,535 INFO L290 TraceCheckUtils]: 100: Hoare triple {23619#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23594#(< ~counter~0 99)} is VALID [2022-04-08 14:34:05,536 INFO L290 TraceCheckUtils]: 99: Hoare triple {23619#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23619#(< ~counter~0 98)} is VALID [2022-04-08 14:34:05,536 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23140#true} {23619#(< ~counter~0 98)} #55#return; {23619#(< ~counter~0 98)} is VALID [2022-04-08 14:34:05,536 INFO L290 TraceCheckUtils]: 97: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,536 INFO L290 TraceCheckUtils]: 96: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,536 INFO L290 TraceCheckUtils]: 95: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,536 INFO L272 TraceCheckUtils]: 94: Hoare triple {23619#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,537 INFO L290 TraceCheckUtils]: 93: Hoare triple {23619#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {23619#(< ~counter~0 98)} is VALID [2022-04-08 14:34:05,537 INFO L290 TraceCheckUtils]: 92: Hoare triple {23644#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23619#(< ~counter~0 98)} is VALID [2022-04-08 14:34:05,538 INFO L290 TraceCheckUtils]: 91: Hoare triple {23644#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23644#(< ~counter~0 97)} is VALID [2022-04-08 14:34:05,538 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23140#true} {23644#(< ~counter~0 97)} #55#return; {23644#(< ~counter~0 97)} is VALID [2022-04-08 14:34:05,538 INFO L290 TraceCheckUtils]: 89: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,538 INFO L290 TraceCheckUtils]: 88: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,538 INFO L290 TraceCheckUtils]: 87: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,538 INFO L272 TraceCheckUtils]: 86: Hoare triple {23644#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,539 INFO L290 TraceCheckUtils]: 85: Hoare triple {23644#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {23644#(< ~counter~0 97)} is VALID [2022-04-08 14:34:05,539 INFO L290 TraceCheckUtils]: 84: Hoare triple {23669#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23644#(< ~counter~0 97)} is VALID [2022-04-08 14:34:05,539 INFO L290 TraceCheckUtils]: 83: Hoare triple {23669#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23669#(< ~counter~0 96)} is VALID [2022-04-08 14:34:05,540 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23140#true} {23669#(< ~counter~0 96)} #55#return; {23669#(< ~counter~0 96)} is VALID [2022-04-08 14:34:05,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,540 INFO L272 TraceCheckUtils]: 78: Hoare triple {23669#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {23669#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {23669#(< ~counter~0 96)} is VALID [2022-04-08 14:34:05,541 INFO L290 TraceCheckUtils]: 76: Hoare triple {23694#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23669#(< ~counter~0 96)} is VALID [2022-04-08 14:34:05,541 INFO L290 TraceCheckUtils]: 75: Hoare triple {23694#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23694#(< ~counter~0 95)} is VALID [2022-04-08 14:34:05,542 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23140#true} {23694#(< ~counter~0 95)} #55#return; {23694#(< ~counter~0 95)} is VALID [2022-04-08 14:34:05,542 INFO L290 TraceCheckUtils]: 73: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,542 INFO L290 TraceCheckUtils]: 72: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,542 INFO L290 TraceCheckUtils]: 71: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,542 INFO L272 TraceCheckUtils]: 70: Hoare triple {23694#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,542 INFO L290 TraceCheckUtils]: 69: Hoare triple {23694#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {23694#(< ~counter~0 95)} is VALID [2022-04-08 14:34:05,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {23719#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23694#(< ~counter~0 95)} is VALID [2022-04-08 14:34:05,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {23719#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23719#(< ~counter~0 94)} is VALID [2022-04-08 14:34:05,544 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23140#true} {23719#(< ~counter~0 94)} #55#return; {23719#(< ~counter~0 94)} is VALID [2022-04-08 14:34:05,544 INFO L290 TraceCheckUtils]: 65: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,544 INFO L290 TraceCheckUtils]: 64: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,544 INFO L290 TraceCheckUtils]: 63: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,544 INFO L272 TraceCheckUtils]: 62: Hoare triple {23719#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {23719#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {23719#(< ~counter~0 94)} is VALID [2022-04-08 14:34:05,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {23744#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23719#(< ~counter~0 94)} is VALID [2022-04-08 14:34:05,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {23744#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23744#(< ~counter~0 93)} is VALID [2022-04-08 14:34:05,545 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23140#true} {23744#(< ~counter~0 93)} #55#return; {23744#(< ~counter~0 93)} is VALID [2022-04-08 14:34:05,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,546 INFO L272 TraceCheckUtils]: 54: Hoare triple {23744#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {23744#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {23744#(< ~counter~0 93)} is VALID [2022-04-08 14:34:05,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {23769#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23744#(< ~counter~0 93)} is VALID [2022-04-08 14:34:05,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {23769#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23769#(< ~counter~0 92)} is VALID [2022-04-08 14:34:05,547 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23140#true} {23769#(< ~counter~0 92)} #55#return; {23769#(< ~counter~0 92)} is VALID [2022-04-08 14:34:05,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,548 INFO L272 TraceCheckUtils]: 46: Hoare triple {23769#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {23769#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {23769#(< ~counter~0 92)} is VALID [2022-04-08 14:34:05,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {23794#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23769#(< ~counter~0 92)} is VALID [2022-04-08 14:34:05,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {23794#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23794#(< ~counter~0 91)} is VALID [2022-04-08 14:34:05,549 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23140#true} {23794#(< ~counter~0 91)} #55#return; {23794#(< ~counter~0 91)} is VALID [2022-04-08 14:34:05,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,549 INFO L272 TraceCheckUtils]: 38: Hoare triple {23794#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {23794#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {23794#(< ~counter~0 91)} is VALID [2022-04-08 14:34:05,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {23819#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23794#(< ~counter~0 91)} is VALID [2022-04-08 14:34:05,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {23819#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23819#(< ~counter~0 90)} is VALID [2022-04-08 14:34:05,551 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23140#true} {23819#(< ~counter~0 90)} #55#return; {23819#(< ~counter~0 90)} is VALID [2022-04-08 14:34:05,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,551 INFO L272 TraceCheckUtils]: 30: Hoare triple {23819#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {23819#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {23819#(< ~counter~0 90)} is VALID [2022-04-08 14:34:05,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {23844#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23819#(< ~counter~0 90)} is VALID [2022-04-08 14:34:05,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {23844#(< ~counter~0 89)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23844#(< ~counter~0 89)} is VALID [2022-04-08 14:34:05,553 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23140#true} {23844#(< ~counter~0 89)} #55#return; {23844#(< ~counter~0 89)} is VALID [2022-04-08 14:34:05,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,553 INFO L272 TraceCheckUtils]: 22: Hoare triple {23844#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {23844#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {23844#(< ~counter~0 89)} is VALID [2022-04-08 14:34:05,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {23869#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23844#(< ~counter~0 89)} is VALID [2022-04-08 14:34:05,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {23869#(< ~counter~0 88)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23869#(< ~counter~0 88)} is VALID [2022-04-08 14:34:05,555 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23140#true} {23869#(< ~counter~0 88)} #55#return; {23869#(< ~counter~0 88)} is VALID [2022-04-08 14:34:05,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,555 INFO L272 TraceCheckUtils]: 14: Hoare triple {23869#(< ~counter~0 88)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {23869#(< ~counter~0 88)} assume !!(#t~post5 < 100);havoc #t~post5; {23869#(< ~counter~0 88)} is VALID [2022-04-08 14:34:05,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {23894#(< ~counter~0 87)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23869#(< ~counter~0 88)} is VALID [2022-04-08 14:34:05,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {23894#(< ~counter~0 87)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23894#(< ~counter~0 87)} is VALID [2022-04-08 14:34:05,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23140#true} {23894#(< ~counter~0 87)} #53#return; {23894#(< ~counter~0 87)} is VALID [2022-04-08 14:34:05,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-08 14:34:05,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-08 14:34:05,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-08 14:34:05,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {23894#(< ~counter~0 87)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {23140#true} is VALID [2022-04-08 14:34:05,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {23894#(< ~counter~0 87)} 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; {23894#(< ~counter~0 87)} is VALID [2022-04-08 14:34:05,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {23894#(< ~counter~0 87)} call #t~ret6 := main(); {23894#(< ~counter~0 87)} is VALID [2022-04-08 14:34:05,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23894#(< ~counter~0 87)} {23140#true} #61#return; {23894#(< ~counter~0 87)} is VALID [2022-04-08 14:34:05,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {23894#(< ~counter~0 87)} assume true; {23894#(< ~counter~0 87)} is VALID [2022-04-08 14:34:05,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {23140#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; {23894#(< ~counter~0 87)} is VALID [2022-04-08 14:34:05,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {23140#true} call ULTIMATE.init(); {23140#true} is VALID [2022-04-08 14:34:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 28 proven. 338 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 14:34:05,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:05,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084053195] [2022-04-08 14:34:05,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:05,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557118447] [2022-04-08 14:34:05,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557118447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:05,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:05,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 14:34:05,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:05,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [232509426] [2022-04-08 14:34:05,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [232509426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:05,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:05,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 14:34:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732789564] [2022-04-08 14:34:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 127 [2022-04-08 14:34:05,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:05,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:05,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:05,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 14:34:05,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 14:34:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 14:34:05,666 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:06,267 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2022-04-08 14:34:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 14:34:06,268 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 127 [2022-04-08 14:34:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-08 14:34:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-08 14:34:06,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2022-04-08 14:34:06,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:06,410 INFO L225 Difference]: With dead ends: 142 [2022-04-08 14:34:06,410 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 14:34:06,411 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=843, Invalid=1137, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 14:34:06,412 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:06,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 177 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 14:34:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-08 14:34:06,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:06,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:06,687 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:06,687 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:06,690 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-08 14:34:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-08 14:34:06,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:06,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:06,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-08 14:34:06,691 INFO L87 Difference]: Start difference. First operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-08 14:34:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:06,694 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-08 14:34:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-08 14:34:06,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:06,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:06,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:06,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2022-04-08 14:34:06,697 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 127 [2022-04-08 14:34:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:06,698 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2022-04-08 14:34:06,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:06,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 134 transitions. [2022-04-08 14:34:06,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-08 14:34:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 14:34:06,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:06,998 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:07,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:07,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 14:34:07,199 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 25 times [2022-04-08 14:34:07,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:07,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102496345] [2022-04-08 14:34:07,294 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:07,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 26 times [2022-04-08 14:34:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:07,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002110133] [2022-04-08 14:34:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:07,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:07,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768147745] [2022-04-08 14:34:07,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:34:07,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:07,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:07,326 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:07,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 14:34:09,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:34:09,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:09,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 14:34:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:09,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:09,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {24771#true} call ULTIMATE.init(); {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {24771#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; {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24771#true} {24771#true} #61#return; {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {24771#true} call #t~ret6 := main(); {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {24771#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; {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {24771#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24771#true} {24771#true} #53#return; {24771#true} is VALID [2022-04-08 14:34:09,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {24771#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {24809#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:09,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {24809#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24809#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:09,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {24809#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {24809#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:09,830 INFO L272 TraceCheckUtils]: 14: Hoare triple {24809#(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)); {24771#true} is VALID [2022-04-08 14:34:09,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,830 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24771#true} {24809#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {24809#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:09,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {24809#(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; {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:09,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:09,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:09,831 INFO L272 TraceCheckUtils]: 22: Hoare triple {24834#(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)); {24771#true} is VALID [2022-04-08 14:34:09,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,832 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24771#true} {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:09,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {24834#(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; {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:09,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:09,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:09,833 INFO L272 TraceCheckUtils]: 30: Hoare triple {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-08 14:34:09,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,834 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {24771#true} {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #55#return; {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:09,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 14:34:09,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 14:34:09,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 14:34:09,835 INFO L272 TraceCheckUtils]: 38: Hoare triple {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-08 14:34:09,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,836 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {24771#true} {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #55#return; {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 14:34:09,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:34:09,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:34:09,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:34:09,837 INFO L272 TraceCheckUtils]: 46: Hoare triple {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-08 14:34:09,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,838 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24771#true} {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:34:09,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:09,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:09,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:09,839 INFO L272 TraceCheckUtils]: 54: Hoare triple {24934#(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)); {24771#true} is VALID [2022-04-08 14:34:09,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,841 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24771#true} {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:09,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {24934#(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; {24959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:09,842 INFO L290 TraceCheckUtils]: 60: Hoare triple {24959#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:09,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {24959#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {24959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:09,842 INFO L272 TraceCheckUtils]: 62: Hoare triple {24959#(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)); {24771#true} is VALID [2022-04-08 14:34:09,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,843 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24771#true} {24959#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {24959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:09,843 INFO L290 TraceCheckUtils]: 67: Hoare triple {24959#(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; {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,844 INFO L272 TraceCheckUtils]: 70: Hoare triple {24984#(and (= (+ (- 1) main_~c~0) 6) (= 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)); {24771#true} is VALID [2022-04-08 14:34:09,844 INFO L290 TraceCheckUtils]: 71: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,844 INFO L290 TraceCheckUtils]: 72: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,844 INFO L290 TraceCheckUtils]: 73: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,845 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24771#true} {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #55#return; {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,845 INFO L290 TraceCheckUtils]: 75: Hoare triple {24984#(and (= (+ (- 1) main_~c~0) 6) (= 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; {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:34:09,846 INFO L290 TraceCheckUtils]: 76: Hoare triple {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:34:09,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 100);havoc #t~post5; {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:34:09,846 INFO L272 TraceCheckUtils]: 78: Hoare triple {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-08 14:34:09,846 INFO L290 TraceCheckUtils]: 79: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,846 INFO L290 TraceCheckUtils]: 80: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,846 INFO L290 TraceCheckUtils]: 81: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,847 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {24771#true} {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #55#return; {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:34:09,847 INFO L290 TraceCheckUtils]: 83: Hoare triple {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} is VALID [2022-04-08 14:34:09,847 INFO L290 TraceCheckUtils]: 84: Hoare triple {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} is VALID [2022-04-08 14:34:09,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} assume !!(#t~post5 < 100);havoc #t~post5; {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} is VALID [2022-04-08 14:34:09,848 INFO L272 TraceCheckUtils]: 86: Hoare triple {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 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)); {24771#true} is VALID [2022-04-08 14:34:09,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,848 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {24771#true} {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} #55#return; {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} is VALID [2022-04-08 14:34:09,849 INFO L290 TraceCheckUtils]: 91: Hoare triple {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 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; {25059#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:34:09,849 INFO L290 TraceCheckUtils]: 92: Hoare triple {25059#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25059#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:34:09,850 INFO L290 TraceCheckUtils]: 93: Hoare triple {25059#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {25059#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:34:09,850 INFO L272 TraceCheckUtils]: 94: Hoare triple {25059#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-08 14:34:09,850 INFO L290 TraceCheckUtils]: 95: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,850 INFO L290 TraceCheckUtils]: 96: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,850 INFO L290 TraceCheckUtils]: 97: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,852 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {24771#true} {25059#(and (= main_~y~0 10) (= main_~c~0 10))} #55#return; {25059#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:34:09,852 INFO L290 TraceCheckUtils]: 99: Hoare triple {25059#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25084#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 14:34:09,853 INFO L290 TraceCheckUtils]: 100: Hoare triple {25084#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25084#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 14:34:09,853 INFO L290 TraceCheckUtils]: 101: Hoare triple {25084#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 100);havoc #t~post5; {25084#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 14:34:09,853 INFO L272 TraceCheckUtils]: 102: Hoare triple {25084#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-08 14:34:09,853 INFO L290 TraceCheckUtils]: 103: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,853 INFO L290 TraceCheckUtils]: 104: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,853 INFO L290 TraceCheckUtils]: 105: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,854 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {24771#true} {25084#(and (= main_~c~0 11) (= main_~y~0 11))} #55#return; {25084#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 14:34:09,854 INFO L290 TraceCheckUtils]: 107: Hoare triple {25084#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 14:34:09,855 INFO L290 TraceCheckUtils]: 108: Hoare triple {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 14:34:09,855 INFO L290 TraceCheckUtils]: 109: Hoare triple {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(#t~post5 < 100);havoc #t~post5; {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 14:34:09,855 INFO L272 TraceCheckUtils]: 110: Hoare triple {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-08 14:34:09,855 INFO L290 TraceCheckUtils]: 111: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,855 INFO L290 TraceCheckUtils]: 112: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,855 INFO L290 TraceCheckUtils]: 113: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,856 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {24771#true} {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #55#return; {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 14:34:09,856 INFO L290 TraceCheckUtils]: 115: Hoare triple {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,857 INFO L290 TraceCheckUtils]: 116: Hoare triple {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,857 INFO L290 TraceCheckUtils]: 117: Hoare triple {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,857 INFO L272 TraceCheckUtils]: 118: Hoare triple {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 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)); {24771#true} is VALID [2022-04-08 14:34:09,857 INFO L290 TraceCheckUtils]: 119: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,857 INFO L290 TraceCheckUtils]: 120: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,857 INFO L290 TraceCheckUtils]: 121: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,858 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24771#true} {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #55#return; {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,859 INFO L290 TraceCheckUtils]: 123: Hoare triple {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,859 INFO L272 TraceCheckUtils]: 124: Hoare triple {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 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)); {24771#true} is VALID [2022-04-08 14:34:09,859 INFO L290 TraceCheckUtils]: 125: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-08 14:34:09,859 INFO L290 TraceCheckUtils]: 126: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-08 14:34:09,859 INFO L290 TraceCheckUtils]: 127: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-08 14:34:09,860 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24771#true} {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 1) main_~y~0)))} #57#return; {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,860 INFO L272 TraceCheckUtils]: 129: Hoare triple {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {25178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:34:09,861 INFO L290 TraceCheckUtils]: 130: Hoare triple {25178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:34:09,861 INFO L290 TraceCheckUtils]: 131: Hoare triple {25182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24772#false} is VALID [2022-04-08 14:34:09,861 INFO L290 TraceCheckUtils]: 132: Hoare triple {24772#false} assume !false; {24772#false} is VALID [2022-04-08 14:34:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 30 proven. 364 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-08 14:34:09,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:10,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:10,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002110133] [2022-04-08 14:34:10,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:10,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768147745] [2022-04-08 14:34:10,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768147745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:34:10,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:34:10,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-08 14:34:10,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:10,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102496345] [2022-04-08 14:34:10,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102496345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:10,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:10,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 14:34:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747629583] [2022-04-08 14:34:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:10,189 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 133 [2022-04-08 14:34:10,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:10,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 14:34:10,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:10,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 14:34:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 14:34:10,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:34:10,264 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 14:34:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:12,464 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-08 14:34:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 14:34:12,465 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 133 [2022-04-08 14:34:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 14:34:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-08 14:34:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 14:34:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-08 14:34:12,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 104 transitions. [2022-04-08 14:34:12,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:12,562 INFO L225 Difference]: With dead ends: 140 [2022-04-08 14:34:12,562 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 14:34:12,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:34:12,563 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:12,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 861 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 14:34:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 14:34:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-08 14:34:12,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:12,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:12,797 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:12,797 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:12,799 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-08 14:34:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-08 14:34:12,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:12,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:12,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 134 states. [2022-04-08 14:34:12,800 INFO L87 Difference]: Start difference. First operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 134 states. [2022-04-08 14:34:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:12,801 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-08 14:34:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-08 14:34:12,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:12,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:12,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:12,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2022-04-08 14:34:12,804 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 133 [2022-04-08 14:34:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:12,804 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2022-04-08 14:34:12,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 14:34:12,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 137 transitions. [2022-04-08 14:34:13,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-08 14:34:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 14:34:13,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:13,188 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:13,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:13,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:13,396 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:13,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 25 times [2022-04-08 14:34:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:13,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066313067] [2022-04-08 14:34:13,480 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:13,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 26 times [2022-04-08 14:34:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:13,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057496915] [2022-04-08 14:34:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:13,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:13,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451686755] [2022-04-08 14:34:13,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:34:13,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:13,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:13,501 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:13,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 14:34:13,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:34:13,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:13,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 14:34:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:13,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:14,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {26068#true} call ULTIMATE.init(); {26068#true} is VALID [2022-04-08 14:34:14,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {26068#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; {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {26076#(<= ~counter~0 0)} assume true; {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26076#(<= ~counter~0 0)} {26068#true} #61#return; {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {26076#(<= ~counter~0 0)} call #t~ret6 := main(); {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {26076#(<= ~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; {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {26076#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {26076#(<= ~counter~0 0)} ~cond := #in~cond; {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {26076#(<= ~counter~0 0)} assume !(0 == ~cond); {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {26076#(<= ~counter~0 0)} assume true; {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26076#(<= ~counter~0 0)} {26076#(<= ~counter~0 0)} #53#return; {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {26076#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {26076#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:14,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {26076#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26110#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:14,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {26110#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {26110#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:14,311 INFO L272 TraceCheckUtils]: 14: Hoare triple {26110#(<= ~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)); {26110#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:14,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {26110#(<= ~counter~0 1)} ~cond := #in~cond; {26110#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:14,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {26110#(<= ~counter~0 1)} assume !(0 == ~cond); {26110#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:14,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {26110#(<= ~counter~0 1)} assume true; {26110#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:14,312 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26110#(<= ~counter~0 1)} {26110#(<= ~counter~0 1)} #55#return; {26110#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:14,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {26110#(<= ~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; {26110#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:14,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {26110#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26135#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:14,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {26135#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {26135#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:14,314 INFO L272 TraceCheckUtils]: 22: Hoare triple {26135#(<= ~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)); {26135#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:14,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {26135#(<= ~counter~0 2)} ~cond := #in~cond; {26135#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:14,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {26135#(<= ~counter~0 2)} assume !(0 == ~cond); {26135#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:14,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {26135#(<= ~counter~0 2)} assume true; {26135#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:14,315 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26135#(<= ~counter~0 2)} {26135#(<= ~counter~0 2)} #55#return; {26135#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:14,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {26135#(<= ~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; {26135#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:14,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {26135#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26160#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:14,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {26160#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {26160#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:14,317 INFO L272 TraceCheckUtils]: 30: Hoare triple {26160#(<= ~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)); {26160#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:14,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {26160#(<= ~counter~0 3)} ~cond := #in~cond; {26160#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:14,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {26160#(<= ~counter~0 3)} assume !(0 == ~cond); {26160#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:14,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {26160#(<= ~counter~0 3)} assume true; {26160#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:14,318 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {26160#(<= ~counter~0 3)} {26160#(<= ~counter~0 3)} #55#return; {26160#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:14,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {26160#(<= ~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; {26160#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:14,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {26160#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26185#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:14,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {26185#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {26185#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:14,320 INFO L272 TraceCheckUtils]: 38: Hoare triple {26185#(<= ~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)); {26185#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:14,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {26185#(<= ~counter~0 4)} ~cond := #in~cond; {26185#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:14,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {26185#(<= ~counter~0 4)} assume !(0 == ~cond); {26185#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:14,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {26185#(<= ~counter~0 4)} assume true; {26185#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:14,321 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26185#(<= ~counter~0 4)} {26185#(<= ~counter~0 4)} #55#return; {26185#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:14,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {26185#(<= ~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; {26185#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:14,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {26185#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26210#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:14,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {26210#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {26210#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:14,322 INFO L272 TraceCheckUtils]: 46: Hoare triple {26210#(<= ~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)); {26210#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:14,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {26210#(<= ~counter~0 5)} ~cond := #in~cond; {26210#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:14,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {26210#(<= ~counter~0 5)} assume !(0 == ~cond); {26210#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:14,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {26210#(<= ~counter~0 5)} assume true; {26210#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:14,324 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26210#(<= ~counter~0 5)} {26210#(<= ~counter~0 5)} #55#return; {26210#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:14,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {26210#(<= ~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; {26210#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:14,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {26210#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26235#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:14,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {26235#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {26235#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:14,325 INFO L272 TraceCheckUtils]: 54: Hoare triple {26235#(<= ~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)); {26235#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:14,326 INFO L290 TraceCheckUtils]: 55: Hoare triple {26235#(<= ~counter~0 6)} ~cond := #in~cond; {26235#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:14,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {26235#(<= ~counter~0 6)} assume !(0 == ~cond); {26235#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:14,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {26235#(<= ~counter~0 6)} assume true; {26235#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:14,327 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26235#(<= ~counter~0 6)} {26235#(<= ~counter~0 6)} #55#return; {26235#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:14,327 INFO L290 TraceCheckUtils]: 59: Hoare triple {26235#(<= ~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; {26235#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:14,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {26235#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26260#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:14,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {26260#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {26260#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:14,328 INFO L272 TraceCheckUtils]: 62: Hoare triple {26260#(<= ~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)); {26260#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:14,328 INFO L290 TraceCheckUtils]: 63: Hoare triple {26260#(<= ~counter~0 7)} ~cond := #in~cond; {26260#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:14,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {26260#(<= ~counter~0 7)} assume !(0 == ~cond); {26260#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:14,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {26260#(<= ~counter~0 7)} assume true; {26260#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:14,329 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26260#(<= ~counter~0 7)} {26260#(<= ~counter~0 7)} #55#return; {26260#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:14,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {26260#(<= ~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; {26260#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:14,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {26260#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26285#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:14,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {26285#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {26285#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:14,331 INFO L272 TraceCheckUtils]: 70: Hoare triple {26285#(<= ~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)); {26285#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:14,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {26285#(<= ~counter~0 8)} ~cond := #in~cond; {26285#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:14,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {26285#(<= ~counter~0 8)} assume !(0 == ~cond); {26285#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:14,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {26285#(<= ~counter~0 8)} assume true; {26285#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:14,332 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26285#(<= ~counter~0 8)} {26285#(<= ~counter~0 8)} #55#return; {26285#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:14,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {26285#(<= ~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; {26285#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:14,333 INFO L290 TraceCheckUtils]: 76: Hoare triple {26285#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26310#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:14,333 INFO L290 TraceCheckUtils]: 77: Hoare triple {26310#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {26310#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:14,334 INFO L272 TraceCheckUtils]: 78: Hoare triple {26310#(<= ~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)); {26310#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:14,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {26310#(<= ~counter~0 9)} ~cond := #in~cond; {26310#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:14,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {26310#(<= ~counter~0 9)} assume !(0 == ~cond); {26310#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:14,335 INFO L290 TraceCheckUtils]: 81: Hoare triple {26310#(<= ~counter~0 9)} assume true; {26310#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:14,335 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {26310#(<= ~counter~0 9)} {26310#(<= ~counter~0 9)} #55#return; {26310#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:14,335 INFO L290 TraceCheckUtils]: 83: Hoare triple {26310#(<= ~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; {26310#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:14,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {26310#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26335#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:14,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {26335#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {26335#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:14,337 INFO L272 TraceCheckUtils]: 86: Hoare triple {26335#(<= ~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)); {26335#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:14,337 INFO L290 TraceCheckUtils]: 87: Hoare triple {26335#(<= ~counter~0 10)} ~cond := #in~cond; {26335#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:14,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {26335#(<= ~counter~0 10)} assume !(0 == ~cond); {26335#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:14,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {26335#(<= ~counter~0 10)} assume true; {26335#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:14,338 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26335#(<= ~counter~0 10)} {26335#(<= ~counter~0 10)} #55#return; {26335#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:14,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {26335#(<= ~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; {26335#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:14,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {26335#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26360#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:14,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {26360#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {26360#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:14,339 INFO L272 TraceCheckUtils]: 94: Hoare triple {26360#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26360#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:14,340 INFO L290 TraceCheckUtils]: 95: Hoare triple {26360#(<= ~counter~0 11)} ~cond := #in~cond; {26360#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:14,340 INFO L290 TraceCheckUtils]: 96: Hoare triple {26360#(<= ~counter~0 11)} assume !(0 == ~cond); {26360#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:14,340 INFO L290 TraceCheckUtils]: 97: Hoare triple {26360#(<= ~counter~0 11)} assume true; {26360#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:14,341 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {26360#(<= ~counter~0 11)} {26360#(<= ~counter~0 11)} #55#return; {26360#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:14,341 INFO L290 TraceCheckUtils]: 99: Hoare triple {26360#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26360#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:14,342 INFO L290 TraceCheckUtils]: 100: Hoare triple {26360#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26385#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:14,342 INFO L290 TraceCheckUtils]: 101: Hoare triple {26385#(<= ~counter~0 12)} assume !!(#t~post5 < 100);havoc #t~post5; {26385#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:14,342 INFO L272 TraceCheckUtils]: 102: Hoare triple {26385#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26385#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:14,343 INFO L290 TraceCheckUtils]: 103: Hoare triple {26385#(<= ~counter~0 12)} ~cond := #in~cond; {26385#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:14,343 INFO L290 TraceCheckUtils]: 104: Hoare triple {26385#(<= ~counter~0 12)} assume !(0 == ~cond); {26385#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:14,343 INFO L290 TraceCheckUtils]: 105: Hoare triple {26385#(<= ~counter~0 12)} assume true; {26385#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:14,344 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {26385#(<= ~counter~0 12)} {26385#(<= ~counter~0 12)} #55#return; {26385#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:14,344 INFO L290 TraceCheckUtils]: 107: Hoare triple {26385#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26385#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:14,344 INFO L290 TraceCheckUtils]: 108: Hoare triple {26385#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26410#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:14,345 INFO L290 TraceCheckUtils]: 109: Hoare triple {26410#(<= ~counter~0 13)} assume !!(#t~post5 < 100);havoc #t~post5; {26410#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:14,364 INFO L272 TraceCheckUtils]: 110: Hoare triple {26410#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26410#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:14,364 INFO L290 TraceCheckUtils]: 111: Hoare triple {26410#(<= ~counter~0 13)} ~cond := #in~cond; {26410#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:14,365 INFO L290 TraceCheckUtils]: 112: Hoare triple {26410#(<= ~counter~0 13)} assume !(0 == ~cond); {26410#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:14,365 INFO L290 TraceCheckUtils]: 113: Hoare triple {26410#(<= ~counter~0 13)} assume true; {26410#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:14,366 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {26410#(<= ~counter~0 13)} {26410#(<= ~counter~0 13)} #55#return; {26410#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:14,366 INFO L290 TraceCheckUtils]: 115: Hoare triple {26410#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26410#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:14,368 INFO L290 TraceCheckUtils]: 116: Hoare triple {26410#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26435#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:14,368 INFO L290 TraceCheckUtils]: 117: Hoare triple {26435#(<= ~counter~0 14)} assume !!(#t~post5 < 100);havoc #t~post5; {26435#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:14,369 INFO L272 TraceCheckUtils]: 118: Hoare triple {26435#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26435#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:14,370 INFO L290 TraceCheckUtils]: 119: Hoare triple {26435#(<= ~counter~0 14)} ~cond := #in~cond; {26435#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:14,370 INFO L290 TraceCheckUtils]: 120: Hoare triple {26435#(<= ~counter~0 14)} assume !(0 == ~cond); {26435#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:14,371 INFO L290 TraceCheckUtils]: 121: Hoare triple {26435#(<= ~counter~0 14)} assume true; {26435#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:14,372 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26435#(<= ~counter~0 14)} {26435#(<= ~counter~0 14)} #55#return; {26435#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:14,372 INFO L290 TraceCheckUtils]: 123: Hoare triple {26435#(<= ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26435#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:14,373 INFO L290 TraceCheckUtils]: 124: Hoare triple {26435#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26460#(<= |main_#t~post5| 14)} is VALID [2022-04-08 14:34:14,373 INFO L290 TraceCheckUtils]: 125: Hoare triple {26460#(<= |main_#t~post5| 14)} assume !(#t~post5 < 100);havoc #t~post5; {26069#false} is VALID [2022-04-08 14:34:14,373 INFO L272 TraceCheckUtils]: 126: Hoare triple {26069#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)); {26069#false} is VALID [2022-04-08 14:34:14,373 INFO L290 TraceCheckUtils]: 127: Hoare triple {26069#false} ~cond := #in~cond; {26069#false} is VALID [2022-04-08 14:34:14,373 INFO L290 TraceCheckUtils]: 128: Hoare triple {26069#false} assume !(0 == ~cond); {26069#false} is VALID [2022-04-08 14:34:14,373 INFO L290 TraceCheckUtils]: 129: Hoare triple {26069#false} assume true; {26069#false} is VALID [2022-04-08 14:34:14,373 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {26069#false} {26069#false} #57#return; {26069#false} is VALID [2022-04-08 14:34:14,373 INFO L272 TraceCheckUtils]: 131: Hoare triple {26069#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {26069#false} is VALID [2022-04-08 14:34:14,373 INFO L290 TraceCheckUtils]: 132: Hoare triple {26069#false} ~cond := #in~cond; {26069#false} is VALID [2022-04-08 14:34:14,373 INFO L290 TraceCheckUtils]: 133: Hoare triple {26069#false} assume 0 == ~cond; {26069#false} is VALID [2022-04-08 14:34:14,374 INFO L290 TraceCheckUtils]: 134: Hoare triple {26069#false} assume !false; {26069#false} is VALID [2022-04-08 14:34:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:14,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:15,216 INFO L290 TraceCheckUtils]: 134: Hoare triple {26069#false} assume !false; {26069#false} is VALID [2022-04-08 14:34:15,216 INFO L290 TraceCheckUtils]: 133: Hoare triple {26069#false} assume 0 == ~cond; {26069#false} is VALID [2022-04-08 14:34:15,216 INFO L290 TraceCheckUtils]: 132: Hoare triple {26069#false} ~cond := #in~cond; {26069#false} is VALID [2022-04-08 14:34:15,216 INFO L272 TraceCheckUtils]: 131: Hoare triple {26069#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {26069#false} is VALID [2022-04-08 14:34:15,216 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {26068#true} {26069#false} #57#return; {26069#false} is VALID [2022-04-08 14:34:15,217 INFO L290 TraceCheckUtils]: 129: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,217 INFO L290 TraceCheckUtils]: 128: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,217 INFO L290 TraceCheckUtils]: 127: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,217 INFO L272 TraceCheckUtils]: 126: Hoare triple {26069#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)); {26068#true} is VALID [2022-04-08 14:34:15,217 INFO L290 TraceCheckUtils]: 125: Hoare triple {26518#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {26069#false} is VALID [2022-04-08 14:34:15,217 INFO L290 TraceCheckUtils]: 124: Hoare triple {26522#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26518#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:34:15,218 INFO L290 TraceCheckUtils]: 123: Hoare triple {26522#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26522#(< ~counter~0 100)} is VALID [2022-04-08 14:34:15,218 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26068#true} {26522#(< ~counter~0 100)} #55#return; {26522#(< ~counter~0 100)} is VALID [2022-04-08 14:34:15,218 INFO L290 TraceCheckUtils]: 121: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,218 INFO L290 TraceCheckUtils]: 120: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,218 INFO L290 TraceCheckUtils]: 119: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,218 INFO L272 TraceCheckUtils]: 118: Hoare triple {26522#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,219 INFO L290 TraceCheckUtils]: 117: Hoare triple {26522#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {26522#(< ~counter~0 100)} is VALID [2022-04-08 14:34:15,220 INFO L290 TraceCheckUtils]: 116: Hoare triple {26547#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26522#(< ~counter~0 100)} is VALID [2022-04-08 14:34:15,220 INFO L290 TraceCheckUtils]: 115: Hoare triple {26547#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26547#(< ~counter~0 99)} is VALID [2022-04-08 14:34:15,221 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {26068#true} {26547#(< ~counter~0 99)} #55#return; {26547#(< ~counter~0 99)} is VALID [2022-04-08 14:34:15,221 INFO L290 TraceCheckUtils]: 113: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,221 INFO L290 TraceCheckUtils]: 112: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,221 INFO L290 TraceCheckUtils]: 111: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,221 INFO L272 TraceCheckUtils]: 110: Hoare triple {26547#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,221 INFO L290 TraceCheckUtils]: 109: Hoare triple {26547#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {26547#(< ~counter~0 99)} is VALID [2022-04-08 14:34:15,222 INFO L290 TraceCheckUtils]: 108: Hoare triple {26572#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26547#(< ~counter~0 99)} is VALID [2022-04-08 14:34:15,222 INFO L290 TraceCheckUtils]: 107: Hoare triple {26572#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26572#(< ~counter~0 98)} is VALID [2022-04-08 14:34:15,223 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {26068#true} {26572#(< ~counter~0 98)} #55#return; {26572#(< ~counter~0 98)} is VALID [2022-04-08 14:34:15,223 INFO L290 TraceCheckUtils]: 105: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,223 INFO L290 TraceCheckUtils]: 104: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,223 INFO L290 TraceCheckUtils]: 103: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,223 INFO L272 TraceCheckUtils]: 102: Hoare triple {26572#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,223 INFO L290 TraceCheckUtils]: 101: Hoare triple {26572#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {26572#(< ~counter~0 98)} is VALID [2022-04-08 14:34:15,224 INFO L290 TraceCheckUtils]: 100: Hoare triple {26597#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26572#(< ~counter~0 98)} is VALID [2022-04-08 14:34:15,224 INFO L290 TraceCheckUtils]: 99: Hoare triple {26597#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26597#(< ~counter~0 97)} is VALID [2022-04-08 14:34:15,224 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {26068#true} {26597#(< ~counter~0 97)} #55#return; {26597#(< ~counter~0 97)} is VALID [2022-04-08 14:34:15,225 INFO L290 TraceCheckUtils]: 97: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,225 INFO L290 TraceCheckUtils]: 96: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,225 INFO L290 TraceCheckUtils]: 95: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,225 INFO L272 TraceCheckUtils]: 94: Hoare triple {26597#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,225 INFO L290 TraceCheckUtils]: 93: Hoare triple {26597#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {26597#(< ~counter~0 97)} is VALID [2022-04-08 14:34:15,226 INFO L290 TraceCheckUtils]: 92: Hoare triple {26622#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26597#(< ~counter~0 97)} is VALID [2022-04-08 14:34:15,226 INFO L290 TraceCheckUtils]: 91: Hoare triple {26622#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26622#(< ~counter~0 96)} is VALID [2022-04-08 14:34:15,226 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26068#true} {26622#(< ~counter~0 96)} #55#return; {26622#(< ~counter~0 96)} is VALID [2022-04-08 14:34:15,226 INFO L290 TraceCheckUtils]: 89: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,227 INFO L290 TraceCheckUtils]: 88: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,227 INFO L272 TraceCheckUtils]: 86: Hoare triple {26622#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {26622#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {26622#(< ~counter~0 96)} is VALID [2022-04-08 14:34:15,228 INFO L290 TraceCheckUtils]: 84: Hoare triple {26647#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26622#(< ~counter~0 96)} is VALID [2022-04-08 14:34:15,228 INFO L290 TraceCheckUtils]: 83: Hoare triple {26647#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26647#(< ~counter~0 95)} is VALID [2022-04-08 14:34:15,228 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {26068#true} {26647#(< ~counter~0 95)} #55#return; {26647#(< ~counter~0 95)} is VALID [2022-04-08 14:34:15,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,228 INFO L290 TraceCheckUtils]: 80: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,229 INFO L272 TraceCheckUtils]: 78: Hoare triple {26647#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {26647#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {26647#(< ~counter~0 95)} is VALID [2022-04-08 14:34:15,229 INFO L290 TraceCheckUtils]: 76: Hoare triple {26672#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26647#(< ~counter~0 95)} is VALID [2022-04-08 14:34:15,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {26672#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26672#(< ~counter~0 94)} is VALID [2022-04-08 14:34:15,230 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26068#true} {26672#(< ~counter~0 94)} #55#return; {26672#(< ~counter~0 94)} is VALID [2022-04-08 14:34:15,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,230 INFO L290 TraceCheckUtils]: 72: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,230 INFO L272 TraceCheckUtils]: 70: Hoare triple {26672#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {26672#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {26672#(< ~counter~0 94)} is VALID [2022-04-08 14:34:15,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {26697#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26672#(< ~counter~0 94)} is VALID [2022-04-08 14:34:15,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {26697#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26697#(< ~counter~0 93)} is VALID [2022-04-08 14:34:15,243 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26068#true} {26697#(< ~counter~0 93)} #55#return; {26697#(< ~counter~0 93)} is VALID [2022-04-08 14:34:15,243 INFO L290 TraceCheckUtils]: 65: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,243 INFO L272 TraceCheckUtils]: 62: Hoare triple {26697#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {26697#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {26697#(< ~counter~0 93)} is VALID [2022-04-08 14:34:15,244 INFO L290 TraceCheckUtils]: 60: Hoare triple {26722#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26697#(< ~counter~0 93)} is VALID [2022-04-08 14:34:15,244 INFO L290 TraceCheckUtils]: 59: Hoare triple {26722#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26722#(< ~counter~0 92)} is VALID [2022-04-08 14:34:15,245 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26068#true} {26722#(< ~counter~0 92)} #55#return; {26722#(< ~counter~0 92)} is VALID [2022-04-08 14:34:15,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,245 INFO L290 TraceCheckUtils]: 56: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,245 INFO L290 TraceCheckUtils]: 55: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,245 INFO L272 TraceCheckUtils]: 54: Hoare triple {26722#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {26722#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {26722#(< ~counter~0 92)} is VALID [2022-04-08 14:34:15,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {26747#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26722#(< ~counter~0 92)} is VALID [2022-04-08 14:34:15,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {26747#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26747#(< ~counter~0 91)} is VALID [2022-04-08 14:34:15,247 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26068#true} {26747#(< ~counter~0 91)} #55#return; {26747#(< ~counter~0 91)} is VALID [2022-04-08 14:34:15,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,247 INFO L272 TraceCheckUtils]: 46: Hoare triple {26747#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {26747#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {26747#(< ~counter~0 91)} is VALID [2022-04-08 14:34:15,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {26772#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26747#(< ~counter~0 91)} is VALID [2022-04-08 14:34:15,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {26772#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26772#(< ~counter~0 90)} is VALID [2022-04-08 14:34:15,248 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26068#true} {26772#(< ~counter~0 90)} #55#return; {26772#(< ~counter~0 90)} is VALID [2022-04-08 14:34:15,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,249 INFO L272 TraceCheckUtils]: 38: Hoare triple {26772#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {26772#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {26772#(< ~counter~0 90)} is VALID [2022-04-08 14:34:15,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {26797#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26772#(< ~counter~0 90)} is VALID [2022-04-08 14:34:15,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {26797#(< ~counter~0 89)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26797#(< ~counter~0 89)} is VALID [2022-04-08 14:34:15,250 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {26068#true} {26797#(< ~counter~0 89)} #55#return; {26797#(< ~counter~0 89)} is VALID [2022-04-08 14:34:15,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,251 INFO L272 TraceCheckUtils]: 30: Hoare triple {26797#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {26797#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {26797#(< ~counter~0 89)} is VALID [2022-04-08 14:34:15,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {26822#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26797#(< ~counter~0 89)} is VALID [2022-04-08 14:34:15,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {26822#(< ~counter~0 88)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26822#(< ~counter~0 88)} is VALID [2022-04-08 14:34:15,252 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26068#true} {26822#(< ~counter~0 88)} #55#return; {26822#(< ~counter~0 88)} is VALID [2022-04-08 14:34:15,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,253 INFO L272 TraceCheckUtils]: 22: Hoare triple {26822#(< ~counter~0 88)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {26822#(< ~counter~0 88)} assume !!(#t~post5 < 100);havoc #t~post5; {26822#(< ~counter~0 88)} is VALID [2022-04-08 14:34:15,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {26847#(< ~counter~0 87)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26822#(< ~counter~0 88)} is VALID [2022-04-08 14:34:15,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {26847#(< ~counter~0 87)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26847#(< ~counter~0 87)} is VALID [2022-04-08 14:34:15,254 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26068#true} {26847#(< ~counter~0 87)} #55#return; {26847#(< ~counter~0 87)} is VALID [2022-04-08 14:34:15,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,254 INFO L272 TraceCheckUtils]: 14: Hoare triple {26847#(< ~counter~0 87)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {26847#(< ~counter~0 87)} assume !!(#t~post5 < 100);havoc #t~post5; {26847#(< ~counter~0 87)} is VALID [2022-04-08 14:34:15,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {26872#(< ~counter~0 86)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26847#(< ~counter~0 87)} is VALID [2022-04-08 14:34:15,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {26872#(< ~counter~0 86)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {26872#(< ~counter~0 86)} is VALID [2022-04-08 14:34:15,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26068#true} {26872#(< ~counter~0 86)} #53#return; {26872#(< ~counter~0 86)} is VALID [2022-04-08 14:34:15,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-08 14:34:15,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-08 14:34:15,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-08 14:34:15,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {26872#(< ~counter~0 86)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {26068#true} is VALID [2022-04-08 14:34:15,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {26872#(< ~counter~0 86)} 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; {26872#(< ~counter~0 86)} is VALID [2022-04-08 14:34:15,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {26872#(< ~counter~0 86)} call #t~ret6 := main(); {26872#(< ~counter~0 86)} is VALID [2022-04-08 14:34:15,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26872#(< ~counter~0 86)} {26068#true} #61#return; {26872#(< ~counter~0 86)} is VALID [2022-04-08 14:34:15,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {26872#(< ~counter~0 86)} assume true; {26872#(< ~counter~0 86)} is VALID [2022-04-08 14:34:15,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {26068#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; {26872#(< ~counter~0 86)} is VALID [2022-04-08 14:34:15,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {26068#true} call ULTIMATE.init(); {26068#true} is VALID [2022-04-08 14:34:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 30 proven. 392 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-08 14:34:15,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:15,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057496915] [2022-04-08 14:34:15,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:15,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451686755] [2022-04-08 14:34:15,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451686755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:15,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:15,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-08 14:34:15,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:15,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2066313067] [2022-04-08 14:34:15,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2066313067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:15,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:15,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 14:34:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071568732] [2022-04-08 14:34:15,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:15,260 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 135 [2022-04-08 14:34:15,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:15,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:15,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:15,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 14:34:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 14:34:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 14:34:15,372 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:15,990 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2022-04-08 14:34:15,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 14:34:15,990 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 135 [2022-04-08 14:34:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 150 transitions. [2022-04-08 14:34:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 150 transitions. [2022-04-08 14:34:15,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 150 transitions. [2022-04-08 14:34:16,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:16,114 INFO L225 Difference]: With dead ends: 150 [2022-04-08 14:34:16,114 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 14:34:16,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=963, Invalid=1293, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 14:34:16,116 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:16,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 201 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 14:34:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-08 14:34:16,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:16,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:16,356 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:16,356 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:16,360 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2022-04-08 14:34:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-08 14:34:16,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:16,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:16,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-04-08 14:34:16,361 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-04-08 14:34:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:16,363 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2022-04-08 14:34:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-08 14:34:16,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:16,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:16,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:16,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2022-04-08 14:34:16,366 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 135 [2022-04-08 14:34:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:16,366 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2022-04-08 14:34:16,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:34:16,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 142 transitions. [2022-04-08 14:34:16,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-08 14:34:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-08 14:34:16,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:16,632 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:16,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:16,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-08 14:34:16,855 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1590123308, now seen corresponding path program 27 times [2022-04-08 14:34:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:16,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [508789624] [2022-04-08 14:34:16,935 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:16,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1590123308, now seen corresponding path program 28 times [2022-04-08 14:34:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929254228] [2022-04-08 14:34:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:16,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:16,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531148701] [2022-04-08 14:34:16,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:34:16,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:16,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:16,963 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:16,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 14:34:17,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:34:17,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:17,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 14:34:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:17,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:17,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {27799#true} call ULTIMATE.init(); {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {27799#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; {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27799#true} {27799#true} #61#return; {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {27799#true} call #t~ret6 := main(); {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {27799#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; {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {27799#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27799#true} {27799#true} #53#return; {27799#true} is VALID [2022-04-08 14:34:17,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {27799#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {27837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:17,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {27837#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:17,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {27837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {27837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:17,777 INFO L272 TraceCheckUtils]: 14: Hoare triple {27837#(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)); {27799#true} is VALID [2022-04-08 14:34:17,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,777 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27799#true} {27837#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {27837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:17,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {27837#(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; {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:34:17,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:34:17,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:34:17,778 INFO L272 TraceCheckUtils]: 22: Hoare triple {27862#(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)); {27799#true} is VALID [2022-04-08 14:34:17,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,779 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27799#true} {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:34:17,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {27862#(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; {27887#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:34:17,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {27887#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27887#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:34:17,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {27887#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {27887#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:34:17,780 INFO L272 TraceCheckUtils]: 30: Hoare triple {27887#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-08 14:34:17,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,781 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27799#true} {27887#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {27887#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:34:17,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {27887#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:34:17,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:34:17,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:34:17,782 INFO L272 TraceCheckUtils]: 38: Hoare triple {27912#(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)); {27799#true} is VALID [2022-04-08 14:34:17,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,783 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27799#true} {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:34:17,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {27912#(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; {27937#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:17,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {27937#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27937#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:17,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {27937#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {27937#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:17,784 INFO L272 TraceCheckUtils]: 46: Hoare triple {27937#(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)); {27799#true} is VALID [2022-04-08 14:34:17,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,785 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {27799#true} {27937#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {27937#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:17,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {27937#(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; {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:34:17,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:34:17,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:34:17,787 INFO L272 TraceCheckUtils]: 54: Hoare triple {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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)); {27799#true} is VALID [2022-04-08 14:34:17,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,787 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27799#true} {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #55#return; {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:34:17,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {27987#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:17,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {27987#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27987#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:17,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {27987#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {27987#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:17,789 INFO L272 TraceCheckUtils]: 62: Hoare triple {27987#(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)); {27799#true} is VALID [2022-04-08 14:34:17,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,789 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27799#true} {27987#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {27987#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:17,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {27987#(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; {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:17,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:17,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:17,790 INFO L272 TraceCheckUtils]: 70: Hoare triple {28012#(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)); {27799#true} is VALID [2022-04-08 14:34:17,791 INFO L290 TraceCheckUtils]: 71: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,791 INFO L290 TraceCheckUtils]: 72: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,791 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27799#true} {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:17,791 INFO L290 TraceCheckUtils]: 75: Hoare triple {28012#(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; {28037#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:34:17,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {28037#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28037#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:34:17,792 INFO L290 TraceCheckUtils]: 77: Hoare triple {28037#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {28037#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:34:17,792 INFO L272 TraceCheckUtils]: 78: Hoare triple {28037#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-08 14:34:17,792 INFO L290 TraceCheckUtils]: 79: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,792 INFO L290 TraceCheckUtils]: 80: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,792 INFO L290 TraceCheckUtils]: 81: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,793 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {27799#true} {28037#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {28037#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:34:17,793 INFO L290 TraceCheckUtils]: 83: Hoare triple {28037#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:34:17,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:34:17,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 100);havoc #t~post5; {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:34:17,794 INFO L272 TraceCheckUtils]: 86: Hoare triple {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-08 14:34:17,794 INFO L290 TraceCheckUtils]: 87: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,794 INFO L290 TraceCheckUtils]: 88: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,794 INFO L290 TraceCheckUtils]: 89: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,795 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27799#true} {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #55#return; {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:34:17,795 INFO L290 TraceCheckUtils]: 91: Hoare triple {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {28087#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:34:17,796 INFO L290 TraceCheckUtils]: 92: Hoare triple {28087#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28087#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:34:17,796 INFO L290 TraceCheckUtils]: 93: Hoare triple {28087#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {28087#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:34:17,796 INFO L272 TraceCheckUtils]: 94: Hoare triple {28087#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-08 14:34:17,796 INFO L290 TraceCheckUtils]: 95: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,796 INFO L290 TraceCheckUtils]: 96: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,796 INFO L290 TraceCheckUtils]: 97: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,797 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {27799#true} {28087#(and (= main_~y~0 10) (= main_~c~0 10))} #55#return; {28087#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:34:17,797 INFO L290 TraceCheckUtils]: 99: Hoare triple {28087#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:34:17,797 INFO L290 TraceCheckUtils]: 100: Hoare triple {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:34:17,798 INFO L290 TraceCheckUtils]: 101: Hoare triple {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 100);havoc #t~post5; {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:34:17,798 INFO L272 TraceCheckUtils]: 102: Hoare triple {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-08 14:34:17,798 INFO L290 TraceCheckUtils]: 103: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,798 INFO L290 TraceCheckUtils]: 104: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,798 INFO L290 TraceCheckUtils]: 105: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,798 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {27799#true} {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #55#return; {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:34:17,799 INFO L290 TraceCheckUtils]: 107: Hoare triple {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:17,799 INFO L290 TraceCheckUtils]: 108: Hoare triple {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:17,800 INFO L290 TraceCheckUtils]: 109: Hoare triple {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:17,800 INFO L272 TraceCheckUtils]: 110: Hoare triple {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 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)); {27799#true} is VALID [2022-04-08 14:34:17,800 INFO L290 TraceCheckUtils]: 111: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,800 INFO L290 TraceCheckUtils]: 112: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,800 INFO L290 TraceCheckUtils]: 113: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,800 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {27799#true} {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} #55#return; {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:17,801 INFO L290 TraceCheckUtils]: 115: Hoare triple {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 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; {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 14:34:17,801 INFO L290 TraceCheckUtils]: 116: Hoare triple {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 14:34:17,801 INFO L290 TraceCheckUtils]: 117: Hoare triple {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} assume !!(#t~post5 < 100);havoc #t~post5; {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 14:34:17,802 INFO L272 TraceCheckUtils]: 118: Hoare triple {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 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)); {27799#true} is VALID [2022-04-08 14:34:17,802 INFO L290 TraceCheckUtils]: 119: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,802 INFO L290 TraceCheckUtils]: 120: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,802 INFO L290 TraceCheckUtils]: 121: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,802 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {27799#true} {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} #55#return; {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 14:34:17,803 INFO L290 TraceCheckUtils]: 123: Hoare triple {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 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; {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-08 14:34:17,803 INFO L290 TraceCheckUtils]: 124: Hoare triple {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-08 14:34:17,803 INFO L290 TraceCheckUtils]: 125: Hoare triple {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} assume !!(#t~post5 < 100);havoc #t~post5; {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-08 14:34:17,803 INFO L272 TraceCheckUtils]: 126: Hoare triple {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-08 14:34:17,804 INFO L290 TraceCheckUtils]: 127: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,804 INFO L290 TraceCheckUtils]: 128: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,804 INFO L290 TraceCheckUtils]: 129: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,804 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27799#true} {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} #55#return; {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-08 14:34:17,805 INFO L290 TraceCheckUtils]: 131: Hoare triple {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} is VALID [2022-04-08 14:34:17,805 INFO L272 TraceCheckUtils]: 132: Hoare triple {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-08 14:34:17,806 INFO L290 TraceCheckUtils]: 133: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-08 14:34:17,806 INFO L290 TraceCheckUtils]: 134: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-08 14:34:17,806 INFO L290 TraceCheckUtils]: 135: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-08 14:34:17,806 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {27799#true} {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} #57#return; {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} is VALID [2022-04-08 14:34:17,807 INFO L272 TraceCheckUtils]: 137: Hoare triple {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {28231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:34:17,807 INFO L290 TraceCheckUtils]: 138: Hoare triple {28231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:34:17,807 INFO L290 TraceCheckUtils]: 139: Hoare triple {28235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27800#false} is VALID [2022-04-08 14:34:17,807 INFO L290 TraceCheckUtils]: 140: Hoare triple {27800#false} assume !false; {27800#false} is VALID [2022-04-08 14:34:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 32 proven. 420 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 14:34:17,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:18,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929254228] [2022-04-08 14:34:18,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:18,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531148701] [2022-04-08 14:34:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531148701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:34:18,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:34:18,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-08 14:34:18,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:18,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [508789624] [2022-04-08 14:34:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [508789624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:18,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:18,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 14:34:18,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839618778] [2022-04-08 14:34:18,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 141 [2022-04-08 14:34:18,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:18,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 14:34:18,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:18,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 14:34:18,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:18,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 14:34:18,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 14:34:18,280 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 14:34:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:20,872 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2022-04-08 14:34:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:34:20,872 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 141 [2022-04-08 14:34:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 14:34:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-08 14:34:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 14:34:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-08 14:34:20,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 109 transitions. [2022-04-08 14:34:20,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:21,001 INFO L225 Difference]: With dead ends: 148 [2022-04-08 14:34:21,001 INFO L226 Difference]: Without dead ends: 142 [2022-04-08 14:34:21,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-08 14:34:21,002 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:21,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 947 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 14:34:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-08 14:34:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-08 14:34:21,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:21,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:34:21,255 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:34:21,255 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:34:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:21,257 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2022-04-08 14:34:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-08 14:34:21,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:21,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:21,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 142 states. [2022-04-08 14:34:21,258 INFO L87 Difference]: Start difference. First operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 142 states. [2022-04-08 14:34:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:21,260 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2022-04-08 14:34:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-08 14:34:21,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:21,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:21,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:21,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:34:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2022-04-08 14:34:21,263 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 141 [2022-04-08 14:34:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:21,263 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2022-04-08 14:34:21,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 14:34:21,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 145 transitions. [2022-04-08 14:34:21,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-08 14:34:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-08 14:34:21,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:21,589 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:21,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:21,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:21,803 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -654323313, now seen corresponding path program 27 times [2022-04-08 14:34:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:21,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [364274739] [2022-04-08 14:34:21,888 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:21,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -654323313, now seen corresponding path program 28 times [2022-04-08 14:34:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:21,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961501663] [2022-04-08 14:34:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:21,905 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:21,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168233370] [2022-04-08 14:34:21,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:34:21,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:21,907 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:21,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 14:34:21,990 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:34:21,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:21,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 14:34:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:22,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:22,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2022-04-08 14:34:22,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {29169#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; {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {29177#(<= ~counter~0 0)} assume true; {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29177#(<= ~counter~0 0)} {29169#true} #61#return; {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {29177#(<= ~counter~0 0)} call #t~ret6 := main(); {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {29177#(<= ~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; {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,756 INFO L272 TraceCheckUtils]: 6: Hoare triple {29177#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {29177#(<= ~counter~0 0)} ~cond := #in~cond; {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {29177#(<= ~counter~0 0)} assume !(0 == ~cond); {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {29177#(<= ~counter~0 0)} assume true; {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29177#(<= ~counter~0 0)} {29177#(<= ~counter~0 0)} #53#return; {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {29177#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {29177#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:22,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {29177#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29211#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:22,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {29211#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {29211#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:22,760 INFO L272 TraceCheckUtils]: 14: Hoare triple {29211#(<= ~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)); {29211#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:22,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {29211#(<= ~counter~0 1)} ~cond := #in~cond; {29211#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:22,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {29211#(<= ~counter~0 1)} assume !(0 == ~cond); {29211#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:22,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {29211#(<= ~counter~0 1)} assume true; {29211#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:22,761 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29211#(<= ~counter~0 1)} {29211#(<= ~counter~0 1)} #55#return; {29211#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:22,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {29211#(<= ~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; {29211#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:22,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {29211#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29236#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:22,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {29236#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {29236#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:22,762 INFO L272 TraceCheckUtils]: 22: Hoare triple {29236#(<= ~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)); {29236#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:22,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {29236#(<= ~counter~0 2)} ~cond := #in~cond; {29236#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:22,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {29236#(<= ~counter~0 2)} assume !(0 == ~cond); {29236#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:22,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {29236#(<= ~counter~0 2)} assume true; {29236#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:22,764 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29236#(<= ~counter~0 2)} {29236#(<= ~counter~0 2)} #55#return; {29236#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:22,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {29236#(<= ~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; {29236#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:22,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {29236#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29261#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:22,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {29261#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {29261#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:22,765 INFO L272 TraceCheckUtils]: 30: Hoare triple {29261#(<= ~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)); {29261#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:22,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {29261#(<= ~counter~0 3)} ~cond := #in~cond; {29261#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:22,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {29261#(<= ~counter~0 3)} assume !(0 == ~cond); {29261#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:22,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {29261#(<= ~counter~0 3)} assume true; {29261#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:22,766 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29261#(<= ~counter~0 3)} {29261#(<= ~counter~0 3)} #55#return; {29261#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:22,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {29261#(<= ~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; {29261#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:22,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {29261#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29286#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:22,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {29286#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {29286#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:22,768 INFO L272 TraceCheckUtils]: 38: Hoare triple {29286#(<= ~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)); {29286#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:22,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {29286#(<= ~counter~0 4)} ~cond := #in~cond; {29286#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:22,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {29286#(<= ~counter~0 4)} assume !(0 == ~cond); {29286#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:22,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {29286#(<= ~counter~0 4)} assume true; {29286#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:22,769 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29286#(<= ~counter~0 4)} {29286#(<= ~counter~0 4)} #55#return; {29286#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:22,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {29286#(<= ~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; {29286#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:22,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {29286#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29311#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:22,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {29311#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {29311#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:22,771 INFO L272 TraceCheckUtils]: 46: Hoare triple {29311#(<= ~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)); {29311#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:22,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {29311#(<= ~counter~0 5)} ~cond := #in~cond; {29311#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:22,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {29311#(<= ~counter~0 5)} assume !(0 == ~cond); {29311#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:22,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {29311#(<= ~counter~0 5)} assume true; {29311#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:22,772 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29311#(<= ~counter~0 5)} {29311#(<= ~counter~0 5)} #55#return; {29311#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:22,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {29311#(<= ~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; {29311#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:22,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {29311#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29336#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:22,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {29336#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {29336#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:22,774 INFO L272 TraceCheckUtils]: 54: Hoare triple {29336#(<= ~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)); {29336#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:22,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {29336#(<= ~counter~0 6)} ~cond := #in~cond; {29336#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:22,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {29336#(<= ~counter~0 6)} assume !(0 == ~cond); {29336#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:22,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {29336#(<= ~counter~0 6)} assume true; {29336#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:22,775 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29336#(<= ~counter~0 6)} {29336#(<= ~counter~0 6)} #55#return; {29336#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:22,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {29336#(<= ~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; {29336#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:22,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {29336#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29361#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:22,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {29361#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {29361#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:22,777 INFO L272 TraceCheckUtils]: 62: Hoare triple {29361#(<= ~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)); {29361#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:22,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {29361#(<= ~counter~0 7)} ~cond := #in~cond; {29361#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:22,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {29361#(<= ~counter~0 7)} assume !(0 == ~cond); {29361#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:22,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {29361#(<= ~counter~0 7)} assume true; {29361#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:22,778 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29361#(<= ~counter~0 7)} {29361#(<= ~counter~0 7)} #55#return; {29361#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:22,778 INFO L290 TraceCheckUtils]: 67: Hoare triple {29361#(<= ~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; {29361#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:22,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {29361#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29386#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:22,779 INFO L290 TraceCheckUtils]: 69: Hoare triple {29386#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {29386#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:22,779 INFO L272 TraceCheckUtils]: 70: Hoare triple {29386#(<= ~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)); {29386#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:22,780 INFO L290 TraceCheckUtils]: 71: Hoare triple {29386#(<= ~counter~0 8)} ~cond := #in~cond; {29386#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:22,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {29386#(<= ~counter~0 8)} assume !(0 == ~cond); {29386#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:22,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {29386#(<= ~counter~0 8)} assume true; {29386#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:22,781 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29386#(<= ~counter~0 8)} {29386#(<= ~counter~0 8)} #55#return; {29386#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:22,781 INFO L290 TraceCheckUtils]: 75: Hoare triple {29386#(<= ~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; {29386#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:22,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {29386#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29411#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:22,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {29411#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {29411#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:22,782 INFO L272 TraceCheckUtils]: 78: Hoare triple {29411#(<= ~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)); {29411#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:22,783 INFO L290 TraceCheckUtils]: 79: Hoare triple {29411#(<= ~counter~0 9)} ~cond := #in~cond; {29411#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:22,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {29411#(<= ~counter~0 9)} assume !(0 == ~cond); {29411#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:22,783 INFO L290 TraceCheckUtils]: 81: Hoare triple {29411#(<= ~counter~0 9)} assume true; {29411#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:22,783 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29411#(<= ~counter~0 9)} {29411#(<= ~counter~0 9)} #55#return; {29411#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:22,784 INFO L290 TraceCheckUtils]: 83: Hoare triple {29411#(<= ~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; {29411#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:22,784 INFO L290 TraceCheckUtils]: 84: Hoare triple {29411#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29436#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:22,785 INFO L290 TraceCheckUtils]: 85: Hoare triple {29436#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {29436#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:22,785 INFO L272 TraceCheckUtils]: 86: Hoare triple {29436#(<= ~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)); {29436#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:22,785 INFO L290 TraceCheckUtils]: 87: Hoare triple {29436#(<= ~counter~0 10)} ~cond := #in~cond; {29436#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:22,786 INFO L290 TraceCheckUtils]: 88: Hoare triple {29436#(<= ~counter~0 10)} assume !(0 == ~cond); {29436#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:22,786 INFO L290 TraceCheckUtils]: 89: Hoare triple {29436#(<= ~counter~0 10)} assume true; {29436#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:22,786 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29436#(<= ~counter~0 10)} {29436#(<= ~counter~0 10)} #55#return; {29436#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:22,787 INFO L290 TraceCheckUtils]: 91: Hoare triple {29436#(<= ~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; {29436#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:22,787 INFO L290 TraceCheckUtils]: 92: Hoare triple {29436#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29461#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:22,788 INFO L290 TraceCheckUtils]: 93: Hoare triple {29461#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {29461#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:22,788 INFO L272 TraceCheckUtils]: 94: Hoare triple {29461#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29461#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:22,788 INFO L290 TraceCheckUtils]: 95: Hoare triple {29461#(<= ~counter~0 11)} ~cond := #in~cond; {29461#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:22,788 INFO L290 TraceCheckUtils]: 96: Hoare triple {29461#(<= ~counter~0 11)} assume !(0 == ~cond); {29461#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:22,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {29461#(<= ~counter~0 11)} assume true; {29461#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:22,789 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29461#(<= ~counter~0 11)} {29461#(<= ~counter~0 11)} #55#return; {29461#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:22,795 INFO L290 TraceCheckUtils]: 99: Hoare triple {29461#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29461#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:22,795 INFO L290 TraceCheckUtils]: 100: Hoare triple {29461#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29486#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:22,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {29486#(<= ~counter~0 12)} assume !!(#t~post5 < 100);havoc #t~post5; {29486#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:22,796 INFO L272 TraceCheckUtils]: 102: Hoare triple {29486#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29486#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:22,796 INFO L290 TraceCheckUtils]: 103: Hoare triple {29486#(<= ~counter~0 12)} ~cond := #in~cond; {29486#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:22,796 INFO L290 TraceCheckUtils]: 104: Hoare triple {29486#(<= ~counter~0 12)} assume !(0 == ~cond); {29486#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:22,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {29486#(<= ~counter~0 12)} assume true; {29486#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:22,797 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29486#(<= ~counter~0 12)} {29486#(<= ~counter~0 12)} #55#return; {29486#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:22,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {29486#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29486#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:22,798 INFO L290 TraceCheckUtils]: 108: Hoare triple {29486#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29511#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:22,798 INFO L290 TraceCheckUtils]: 109: Hoare triple {29511#(<= ~counter~0 13)} assume !!(#t~post5 < 100);havoc #t~post5; {29511#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:22,799 INFO L272 TraceCheckUtils]: 110: Hoare triple {29511#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29511#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:22,799 INFO L290 TraceCheckUtils]: 111: Hoare triple {29511#(<= ~counter~0 13)} ~cond := #in~cond; {29511#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:22,799 INFO L290 TraceCheckUtils]: 112: Hoare triple {29511#(<= ~counter~0 13)} assume !(0 == ~cond); {29511#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:22,800 INFO L290 TraceCheckUtils]: 113: Hoare triple {29511#(<= ~counter~0 13)} assume true; {29511#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:22,800 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29511#(<= ~counter~0 13)} {29511#(<= ~counter~0 13)} #55#return; {29511#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:22,800 INFO L290 TraceCheckUtils]: 115: Hoare triple {29511#(<= ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29511#(<= ~counter~0 13)} is VALID [2022-04-08 14:34:22,801 INFO L290 TraceCheckUtils]: 116: Hoare triple {29511#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29536#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:22,801 INFO L290 TraceCheckUtils]: 117: Hoare triple {29536#(<= ~counter~0 14)} assume !!(#t~post5 < 100);havoc #t~post5; {29536#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:22,802 INFO L272 TraceCheckUtils]: 118: Hoare triple {29536#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29536#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:22,802 INFO L290 TraceCheckUtils]: 119: Hoare triple {29536#(<= ~counter~0 14)} ~cond := #in~cond; {29536#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:22,802 INFO L290 TraceCheckUtils]: 120: Hoare triple {29536#(<= ~counter~0 14)} assume !(0 == ~cond); {29536#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:22,802 INFO L290 TraceCheckUtils]: 121: Hoare triple {29536#(<= ~counter~0 14)} assume true; {29536#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:22,803 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29536#(<= ~counter~0 14)} {29536#(<= ~counter~0 14)} #55#return; {29536#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:22,803 INFO L290 TraceCheckUtils]: 123: Hoare triple {29536#(<= ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29536#(<= ~counter~0 14)} is VALID [2022-04-08 14:34:22,804 INFO L290 TraceCheckUtils]: 124: Hoare triple {29536#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29561#(<= ~counter~0 15)} is VALID [2022-04-08 14:34:22,804 INFO L290 TraceCheckUtils]: 125: Hoare triple {29561#(<= ~counter~0 15)} assume !!(#t~post5 < 100);havoc #t~post5; {29561#(<= ~counter~0 15)} is VALID [2022-04-08 14:34:22,804 INFO L272 TraceCheckUtils]: 126: Hoare triple {29561#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29561#(<= ~counter~0 15)} is VALID [2022-04-08 14:34:22,805 INFO L290 TraceCheckUtils]: 127: Hoare triple {29561#(<= ~counter~0 15)} ~cond := #in~cond; {29561#(<= ~counter~0 15)} is VALID [2022-04-08 14:34:22,805 INFO L290 TraceCheckUtils]: 128: Hoare triple {29561#(<= ~counter~0 15)} assume !(0 == ~cond); {29561#(<= ~counter~0 15)} is VALID [2022-04-08 14:34:22,805 INFO L290 TraceCheckUtils]: 129: Hoare triple {29561#(<= ~counter~0 15)} assume true; {29561#(<= ~counter~0 15)} is VALID [2022-04-08 14:34:22,806 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29561#(<= ~counter~0 15)} {29561#(<= ~counter~0 15)} #55#return; {29561#(<= ~counter~0 15)} is VALID [2022-04-08 14:34:22,806 INFO L290 TraceCheckUtils]: 131: Hoare triple {29561#(<= ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29561#(<= ~counter~0 15)} is VALID [2022-04-08 14:34:22,806 INFO L290 TraceCheckUtils]: 132: Hoare triple {29561#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29586#(<= |main_#t~post5| 15)} is VALID [2022-04-08 14:34:22,807 INFO L290 TraceCheckUtils]: 133: Hoare triple {29586#(<= |main_#t~post5| 15)} assume !(#t~post5 < 100);havoc #t~post5; {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L272 TraceCheckUtils]: 134: Hoare triple {29170#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)); {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L290 TraceCheckUtils]: 135: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L290 TraceCheckUtils]: 136: Hoare triple {29170#false} assume !(0 == ~cond); {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L290 TraceCheckUtils]: 137: Hoare triple {29170#false} assume true; {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29170#false} {29170#false} #57#return; {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L272 TraceCheckUtils]: 139: Hoare triple {29170#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L290 TraceCheckUtils]: 140: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L290 TraceCheckUtils]: 141: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-08 14:34:22,807 INFO L290 TraceCheckUtils]: 142: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-08 14:34:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:22,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:23,659 INFO L290 TraceCheckUtils]: 142: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-08 14:34:23,659 INFO L290 TraceCheckUtils]: 141: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-08 14:34:23,659 INFO L290 TraceCheckUtils]: 140: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-08 14:34:23,659 INFO L272 TraceCheckUtils]: 139: Hoare triple {29170#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {29170#false} is VALID [2022-04-08 14:34:23,659 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29169#true} {29170#false} #57#return; {29170#false} is VALID [2022-04-08 14:34:23,659 INFO L290 TraceCheckUtils]: 137: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,659 INFO L290 TraceCheckUtils]: 136: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,659 INFO L290 TraceCheckUtils]: 135: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,659 INFO L272 TraceCheckUtils]: 134: Hoare triple {29170#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)); {29169#true} is VALID [2022-04-08 14:34:23,660 INFO L290 TraceCheckUtils]: 133: Hoare triple {29644#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {29170#false} is VALID [2022-04-08 14:34:23,660 INFO L290 TraceCheckUtils]: 132: Hoare triple {29648#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29644#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:34:23,660 INFO L290 TraceCheckUtils]: 131: Hoare triple {29648#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29648#(< ~counter~0 100)} is VALID [2022-04-08 14:34:23,661 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29169#true} {29648#(< ~counter~0 100)} #55#return; {29648#(< ~counter~0 100)} is VALID [2022-04-08 14:34:23,661 INFO L290 TraceCheckUtils]: 129: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,661 INFO L290 TraceCheckUtils]: 128: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,661 INFO L290 TraceCheckUtils]: 127: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,661 INFO L272 TraceCheckUtils]: 126: Hoare triple {29648#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,661 INFO L290 TraceCheckUtils]: 125: Hoare triple {29648#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {29648#(< ~counter~0 100)} is VALID [2022-04-08 14:34:23,663 INFO L290 TraceCheckUtils]: 124: Hoare triple {29673#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29648#(< ~counter~0 100)} is VALID [2022-04-08 14:34:23,663 INFO L290 TraceCheckUtils]: 123: Hoare triple {29673#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29673#(< ~counter~0 99)} is VALID [2022-04-08 14:34:23,663 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29169#true} {29673#(< ~counter~0 99)} #55#return; {29673#(< ~counter~0 99)} is VALID [2022-04-08 14:34:23,663 INFO L290 TraceCheckUtils]: 121: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,663 INFO L290 TraceCheckUtils]: 120: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,664 INFO L290 TraceCheckUtils]: 119: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,664 INFO L272 TraceCheckUtils]: 118: Hoare triple {29673#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,664 INFO L290 TraceCheckUtils]: 117: Hoare triple {29673#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {29673#(< ~counter~0 99)} is VALID [2022-04-08 14:34:23,665 INFO L290 TraceCheckUtils]: 116: Hoare triple {29698#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29673#(< ~counter~0 99)} is VALID [2022-04-08 14:34:23,665 INFO L290 TraceCheckUtils]: 115: Hoare triple {29698#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29698#(< ~counter~0 98)} is VALID [2022-04-08 14:34:23,665 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29169#true} {29698#(< ~counter~0 98)} #55#return; {29698#(< ~counter~0 98)} is VALID [2022-04-08 14:34:23,665 INFO L290 TraceCheckUtils]: 113: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,665 INFO L290 TraceCheckUtils]: 112: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,665 INFO L290 TraceCheckUtils]: 111: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,665 INFO L272 TraceCheckUtils]: 110: Hoare triple {29698#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,666 INFO L290 TraceCheckUtils]: 109: Hoare triple {29698#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {29698#(< ~counter~0 98)} is VALID [2022-04-08 14:34:23,666 INFO L290 TraceCheckUtils]: 108: Hoare triple {29723#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29698#(< ~counter~0 98)} is VALID [2022-04-08 14:34:23,667 INFO L290 TraceCheckUtils]: 107: Hoare triple {29723#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29723#(< ~counter~0 97)} is VALID [2022-04-08 14:34:23,667 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29169#true} {29723#(< ~counter~0 97)} #55#return; {29723#(< ~counter~0 97)} is VALID [2022-04-08 14:34:23,667 INFO L290 TraceCheckUtils]: 105: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,667 INFO L290 TraceCheckUtils]: 104: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,667 INFO L290 TraceCheckUtils]: 103: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,667 INFO L272 TraceCheckUtils]: 102: Hoare triple {29723#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,668 INFO L290 TraceCheckUtils]: 101: Hoare triple {29723#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {29723#(< ~counter~0 97)} is VALID [2022-04-08 14:34:23,668 INFO L290 TraceCheckUtils]: 100: Hoare triple {29748#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29723#(< ~counter~0 97)} is VALID [2022-04-08 14:34:23,669 INFO L290 TraceCheckUtils]: 99: Hoare triple {29748#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29748#(< ~counter~0 96)} is VALID [2022-04-08 14:34:23,669 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29169#true} {29748#(< ~counter~0 96)} #55#return; {29748#(< ~counter~0 96)} is VALID [2022-04-08 14:34:23,669 INFO L290 TraceCheckUtils]: 97: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,669 INFO L290 TraceCheckUtils]: 96: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,669 INFO L290 TraceCheckUtils]: 95: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,669 INFO L272 TraceCheckUtils]: 94: Hoare triple {29748#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,670 INFO L290 TraceCheckUtils]: 93: Hoare triple {29748#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {29748#(< ~counter~0 96)} is VALID [2022-04-08 14:34:23,670 INFO L290 TraceCheckUtils]: 92: Hoare triple {29773#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29748#(< ~counter~0 96)} is VALID [2022-04-08 14:34:23,670 INFO L290 TraceCheckUtils]: 91: Hoare triple {29773#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29773#(< ~counter~0 95)} is VALID [2022-04-08 14:34:23,671 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29169#true} {29773#(< ~counter~0 95)} #55#return; {29773#(< ~counter~0 95)} is VALID [2022-04-08 14:34:23,671 INFO L290 TraceCheckUtils]: 89: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,671 INFO L290 TraceCheckUtils]: 88: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,671 INFO L290 TraceCheckUtils]: 87: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,671 INFO L272 TraceCheckUtils]: 86: Hoare triple {29773#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,671 INFO L290 TraceCheckUtils]: 85: Hoare triple {29773#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {29773#(< ~counter~0 95)} is VALID [2022-04-08 14:34:23,672 INFO L290 TraceCheckUtils]: 84: Hoare triple {29798#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29773#(< ~counter~0 95)} is VALID [2022-04-08 14:34:23,672 INFO L290 TraceCheckUtils]: 83: Hoare triple {29798#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29798#(< ~counter~0 94)} is VALID [2022-04-08 14:34:23,673 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29169#true} {29798#(< ~counter~0 94)} #55#return; {29798#(< ~counter~0 94)} is VALID [2022-04-08 14:34:23,673 INFO L290 TraceCheckUtils]: 81: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,673 INFO L290 TraceCheckUtils]: 80: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,673 INFO L290 TraceCheckUtils]: 79: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,673 INFO L272 TraceCheckUtils]: 78: Hoare triple {29798#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,673 INFO L290 TraceCheckUtils]: 77: Hoare triple {29798#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {29798#(< ~counter~0 94)} is VALID [2022-04-08 14:34:23,674 INFO L290 TraceCheckUtils]: 76: Hoare triple {29823#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29798#(< ~counter~0 94)} is VALID [2022-04-08 14:34:23,674 INFO L290 TraceCheckUtils]: 75: Hoare triple {29823#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29823#(< ~counter~0 93)} is VALID [2022-04-08 14:34:23,675 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29169#true} {29823#(< ~counter~0 93)} #55#return; {29823#(< ~counter~0 93)} is VALID [2022-04-08 14:34:23,675 INFO L290 TraceCheckUtils]: 73: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,675 INFO L290 TraceCheckUtils]: 72: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,675 INFO L290 TraceCheckUtils]: 71: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,675 INFO L272 TraceCheckUtils]: 70: Hoare triple {29823#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,675 INFO L290 TraceCheckUtils]: 69: Hoare triple {29823#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {29823#(< ~counter~0 93)} is VALID [2022-04-08 14:34:23,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {29848#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29823#(< ~counter~0 93)} is VALID [2022-04-08 14:34:23,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {29848#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29848#(< ~counter~0 92)} is VALID [2022-04-08 14:34:23,677 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29169#true} {29848#(< ~counter~0 92)} #55#return; {29848#(< ~counter~0 92)} is VALID [2022-04-08 14:34:23,677 INFO L290 TraceCheckUtils]: 65: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,677 INFO L290 TraceCheckUtils]: 63: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,677 INFO L272 TraceCheckUtils]: 62: Hoare triple {29848#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,677 INFO L290 TraceCheckUtils]: 61: Hoare triple {29848#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {29848#(< ~counter~0 92)} is VALID [2022-04-08 14:34:23,678 INFO L290 TraceCheckUtils]: 60: Hoare triple {29873#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29848#(< ~counter~0 92)} is VALID [2022-04-08 14:34:23,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {29873#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29873#(< ~counter~0 91)} is VALID [2022-04-08 14:34:23,678 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29169#true} {29873#(< ~counter~0 91)} #55#return; {29873#(< ~counter~0 91)} is VALID [2022-04-08 14:34:23,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,679 INFO L272 TraceCheckUtils]: 54: Hoare triple {29873#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,679 INFO L290 TraceCheckUtils]: 53: Hoare triple {29873#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {29873#(< ~counter~0 91)} is VALID [2022-04-08 14:34:23,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {29898#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29873#(< ~counter~0 91)} is VALID [2022-04-08 14:34:23,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {29898#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29898#(< ~counter~0 90)} is VALID [2022-04-08 14:34:23,680 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29169#true} {29898#(< ~counter~0 90)} #55#return; {29898#(< ~counter~0 90)} is VALID [2022-04-08 14:34:23,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,681 INFO L272 TraceCheckUtils]: 46: Hoare triple {29898#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {29898#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {29898#(< ~counter~0 90)} is VALID [2022-04-08 14:34:23,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {29923#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29898#(< ~counter~0 90)} is VALID [2022-04-08 14:34:23,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {29923#(< ~counter~0 89)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29923#(< ~counter~0 89)} is VALID [2022-04-08 14:34:23,682 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29169#true} {29923#(< ~counter~0 89)} #55#return; {29923#(< ~counter~0 89)} is VALID [2022-04-08 14:34:23,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,682 INFO L272 TraceCheckUtils]: 38: Hoare triple {29923#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {29923#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {29923#(< ~counter~0 89)} is VALID [2022-04-08 14:34:23,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {29948#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29923#(< ~counter~0 89)} is VALID [2022-04-08 14:34:23,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {29948#(< ~counter~0 88)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29948#(< ~counter~0 88)} is VALID [2022-04-08 14:34:23,684 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29169#true} {29948#(< ~counter~0 88)} #55#return; {29948#(< ~counter~0 88)} is VALID [2022-04-08 14:34:23,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,684 INFO L272 TraceCheckUtils]: 30: Hoare triple {29948#(< ~counter~0 88)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {29948#(< ~counter~0 88)} assume !!(#t~post5 < 100);havoc #t~post5; {29948#(< ~counter~0 88)} is VALID [2022-04-08 14:34:23,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {29973#(< ~counter~0 87)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29948#(< ~counter~0 88)} is VALID [2022-04-08 14:34:23,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {29973#(< ~counter~0 87)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29973#(< ~counter~0 87)} is VALID [2022-04-08 14:34:23,686 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29169#true} {29973#(< ~counter~0 87)} #55#return; {29973#(< ~counter~0 87)} is VALID [2022-04-08 14:34:23,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,686 INFO L272 TraceCheckUtils]: 22: Hoare triple {29973#(< ~counter~0 87)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {29973#(< ~counter~0 87)} assume !!(#t~post5 < 100);havoc #t~post5; {29973#(< ~counter~0 87)} is VALID [2022-04-08 14:34:23,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {29998#(< ~counter~0 86)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29973#(< ~counter~0 87)} is VALID [2022-04-08 14:34:23,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {29998#(< ~counter~0 86)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29998#(< ~counter~0 86)} is VALID [2022-04-08 14:34:23,688 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29169#true} {29998#(< ~counter~0 86)} #55#return; {29998#(< ~counter~0 86)} is VALID [2022-04-08 14:34:23,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,688 INFO L272 TraceCheckUtils]: 14: Hoare triple {29998#(< ~counter~0 86)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {29998#(< ~counter~0 86)} assume !!(#t~post5 < 100);havoc #t~post5; {29998#(< ~counter~0 86)} is VALID [2022-04-08 14:34:23,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {30023#(< ~counter~0 85)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29998#(< ~counter~0 86)} is VALID [2022-04-08 14:34:23,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {30023#(< ~counter~0 85)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {30023#(< ~counter~0 85)} is VALID [2022-04-08 14:34:23,690 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29169#true} {30023#(< ~counter~0 85)} #53#return; {30023#(< ~counter~0 85)} is VALID [2022-04-08 14:34:23,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 14:34:23,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-08 14:34:23,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-08 14:34:23,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {30023#(< ~counter~0 85)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {29169#true} is VALID [2022-04-08 14:34:23,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {30023#(< ~counter~0 85)} 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; {30023#(< ~counter~0 85)} is VALID [2022-04-08 14:34:23,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {30023#(< ~counter~0 85)} call #t~ret6 := main(); {30023#(< ~counter~0 85)} is VALID [2022-04-08 14:34:23,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30023#(< ~counter~0 85)} {29169#true} #61#return; {30023#(< ~counter~0 85)} is VALID [2022-04-08 14:34:23,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {30023#(< ~counter~0 85)} assume true; {30023#(< ~counter~0 85)} is VALID [2022-04-08 14:34:23,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {29169#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; {30023#(< ~counter~0 85)} is VALID [2022-04-08 14:34:23,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2022-04-08 14:34:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 32 proven. 450 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 14:34:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:23,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961501663] [2022-04-08 14:34:23,692 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:23,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168233370] [2022-04-08 14:34:23,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168233370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:23,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:23,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 14:34:23,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:23,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [364274739] [2022-04-08 14:34:23,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [364274739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:23,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:23,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 14:34:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433440840] [2022-04-08 14:34:23,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:23,694 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 143 [2022-04-08 14:34:23,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:23,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:23,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:23,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 14:34:23,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:23,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 14:34:23,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 14:34:23,809 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:24,509 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2022-04-08 14:34:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 14:34:24,510 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 143 [2022-04-08 14:34:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 158 transitions. [2022-04-08 14:34:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 158 transitions. [2022-04-08 14:34:24,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 158 transitions. [2022-04-08 14:34:24,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:24,652 INFO L225 Difference]: With dead ends: 158 [2022-04-08 14:34:24,652 INFO L226 Difference]: Without dead ends: 148 [2022-04-08 14:34:24,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 14:34:24,653 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:24,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 171 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-08 14:34:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-04-08 14:34:24,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:24,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:34:24,914 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:34:24,914 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:34:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:24,916 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2022-04-08 14:34:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-08 14:34:24,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:24,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:24,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 148 states. [2022-04-08 14:34:24,916 INFO L87 Difference]: Start difference. First operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 148 states. [2022-04-08 14:34:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:24,918 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2022-04-08 14:34:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-08 14:34:24,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:24,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:24,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:24,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:34:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2022-04-08 14:34:24,921 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 143 [2022-04-08 14:34:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:24,921 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2022-04-08 14:34:24,921 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:34:24,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 150 transitions. [2022-04-08 14:34:25,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-08 14:34:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-08 14:34:25,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:25,245 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:25,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-08 14:34:25,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:25,459 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash 780571829, now seen corresponding path program 29 times [2022-04-08 14:34:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:25,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1818230439] [2022-04-08 14:34:25,553 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:25,553 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash 780571829, now seen corresponding path program 30 times [2022-04-08 14:34:25,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:25,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607999510] [2022-04-08 14:34:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:25,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:25,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:25,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829335093] [2022-04-08 14:34:25,573 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:34:25,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:25,574 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:25,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process